/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:12:00,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:12:00,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:12:01,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:12:01,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:12:01,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:12:01,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:12:01,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:12:01,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:12:01,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:12:01,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:12:01,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:12:01,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:12:01,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:12:01,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:12:01,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:12:01,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:12:01,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:12:01,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:12:01,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:12:01,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:12:01,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:12:01,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:12:01,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:12:01,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:12:01,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:12:01,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:12:01,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:12:01,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:12:01,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:12:01,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:12:01,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:12:01,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:12:01,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:12:01,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:12:01,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:12:01,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:12:01,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:12:01,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:12:01,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:12:01,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:12:01,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-02-10 20:12:01,067 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:12:01,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:12:01,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:12:01,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:12:01,069 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:12:01,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:12:01,069 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:12:01,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:12:01,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:12:01,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:12:01,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:12:01,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:12:01,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:12:01,072 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:12:01,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:12:01,072 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:12:01,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:12:01,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:12:01,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:12:01,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:12:01,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:12:01,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:01,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:12:01,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:12:01,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:12:01,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:12:01,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:12:01,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:12:01,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:12:01,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:12:01,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:12:01,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:12:01,399 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:12:01,400 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:12:01,401 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl [2020-02-10 20:12:01,401 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl' [2020-02-10 20:12:01,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:12:01,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:12:01,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:12:01,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:12:01,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:12:01,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:12:01,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:12:01,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:12:01,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:12:01,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (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 [2020-02-10 20:12:01,601 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:12:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:12:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:12:01,603 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:12:01,604 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:12:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:12:01,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:12:01,604 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:12:01,605 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:12:01,605 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:12:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:12:01,605 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:12:01,605 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:12:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:12:01,606 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:12:01,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:12:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:12:01,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:12:01,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:12:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:12:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:12:01,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:12:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:12:01,608 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:12:01,610 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:12:01,882 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:12:01,883 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:12:01,887 INFO L202 PluginConnector]: Adding new model example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:01 BoogieIcfgContainer [2020-02-10 20:12:01,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:12:01,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:12:01,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:12:01,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:12:01,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/2) ... [2020-02-10 20:12:01,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d2648 and model type example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:12:01, skipping insertion in model container [2020-02-10 20:12:01,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:01" (2/2) ... [2020-02-10 20:12:01,895 INFO L109 eAbstractionObserver]: Analyzing ICFG example_7.bpl [2020-02-10 20:12:01,905 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:12:01,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:12:01,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:12:01,914 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:12:02,095 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-02-10 20:12:02,116 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:12:02,116 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:12:02,116 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:12:02,116 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:12:02,117 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:12:02,117 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:12:02,117 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:12:02,117 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:12:02,133 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 80 transitions [2020-02-10 20:12:02,135 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 80 transitions [2020-02-10 20:12:02,385 INFO L129 PetriNetUnfolder]: 321/472 cut-off events. [2020-02-10 20:12:02,385 INFO L130 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2020-02-10 20:12:02,408 INFO L76 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 472 events. 321/472 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1550 event pairs. 0/471 useless extension candidates. Maximal degree in co-relation 416. Up to 140 conditions per place. [2020-02-10 20:12:02,420 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 80 transitions [2020-02-10 20:12:02,517 INFO L129 PetriNetUnfolder]: 321/472 cut-off events. [2020-02-10 20:12:02,517 INFO L130 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2020-02-10 20:12:02,522 INFO L76 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 472 events. 321/472 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1550 event pairs. 0/471 useless extension candidates. Maximal degree in co-relation 416. Up to 140 conditions per place. [2020-02-10 20:12:02,531 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1260 [2020-02-10 20:12:02,532 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 20:12:02,693 INFO L206 etLargeBlockEncoding]: Checked pairs total: 357 [2020-02-10 20:12:02,693 INFO L214 etLargeBlockEncoding]: Total number of compositions: 8 [2020-02-10 20:12:02,698 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 72 transitions [2020-02-10 20:12:02,948 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2316 states. [2020-02-10 20:12:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states. [2020-02-10 20:12:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:03,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,031 INFO L415 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] [2020-02-10 20:12:03,031 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1886146014, now seen corresponding path program 1 times [2020-02-10 20:12:03,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127058083] [2020-02-10 20:12:03,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127058083] [2020-02-10 20:12:03,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:03,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35252850] [2020-02-10 20:12:03,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:03,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:03,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:03,321 INFO L87 Difference]: Start difference. First operand 2316 states. Second operand 3 states. [2020-02-10 20:12:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,426 INFO L93 Difference]: Finished difference Result 1820 states and 7856 transitions. [2020-02-10 20:12:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:03,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 20:12:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,486 INFO L225 Difference]: With dead ends: 1820 [2020-02-10 20:12:03,487 INFO L226 Difference]: Without dead ends: 1819 [2020-02-10 20:12:03,489 INFO L633 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 [2020-02-10 20:12:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2020-02-10 20:12:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1819. [2020-02-10 20:12:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-02-10 20:12:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 7855 transitions. [2020-02-10 20:12:03,673 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 7855 transitions. Word has length 22 [2020-02-10 20:12:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,675 INFO L479 AbstractCegarLoop]: Abstraction has 1819 states and 7855 transitions. [2020-02-10 20:12:03,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 7855 transitions. [2020-02-10 20:12:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:03,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,684 INFO L415 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] [2020-02-10 20:12:03,685 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1634401592, now seen corresponding path program 1 times [2020-02-10 20:12:03,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049657081] [2020-02-10 20:12:03,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049657081] [2020-02-10 20:12:03,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:03,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401005113] [2020-02-10 20:12:03,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:03,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:03,717 INFO L87 Difference]: Start difference. First operand 1819 states and 7855 transitions. Second operand 3 states. [2020-02-10 20:12:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,750 INFO L93 Difference]: Finished difference Result 1275 states and 5199 transitions. [2020-02-10 20:12:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:03,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 20:12:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,764 INFO L225 Difference]: With dead ends: 1275 [2020-02-10 20:12:03,765 INFO L226 Difference]: Without dead ends: 1275 [2020-02-10 20:12:03,766 INFO L633 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 [2020-02-10 20:12:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2020-02-10 20:12:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2020-02-10 20:12:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2020-02-10 20:12:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 5199 transitions. [2020-02-10 20:12:03,821 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 5199 transitions. Word has length 22 [2020-02-10 20:12:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,822 INFO L479 AbstractCegarLoop]: Abstraction has 1275 states and 5199 transitions. [2020-02-10 20:12:03,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 5199 transitions. [2020-02-10 20:12:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:03,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,828 INFO L415 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] [2020-02-10 20:12:03,829 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash -488840274, now seen corresponding path program 1 times [2020-02-10 20:12:03,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622020069] [2020-02-10 20:12:03,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622020069] [2020-02-10 20:12:03,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:03,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017639537] [2020-02-10 20:12:03,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:03,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:03,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:03,869 INFO L87 Difference]: Start difference. First operand 1275 states and 5199 transitions. Second operand 3 states. [2020-02-10 20:12:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,894 INFO L93 Difference]: Finished difference Result 847 states and 3331 transitions. [2020-02-10 20:12:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:03,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 20:12:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,904 INFO L225 Difference]: With dead ends: 847 [2020-02-10 20:12:03,904 INFO L226 Difference]: Without dead ends: 847 [2020-02-10 20:12:03,905 INFO L633 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 [2020-02-10 20:12:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2020-02-10 20:12:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2020-02-10 20:12:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-02-10 20:12:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 3331 transitions. [2020-02-10 20:12:03,949 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 3331 transitions. Word has length 22 [2020-02-10 20:12:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,949 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 3331 transitions. [2020-02-10 20:12:03,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 3331 transitions. [2020-02-10 20:12:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:03,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,954 INFO L415 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] [2020-02-10 20:12:03,954 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 625763952, now seen corresponding path program 1 times [2020-02-10 20:12:03,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080735065] [2020-02-10 20:12:03,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080735065] [2020-02-10 20:12:03,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:03,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086646622] [2020-02-10 20:12:03,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:03,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:03,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:03,993 INFO L87 Difference]: Start difference. First operand 847 states and 3331 transitions. Second operand 3 states. [2020-02-10 20:12:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,050 INFO L93 Difference]: Finished difference Result 575 states and 2209 transitions. [2020-02-10 20:12:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:04,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 20:12:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,056 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:12:04,056 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:12:04,057 INFO L633 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 [2020-02-10 20:12:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:12:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2020-02-10 20:12:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-02-10 20:12:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 2209 transitions. [2020-02-10 20:12:04,082 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 2209 transitions. Word has length 22 [2020-02-10 20:12:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,083 INFO L479 AbstractCegarLoop]: Abstraction has 575 states and 2209 transitions. [2020-02-10 20:12:04,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 2209 transitions. [2020-02-10 20:12:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:04,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,086 INFO L415 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] [2020-02-10 20:12:04,086 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash 625764882, now seen corresponding path program 1 times [2020-02-10 20:12:04,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140180699] [2020-02-10 20:12:04,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:04,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140180699] [2020-02-10 20:12:04,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:04,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371428152] [2020-02-10 20:12:04,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:04,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:04,659 INFO L87 Difference]: Start difference. First operand 575 states and 2209 transitions. Second operand 9 states. [2020-02-10 20:12:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,801 INFO L93 Difference]: Finished difference Result 908 states and 3017 transitions. [2020-02-10 20:12:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:04,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,809 INFO L225 Difference]: With dead ends: 908 [2020-02-10 20:12:04,809 INFO L226 Difference]: Without dead ends: 884 [2020-02-10 20:12:04,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-02-10 20:12:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 588. [2020-02-10 20:12:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-02-10 20:12:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2250 transitions. [2020-02-10 20:12:04,843 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2250 transitions. Word has length 22 [2020-02-10 20:12:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,843 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 2250 transitions. [2020-02-10 20:12:04,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2250 transitions. [2020-02-10 20:12:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:04,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,846 INFO L415 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] [2020-02-10 20:12:04,846 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2078936528, now seen corresponding path program 2 times [2020-02-10 20:12:04,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055484126] [2020-02-10 20:12:04,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,423 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-02-10 20:12:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055484126] [2020-02-10 20:12:05,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:05,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310693492] [2020-02-10 20:12:05,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:05,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:05,434 INFO L87 Difference]: Start difference. First operand 588 states and 2250 transitions. Second operand 9 states. [2020-02-10 20:12:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,584 INFO L93 Difference]: Finished difference Result 900 states and 2993 transitions. [2020-02-10 20:12:05,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:05,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,592 INFO L225 Difference]: With dead ends: 900 [2020-02-10 20:12:05,592 INFO L226 Difference]: Without dead ends: 879 [2020-02-10 20:12:05,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-02-10 20:12:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 583. [2020-02-10 20:12:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2020-02-10 20:12:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 2238 transitions. [2020-02-10 20:12:05,626 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 2238 transitions. Word has length 22 [2020-02-10 20:12:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,777 INFO L479 AbstractCegarLoop]: Abstraction has 583 states and 2238 transitions. [2020-02-10 20:12:05,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 2238 transitions. [2020-02-10 20:12:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:05,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,781 INFO L415 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] [2020-02-10 20:12:05,781 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1978315202, now seen corresponding path program 3 times [2020-02-10 20:12:05,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320611241] [2020-02-10 20:12:05,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320611241] [2020-02-10 20:12:06,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:06,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665049223] [2020-02-10 20:12:06,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:06,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:06,152 INFO L87 Difference]: Start difference. First operand 583 states and 2238 transitions. Second operand 9 states. [2020-02-10 20:12:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,250 INFO L93 Difference]: Finished difference Result 908 states and 3014 transitions. [2020-02-10 20:12:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:06,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,257 INFO L225 Difference]: With dead ends: 908 [2020-02-10 20:12:06,258 INFO L226 Difference]: Without dead ends: 884 [2020-02-10 20:12:06,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-02-10 20:12:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 588. [2020-02-10 20:12:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-02-10 20:12:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2247 transitions. [2020-02-10 20:12:06,288 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2247 transitions. Word has length 22 [2020-02-10 20:12:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,289 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 2247 transitions. [2020-02-10 20:12:06,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2247 transitions. [2020-02-10 20:12:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:06,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,292 INFO L415 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] [2020-02-10 20:12:06,292 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 684254128, now seen corresponding path program 1 times [2020-02-10 20:12:06,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320319927] [2020-02-10 20:12:06,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320319927] [2020-02-10 20:12:06,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:06,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866805845] [2020-02-10 20:12:06,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:06,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:06,307 INFO L87 Difference]: Start difference. First operand 588 states and 2247 transitions. Second operand 3 states. [2020-02-10 20:12:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,314 INFO L93 Difference]: Finished difference Result 522 states and 1921 transitions. [2020-02-10 20:12:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:06,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 20:12:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,319 INFO L225 Difference]: With dead ends: 522 [2020-02-10 20:12:06,319 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 20:12:06,320 INFO L633 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 [2020-02-10 20:12:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 20:12:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-02-10 20:12:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-02-10 20:12:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1921 transitions. [2020-02-10 20:12:06,341 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1921 transitions. Word has length 22 [2020-02-10 20:12:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,341 INFO L479 AbstractCegarLoop]: Abstraction has 522 states and 1921 transitions. [2020-02-10 20:12:06,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1921 transitions. [2020-02-10 20:12:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:06,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,344 INFO L415 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] [2020-02-10 20:12:06,344 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1999772210, now seen corresponding path program 1 times [2020-02-10 20:12:06,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594414250] [2020-02-10 20:12:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594414250] [2020-02-10 20:12:06,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:06,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136333548] [2020-02-10 20:12:06,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:06,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:06,362 INFO L87 Difference]: Start difference. First operand 522 states and 1921 transitions. Second operand 3 states. [2020-02-10 20:12:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,368 INFO L93 Difference]: Finished difference Result 392 states and 1373 transitions. [2020-02-10 20:12:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:06,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 20:12:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,372 INFO L225 Difference]: With dead ends: 392 [2020-02-10 20:12:06,373 INFO L226 Difference]: Without dead ends: 392 [2020-02-10 20:12:06,373 INFO L633 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 [2020-02-10 20:12:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-02-10 20:12:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-02-10 20:12:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1373 transitions. [2020-02-10 20:12:06,391 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1373 transitions. Word has length 22 [2020-02-10 20:12:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,391 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1373 transitions. [2020-02-10 20:12:06,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1373 transitions. [2020-02-10 20:12:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:06,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,393 INFO L415 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] [2020-02-10 20:12:06,393 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1755583602, now seen corresponding path program 4 times [2020-02-10 20:12:06,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093228812] [2020-02-10 20:12:06,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093228812] [2020-02-10 20:12:06,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:06,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161816083] [2020-02-10 20:12:06,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:06,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:06,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:06,716 INFO L87 Difference]: Start difference. First operand 392 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:12:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,809 INFO L93 Difference]: Finished difference Result 593 states and 1773 transitions. [2020-02-10 20:12:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:06,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,814 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:12:06,814 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:12:06,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:12:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-02-10 20:12:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1369 transitions. [2020-02-10 20:12:06,836 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1369 transitions. Word has length 22 [2020-02-10 20:12:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,837 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1369 transitions. [2020-02-10 20:12:06,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1369 transitions. [2020-02-10 20:12:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:06,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,839 INFO L415 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] [2020-02-10 20:12:06,839 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 784024996, now seen corresponding path program 5 times [2020-02-10 20:12:06,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968677068] [2020-02-10 20:12:06,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968677068] [2020-02-10 20:12:07,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:07,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007862421] [2020-02-10 20:12:07,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:07,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:07,239 INFO L87 Difference]: Start difference. First operand 390 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:12:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,341 INFO L93 Difference]: Finished difference Result 589 states and 1766 transitions. [2020-02-10 20:12:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:07,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,346 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:12:07,346 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:12:07,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:12:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 391. [2020-02-10 20:12:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1370 transitions. [2020-02-10 20:12:07,367 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1370 transitions. Word has length 22 [2020-02-10 20:12:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,367 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1370 transitions. [2020-02-10 20:12:07,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1370 transitions. [2020-02-10 20:12:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:07,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,369 INFO L415 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] [2020-02-10 20:12:07,369 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash -661492014, now seen corresponding path program 6 times [2020-02-10 20:12:07,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732890521] [2020-02-10 20:12:07,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732890521] [2020-02-10 20:12:07,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:07,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977245766] [2020-02-10 20:12:07,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:07,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:07,799 INFO L87 Difference]: Start difference. First operand 391 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:12:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,896 INFO L93 Difference]: Finished difference Result 587 states and 1761 transitions. [2020-02-10 20:12:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:07,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,902 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:12:07,903 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:12:07,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:12:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 388. [2020-02-10 20:12:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1365 transitions. [2020-02-10 20:12:07,920 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1365 transitions. Word has length 22 [2020-02-10 20:12:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,921 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1365 transitions. [2020-02-10 20:12:07,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1365 transitions. [2020-02-10 20:12:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:07,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,923 INFO L415 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] [2020-02-10 20:12:07,923 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 203279156, now seen corresponding path program 7 times [2020-02-10 20:12:07,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206896151] [2020-02-10 20:12:07,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206896151] [2020-02-10 20:12:08,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:08,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797540877] [2020-02-10 20:12:08,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:08,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:08,257 INFO L87 Difference]: Start difference. First operand 388 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:12:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,364 INFO L93 Difference]: Finished difference Result 608 states and 1810 transitions. [2020-02-10 20:12:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:08,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,370 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:12:08,370 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:12:08,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:12:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 395. [2020-02-10 20:12:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1381 transitions. [2020-02-10 20:12:08,389 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1381 transitions. Word has length 22 [2020-02-10 20:12:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,389 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1381 transitions. [2020-02-10 20:12:08,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1381 transitions. [2020-02-10 20:12:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:08,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,392 INFO L415 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] [2020-02-10 20:12:08,392 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1793545042, now seen corresponding path program 8 times [2020-02-10 20:12:08,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315042764] [2020-02-10 20:12:08,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315042764] [2020-02-10 20:12:08,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:08,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007239310] [2020-02-10 20:12:08,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:08,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:08,705 INFO L87 Difference]: Start difference. First operand 395 states and 1381 transitions. Second operand 9 states. [2020-02-10 20:12:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,816 INFO L93 Difference]: Finished difference Result 603 states and 1797 transitions. [2020-02-10 20:12:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:08,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,822 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:12:08,822 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:12:08,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:12:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 391. [2020-02-10 20:12:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1372 transitions. [2020-02-10 20:12:08,842 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1372 transitions. Word has length 22 [2020-02-10 20:12:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,842 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1372 transitions. [2020-02-10 20:12:08,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1372 transitions. [2020-02-10 20:12:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:08,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,844 INFO L415 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] [2020-02-10 20:12:08,845 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash 304191328, now seen corresponding path program 9 times [2020-02-10 20:12:08,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015646457] [2020-02-10 20:12:08,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015646457] [2020-02-10 20:12:09,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:09,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644956046] [2020-02-10 20:12:09,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:09,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:09,184 INFO L87 Difference]: Start difference. First operand 391 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:12:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,270 INFO L93 Difference]: Finished difference Result 606 states and 1802 transitions. [2020-02-10 20:12:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:09,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,275 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:12:09,276 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:12:09,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:12:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 394. [2020-02-10 20:12:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1376 transitions. [2020-02-10 20:12:09,298 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1376 transitions. Word has length 22 [2020-02-10 20:12:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,299 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1376 transitions. [2020-02-10 20:12:09,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1376 transitions. [2020-02-10 20:12:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:09,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,300 INFO L415 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] [2020-02-10 20:12:09,303 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash 430827702, now seen corresponding path program 10 times [2020-02-10 20:12:09,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282269207] [2020-02-10 20:12:09,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282269207] [2020-02-10 20:12:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:09,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479620123] [2020-02-10 20:12:09,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:09,740 INFO L87 Difference]: Start difference. First operand 394 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:12:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,861 INFO L93 Difference]: Finished difference Result 600 states and 1788 transitions. [2020-02-10 20:12:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:09,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,866 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:12:09,867 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:12:09,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:12:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 391. [2020-02-10 20:12:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1369 transitions. [2020-02-10 20:12:09,883 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1369 transitions. Word has length 22 [2020-02-10 20:12:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,884 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1369 transitions. [2020-02-10 20:12:09,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1369 transitions. [2020-02-10 20:12:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:09,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,885 INFO L415 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] [2020-02-10 20:12:09,885 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1984190466, now seen corresponding path program 11 times [2020-02-10 20:12:09,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599715233] [2020-02-10 20:12:09,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599715233] [2020-02-10 20:12:10,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:10,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495645425] [2020-02-10 20:12:10,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:10,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:10,260 INFO L87 Difference]: Start difference. First operand 391 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:12:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,383 INFO L93 Difference]: Finished difference Result 595 states and 1779 transitions. [2020-02-10 20:12:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:10,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,389 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:12:10,390 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:12:10,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:12:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2020-02-10 20:12:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1372 transitions. [2020-02-10 20:12:10,406 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1372 transitions. Word has length 22 [2020-02-10 20:12:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,406 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1372 transitions. [2020-02-10 20:12:10,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1372 transitions. [2020-02-10 20:12:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:10,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,408 INFO L415 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] [2020-02-10 20:12:10,408 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -642257678, now seen corresponding path program 12 times [2020-02-10 20:12:10,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351771689] [2020-02-10 20:12:10,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351771689] [2020-02-10 20:12:10,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:10,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552276400] [2020-02-10 20:12:10,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:10,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:10,745 INFO L87 Difference]: Start difference. First operand 393 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:12:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,867 INFO L93 Difference]: Finished difference Result 594 states and 1775 transitions. [2020-02-10 20:12:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:10,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,872 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:12:10,872 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:12:10,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:12:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 388. [2020-02-10 20:12:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1363 transitions. [2020-02-10 20:12:10,888 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,888 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1363 transitions. [2020-02-10 20:12:10,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1363 transitions. [2020-02-10 20:12:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:10,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,890 INFO L415 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] [2020-02-10 20:12:10,890 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1959727298, now seen corresponding path program 13 times [2020-02-10 20:12:10,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495442353] [2020-02-10 20:12:10,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495442353] [2020-02-10 20:12:11,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:11,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036256351] [2020-02-10 20:12:11,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:11,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:11,209 INFO L87 Difference]: Start difference. First operand 388 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:12:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,295 INFO L93 Difference]: Finished difference Result 598 states and 1781 transitions. [2020-02-10 20:12:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:11,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,301 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:12:11,301 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:12:11,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:12:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 392. [2020-02-10 20:12:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1371 transitions. [2020-02-10 20:12:11,317 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1371 transitions. Word has length 22 [2020-02-10 20:12:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,318 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1371 transitions. [2020-02-10 20:12:11,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1371 transitions. [2020-02-10 20:12:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:11,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,319 INFO L415 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] [2020-02-10 20:12:11,319 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1774171506, now seen corresponding path program 14 times [2020-02-10 20:12:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827248272] [2020-02-10 20:12:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827248272] [2020-02-10 20:12:11,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:11,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050111403] [2020-02-10 20:12:11,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:11,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:11,622 INFO L87 Difference]: Start difference. First operand 392 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:12:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,707 INFO L93 Difference]: Finished difference Result 591 states and 1766 transitions. [2020-02-10 20:12:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:11,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,712 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:12:11,713 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:12:11,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:12:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 390. [2020-02-10 20:12:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1367 transitions. [2020-02-10 20:12:11,729 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1367 transitions. Word has length 22 [2020-02-10 20:12:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,729 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1367 transitions. [2020-02-10 20:12:11,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1367 transitions. [2020-02-10 20:12:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:11,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,731 INFO L415 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] [2020-02-10 20:12:11,731 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash 359289444, now seen corresponding path program 15 times [2020-02-10 20:12:11,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677864449] [2020-02-10 20:12:11,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677864449] [2020-02-10 20:12:12,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:12,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153522523] [2020-02-10 20:12:12,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:12,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:12,085 INFO L87 Difference]: Start difference. First operand 390 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:12:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,163 INFO L93 Difference]: Finished difference Result 600 states and 1784 transitions. [2020-02-10 20:12:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:12,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,165 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:12:12,166 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:12:12,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:12:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2020-02-10 20:12:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1371 transitions. [2020-02-10 20:12:12,181 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1371 transitions. Word has length 22 [2020-02-10 20:12:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,181 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1371 transitions. [2020-02-10 20:12:12,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1371 transitions. [2020-02-10 20:12:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:12,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,183 INFO L415 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] [2020-02-10 20:12:12,183 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash -602914218, now seen corresponding path program 16 times [2020-02-10 20:12:12,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927625112] [2020-02-10 20:12:12,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927625112] [2020-02-10 20:12:12,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:12,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65786060] [2020-02-10 20:12:12,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:12,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:12,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:12,526 INFO L87 Difference]: Start difference. First operand 393 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:12:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,670 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2020-02-10 20:12:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:12,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,673 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:12:12,674 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:12:12,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:12:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 390. [2020-02-10 20:12:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-02-10 20:12:12,691 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-02-10 20:12:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,691 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-02-10 20:12:12,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-02-10 20:12:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:12,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,693 INFO L415 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] [2020-02-10 20:12:12,694 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 414011670, now seen corresponding path program 17 times [2020-02-10 20:12:12,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806401719] [2020-02-10 20:12:12,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806401719] [2020-02-10 20:12:13,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:13,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842083900] [2020-02-10 20:12:13,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:13,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:13,105 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:12:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,193 INFO L93 Difference]: Finished difference Result 584 states and 1751 transitions. [2020-02-10 20:12:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:13,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,196 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:12:13,196 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:12:13,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:12:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 391. [2020-02-10 20:12:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 20:12:13,209 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,210 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 20:12:13,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 20:12:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:13,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,211 INFO L415 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] [2020-02-10 20:12:13,211 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2024952628, now seen corresponding path program 18 times [2020-02-10 20:12:13,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058611301] [2020-02-10 20:12:13,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058611301] [2020-02-10 20:12:13,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:13,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95485147] [2020-02-10 20:12:13,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:13,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:13,559 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,673 INFO L93 Difference]: Finished difference Result 585 states and 1752 transitions. [2020-02-10 20:12:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:13,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,678 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:12:13,678 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:12:13,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:12:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 388. [2020-02-10 20:12:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1361 transitions. [2020-02-10 20:12:13,693 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1361 transitions. Word has length 22 [2020-02-10 20:12:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,693 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1361 transitions. [2020-02-10 20:12:13,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1361 transitions. [2020-02-10 20:12:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:13,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,694 INFO L415 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] [2020-02-10 20:12:13,695 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,695 INFO L82 PathProgramCache]: Analyzing trace with hash 322537952, now seen corresponding path program 19 times [2020-02-10 20:12:13,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213201148] [2020-02-10 20:12:13,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213201148] [2020-02-10 20:12:14,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:14,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88078106] [2020-02-10 20:12:14,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:14,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:14,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:14,032 INFO L87 Difference]: Start difference. First operand 388 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:12:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,169 INFO L93 Difference]: Finished difference Result 579 states and 1743 transitions. [2020-02-10 20:12:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:14,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,171 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:12:14,172 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:12:14,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:12:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-02-10 20:12:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-02-10 20:12:14,187 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-02-10 20:12:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,187 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-02-10 20:12:14,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-02-10 20:12:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:14,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,189 INFO L415 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] [2020-02-10 20:12:14,189 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1122979058, now seen corresponding path program 20 times [2020-02-10 20:12:14,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745851757] [2020-02-10 20:12:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745851757] [2020-02-10 20:12:14,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:14,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524361733] [2020-02-10 20:12:14,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:14,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:14,497 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:12:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,587 INFO L93 Difference]: Finished difference Result 577 states and 1738 transitions. [2020-02-10 20:12:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:14,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,590 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:12:14,590 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:12:14,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:12:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 389. [2020-02-10 20:12:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1363 transitions. [2020-02-10 20:12:14,604 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,604 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1363 transitions. [2020-02-10 20:12:14,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1363 transitions. [2020-02-10 20:12:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:14,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,606 INFO L415 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] [2020-02-10 20:12:14,606 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1277899902, now seen corresponding path program 21 times [2020-02-10 20:12:14,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763670452] [2020-02-10 20:12:14,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763670452] [2020-02-10 20:12:14,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:14,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5294698] [2020-02-10 20:12:14,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:14,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:14,953 INFO L87 Difference]: Start difference. First operand 389 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:12:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,080 INFO L93 Difference]: Finished difference Result 581 states and 1747 transitions. [2020-02-10 20:12:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:15,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,083 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:12:15,083 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:12:15,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:12:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 391. [2020-02-10 20:12:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 20:12:15,100 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,100 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 20:12:15,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 20:12:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:15,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,102 INFO L415 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] [2020-02-10 20:12:15,102 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1024807150, now seen corresponding path program 22 times [2020-02-10 20:12:15,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441319463] [2020-02-10 20:12:15,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441319463] [2020-02-10 20:12:15,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:15,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874735931] [2020-02-10 20:12:15,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:15,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:15,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:15,410 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,530 INFO L93 Difference]: Finished difference Result 580 states and 1743 transitions. [2020-02-10 20:12:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:15,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,533 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:12:15,533 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:12:15,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:12:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-02-10 20:12:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-02-10 20:12:15,546 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-02-10 20:12:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,546 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-02-10 20:12:15,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-02-10 20:12:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:15,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,548 INFO L415 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] [2020-02-10 20:12:15,548 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash -28887470, now seen corresponding path program 23 times [2020-02-10 20:12:15,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340410445] [2020-02-10 20:12:15,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340410445] [2020-02-10 20:12:15,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:15,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205376186] [2020-02-10 20:12:15,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:15,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:15,881 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:12:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,995 INFO L93 Difference]: Finished difference Result 576 states and 1735 transitions. [2020-02-10 20:12:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:15,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,998 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:12:15,998 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:12:15,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:12:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 390. [2020-02-10 20:12:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 20:12:16,013 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,014 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 20:12:16,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 20:12:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:16,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,015 INFO L415 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] [2020-02-10 20:12:16,015 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1582053488, now seen corresponding path program 24 times [2020-02-10 20:12:16,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904337884] [2020-02-10 20:12:16,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904337884] [2020-02-10 20:12:16,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:16,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481742894] [2020-02-10 20:12:16,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:16,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:16,353 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:12:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,489 INFO L93 Difference]: Finished difference Result 577 states and 1736 transitions. [2020-02-10 20:12:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:16,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,493 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:12:16,493 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:12:16,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:12:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 386. [2020-02-10 20:12:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:12:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1357 transitions. [2020-02-10 20:12:16,510 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1357 transitions. Word has length 22 [2020-02-10 20:12:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,510 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1357 transitions. [2020-02-10 20:12:16,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1357 transitions. [2020-02-10 20:12:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:16,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,512 INFO L415 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] [2020-02-10 20:12:16,512 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2110854208, now seen corresponding path program 25 times [2020-02-10 20:12:16,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651197414] [2020-02-10 20:12:16,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651197414] [2020-02-10 20:12:16,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:16,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085481162] [2020-02-10 20:12:16,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:16,859 INFO L87 Difference]: Start difference. First operand 386 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:12:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,951 INFO L93 Difference]: Finished difference Result 618 states and 1833 transitions. [2020-02-10 20:12:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:16,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,954 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:12:16,955 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:12:16,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:12:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 395. [2020-02-10 20:12:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1380 transitions. [2020-02-10 20:12:16,971 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1380 transitions. Word has length 22 [2020-02-10 20:12:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,972 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1380 transitions. [2020-02-10 20:12:16,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1380 transitions. [2020-02-10 20:12:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:16,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,973 INFO L415 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] [2020-02-10 20:12:16,973 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -593847202, now seen corresponding path program 26 times [2020-02-10 20:12:16,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500878042] [2020-02-10 20:12:16,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500878042] [2020-02-10 20:12:17,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:17,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259519786] [2020-02-10 20:12:17,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:17,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:17,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:17,286 INFO L87 Difference]: Start difference. First operand 395 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:12:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,401 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-02-10 20:12:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:17,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,403 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:12:17,403 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:12:17,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:12:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 391. [2020-02-10 20:12:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1372 transitions. [2020-02-10 20:12:17,416 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1372 transitions. Word has length 22 [2020-02-10 20:12:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,416 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1372 transitions. [2020-02-10 20:12:17,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1372 transitions. [2020-02-10 20:12:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:17,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,417 INFO L415 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] [2020-02-10 20:12:17,417 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash -831562768, now seen corresponding path program 27 times [2020-02-10 20:12:17,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509116485] [2020-02-10 20:12:17,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509116485] [2020-02-10 20:12:17,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:17,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891167970] [2020-02-10 20:12:17,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:17,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:17,740 INFO L87 Difference]: Start difference. First operand 391 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:12:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,815 INFO L93 Difference]: Finished difference Result 614 states and 1821 transitions. [2020-02-10 20:12:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:17,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,819 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:12:17,819 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:12:17,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:12:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-02-10 20:12:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1374 transitions. [2020-02-10 20:12:17,834 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1374 transitions. Word has length 22 [2020-02-10 20:12:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,835 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1374 transitions. [2020-02-10 20:12:17,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1374 transitions. [2020-02-10 20:12:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:17,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,836 INFO L415 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] [2020-02-10 20:12:17,836 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -270494276, now seen corresponding path program 28 times [2020-02-10 20:12:17,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233550673] [2020-02-10 20:12:17,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233550673] [2020-02-10 20:12:18,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:18,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301038853] [2020-02-10 20:12:18,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:18,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:18,157 INFO L87 Difference]: Start difference. First operand 393 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:12:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,256 INFO L93 Difference]: Finished difference Result 607 states and 1806 transitions. [2020-02-10 20:12:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:18,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,258 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:12:18,258 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:12:18,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:12:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-02-10 20:12:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1370 transitions. [2020-02-10 20:12:18,269 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1370 transitions. Word has length 22 [2020-02-10 20:12:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,269 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1370 transitions. [2020-02-10 20:12:18,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1370 transitions. [2020-02-10 20:12:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:18,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,271 INFO L415 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] [2020-02-10 20:12:18,271 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2025852974, now seen corresponding path program 29 times [2020-02-10 20:12:18,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073200972] [2020-02-10 20:12:18,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073200972] [2020-02-10 20:12:18,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:18,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192250559] [2020-02-10 20:12:18,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:18,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:18,593 INFO L87 Difference]: Start difference. First operand 391 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:12:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,714 INFO L93 Difference]: Finished difference Result 603 states and 1799 transitions. [2020-02-10 20:12:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:18,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,716 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:12:18,716 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:12:18,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:12:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-02-10 20:12:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1371 transitions. [2020-02-10 20:12:18,728 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1371 transitions. Word has length 22 [2020-02-10 20:12:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,729 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1371 transitions. [2020-02-10 20:12:18,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1371 transitions. [2020-02-10 20:12:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:18,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,730 INFO L415 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] [2020-02-10 20:12:18,730 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 823597312, now seen corresponding path program 30 times [2020-02-10 20:12:18,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560374709] [2020-02-10 20:12:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560374709] [2020-02-10 20:12:19,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:19,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893639380] [2020-02-10 20:12:19,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:19,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:19,050 INFO L87 Difference]: Start difference. First operand 392 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:12:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,134 INFO L93 Difference]: Finished difference Result 601 states and 1794 transitions. [2020-02-10 20:12:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:19,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,136 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:12:19,136 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:12:19,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:12:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 389. [2020-02-10 20:12:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1366 transitions. [2020-02-10 20:12:19,150 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,150 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1366 transitions. [2020-02-10 20:12:19,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1366 transitions. [2020-02-10 20:12:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:19,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,152 INFO L415 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] [2020-02-10 20:12:19,152 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash 350801268, now seen corresponding path program 31 times [2020-02-10 20:12:19,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767878856] [2020-02-10 20:12:19,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767878856] [2020-02-10 20:12:19,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:19,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261808591] [2020-02-10 20:12:19,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:19,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:19,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:19,504 INFO L87 Difference]: Start difference. First operand 389 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,582 INFO L93 Difference]: Finished difference Result 634 states and 1873 transitions. [2020-02-10 20:12:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:19,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,584 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:12:19,584 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:12:19,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:12:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 398. [2020-02-10 20:12:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:12:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1388 transitions. [2020-02-10 20:12:19,595 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1388 transitions. Word has length 22 [2020-02-10 20:12:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,596 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1388 transitions. [2020-02-10 20:12:19,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1388 transitions. [2020-02-10 20:12:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:19,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,597 INFO L415 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] [2020-02-10 20:12:19,597 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1941067154, now seen corresponding path program 32 times [2020-02-10 20:12:19,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000141899] [2020-02-10 20:12:19,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000141899] [2020-02-10 20:12:19,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:19,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954856498] [2020-02-10 20:12:19,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:19,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:19,909 INFO L87 Difference]: Start difference. First operand 398 states and 1388 transitions. Second operand 9 states. [2020-02-10 20:12:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,018 INFO L93 Difference]: Finished difference Result 629 states and 1860 transitions. [2020-02-10 20:12:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:20,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,021 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:12:20,021 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:12:20,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:12:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2020-02-10 20:12:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1378 transitions. [2020-02-10 20:12:20,034 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1378 transitions. Word has length 22 [2020-02-10 20:12:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,035 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1378 transitions. [2020-02-10 20:12:20,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1378 transitions. [2020-02-10 20:12:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:20,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,036 INFO L415 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] [2020-02-10 20:12:20,036 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 615852132, now seen corresponding path program 33 times [2020-02-10 20:12:20,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543579351] [2020-02-10 20:12:20,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543579351] [2020-02-10 20:12:20,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:20,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591423043] [2020-02-10 20:12:20,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:20,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:20,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:20,365 INFO L87 Difference]: Start difference. First operand 394 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:12:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,449 INFO L93 Difference]: Finished difference Result 641 states and 1885 transitions. [2020-02-10 20:12:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:20,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,451 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:12:20,452 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:12:20,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:12:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 402. [2020-02-10 20:12:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:12:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1391 transitions. [2020-02-10 20:12:20,463 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1391 transitions. Word has length 22 [2020-02-10 20:12:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,464 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1391 transitions. [2020-02-10 20:12:20,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1391 transitions. [2020-02-10 20:12:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:20,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,465 INFO L415 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] [2020-02-10 20:12:20,465 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash -881719418, now seen corresponding path program 34 times [2020-02-10 20:12:20,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332580736] [2020-02-10 20:12:20,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332580736] [2020-02-10 20:12:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:20,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987444354] [2020-02-10 20:12:20,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:20,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:20,874 INFO L87 Difference]: Start difference. First operand 402 states and 1391 transitions. Second operand 9 states. [2020-02-10 20:12:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,012 INFO L93 Difference]: Finished difference Result 639 states and 1875 transitions. [2020-02-10 20:12:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:21,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,014 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:12:21,015 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:21,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-02-10 20:12:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1373 transitions. [2020-02-10 20:12:21,031 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1373 transitions. Word has length 22 [2020-02-10 20:12:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,033 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1373 transitions. [2020-02-10 20:12:21,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1373 transitions. [2020-02-10 20:12:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:21,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,035 INFO L415 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] [2020-02-10 20:12:21,035 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash -599444282, now seen corresponding path program 35 times [2020-02-10 20:12:21,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352682345] [2020-02-10 20:12:21,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352682345] [2020-02-10 20:12:21,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:21,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994267163] [2020-02-10 20:12:21,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:21,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:21,302 INFO L87 Difference]: Start difference. First operand 394 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:12:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,419 INFO L93 Difference]: Finished difference Result 626 states and 1850 transitions. [2020-02-10 20:12:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:21,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,421 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:12:21,421 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:12:21,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:12:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 397. [2020-02-10 20:12:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:12:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1378 transitions. [2020-02-10 20:12:21,435 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1378 transitions. Word has length 22 [2020-02-10 20:12:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,435 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1378 transitions. [2020-02-10 20:12:21,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1378 transitions. [2020-02-10 20:12:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:21,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,437 INFO L415 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] [2020-02-10 20:12:21,437 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash -581010256, now seen corresponding path program 36 times [2020-02-10 20:12:21,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831756419] [2020-02-10 20:12:21,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831756419] [2020-02-10 20:12:21,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:21,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731348630] [2020-02-10 20:12:21,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:21,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:21,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:21,761 INFO L87 Difference]: Start difference. First operand 397 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:12:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,865 INFO L93 Difference]: Finished difference Result 629 states and 1853 transitions. [2020-02-10 20:12:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:21,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,867 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:12:21,867 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:12:21,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:12:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 389. [2020-02-10 20:12:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1363 transitions. [2020-02-10 20:12:21,883 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,884 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1363 transitions. [2020-02-10 20:12:21,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1363 transitions. [2020-02-10 20:12:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:21,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,886 INFO L415 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] [2020-02-10 20:12:21,886 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1509912752, now seen corresponding path program 37 times [2020-02-10 20:12:21,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877202776] [2020-02-10 20:12:21,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877202776] [2020-02-10 20:12:22,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:22,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594712846] [2020-02-10 20:12:22,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:22,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:22,182 INFO L87 Difference]: Start difference. First operand 389 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:12:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,301 INFO L93 Difference]: Finished difference Result 622 states and 1836 transitions. [2020-02-10 20:12:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:22,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,303 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:12:22,303 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:12:22,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:12:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2020-02-10 20:12:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1373 transitions. [2020-02-10 20:12:22,314 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1373 transitions. Word has length 22 [2020-02-10 20:12:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,314 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1373 transitions. [2020-02-10 20:12:22,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1373 transitions. [2020-02-10 20:12:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:22,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,316 INFO L415 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] [2020-02-10 20:12:22,316 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2070981244, now seen corresponding path program 38 times [2020-02-10 20:12:22,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609074895] [2020-02-10 20:12:22,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609074895] [2020-02-10 20:12:22,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:22,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112267204] [2020-02-10 20:12:22,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:22,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:22,608 INFO L87 Difference]: Start difference. First operand 394 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:12:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,680 INFO L93 Difference]: Finished difference Result 615 states and 1821 transitions. [2020-02-10 20:12:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:22,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,682 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:12:22,682 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:12:22,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:12:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2020-02-10 20:12:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1369 transitions. [2020-02-10 20:12:22,693 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1369 transitions. Word has length 22 [2020-02-10 20:12:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,693 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1369 transitions. [2020-02-10 20:12:22,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1369 transitions. [2020-02-10 20:12:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:22,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,695 INFO L415 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] [2020-02-10 20:12:22,695 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1772362012, now seen corresponding path program 39 times [2020-02-10 20:12:22,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14214233] [2020-02-10 20:12:22,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14214233] [2020-02-10 20:12:23,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:23,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575744571] [2020-02-10 20:12:23,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:23,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:23,030 INFO L87 Difference]: Start difference. First operand 392 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:12:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,125 INFO L93 Difference]: Finished difference Result 633 states and 1860 transitions. [2020-02-10 20:12:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:23,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,127 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:12:23,127 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:23,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 400. [2020-02-10 20:12:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:12:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1382 transitions. [2020-02-10 20:12:23,138 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1382 transitions. Word has length 22 [2020-02-10 20:12:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,138 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1382 transitions. [2020-02-10 20:12:23,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1382 transitions. [2020-02-10 20:12:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:23,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,139 INFO L415 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] [2020-02-10 20:12:23,139 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1902332458, now seen corresponding path program 40 times [2020-02-10 20:12:23,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029442573] [2020-02-10 20:12:23,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029442573] [2020-02-10 20:12:23,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:23,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704662189] [2020-02-10 20:12:23,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:23,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:23,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:23,449 INFO L87 Difference]: Start difference. First operand 400 states and 1382 transitions. Second operand 9 states. [2020-02-10 20:12:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,582 INFO L93 Difference]: Finished difference Result 631 states and 1850 transitions. [2020-02-10 20:12:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:23,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,584 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:12:23,584 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:12:23,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:12:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 392. [2020-02-10 20:12:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1366 transitions. [2020-02-10 20:12:23,595 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,595 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1366 transitions. [2020-02-10 20:12:23,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1366 transitions. [2020-02-10 20:12:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:23,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,596 INFO L415 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] [2020-02-10 20:12:23,596 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1717639786, now seen corresponding path program 41 times [2020-02-10 20:12:23,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49207008] [2020-02-10 20:12:23,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49207008] [2020-02-10 20:12:23,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:23,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985841185] [2020-02-10 20:12:23,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:23,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:23,903 INFO L87 Difference]: Start difference. First operand 392 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,987 INFO L93 Difference]: Finished difference Result 612 states and 1813 transitions. [2020-02-10 20:12:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:23,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,990 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:12:23,990 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:12:23,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:12:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 393. [2020-02-10 20:12:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1367 transitions. [2020-02-10 20:12:24,001 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1367 transitions. Word has length 22 [2020-02-10 20:12:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,002 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1367 transitions. [2020-02-10 20:12:24,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1367 transitions. [2020-02-10 20:12:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:24,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,002 INFO L415 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] [2020-02-10 20:12:24,003 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1501616354, now seen corresponding path program 42 times [2020-02-10 20:12:24,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97406134] [2020-02-10 20:12:24,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97406134] [2020-02-10 20:12:24,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:24,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058159772] [2020-02-10 20:12:24,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:24,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:24,297 INFO L87 Difference]: Start difference. First operand 393 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:12:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,421 INFO L93 Difference]: Finished difference Result 617 states and 1822 transitions. [2020-02-10 20:12:24,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:24,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,424 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:12:24,424 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:12:24,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:12:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-02-10 20:12:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 20:12:24,436 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 20:12:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,436 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 20:12:24,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 20:12:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:24,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,437 INFO L415 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] [2020-02-10 20:12:24,438 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,438 INFO L82 PathProgramCache]: Analyzing trace with hash -127276594, now seen corresponding path program 43 times [2020-02-10 20:12:24,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156324626] [2020-02-10 20:12:24,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156324626] [2020-02-10 20:12:24,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:24,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429870209] [2020-02-10 20:12:24,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:24,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:24,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:24,768 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:12:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,894 INFO L93 Difference]: Finished difference Result 598 states and 1785 transitions. [2020-02-10 20:12:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:24,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,896 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:12:24,896 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:12:24,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:12:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 391. [2020-02-10 20:12:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 20:12:24,907 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 20:12:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,908 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 20:12:24,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 20:12:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:24,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,909 INFO L415 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] [2020-02-10 20:12:24,909 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1572793604, now seen corresponding path program 44 times [2020-02-10 20:12:24,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467556022] [2020-02-10 20:12:24,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467556022] [2020-02-10 20:12:25,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:25,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190316572] [2020-02-10 20:12:25,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:25,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:25,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:25,251 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:12:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,377 INFO L93 Difference]: Finished difference Result 596 states and 1780 transitions. [2020-02-10 20:12:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:25,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,380 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:12:25,380 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:12:25,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:12:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 390. [2020-02-10 20:12:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1362 transitions. [2020-02-10 20:12:25,393 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1362 transitions. Word has length 22 [2020-02-10 20:12:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,393 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1362 transitions. [2020-02-10 20:12:25,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1362 transitions. [2020-02-10 20:12:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:25,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,395 INFO L415 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] [2020-02-10 20:12:25,395 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 885415938, now seen corresponding path program 45 times [2020-02-10 20:12:25,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252983469] [2020-02-10 20:12:25,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252983469] [2020-02-10 20:12:25,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:25,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66068546] [2020-02-10 20:12:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:25,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:25,719 INFO L87 Difference]: Start difference. First operand 390 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:12:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,834 INFO L93 Difference]: Finished difference Result 605 states and 1800 transitions. [2020-02-10 20:12:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:25,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,836 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:12:25,837 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:12:25,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:12:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 393. [2020-02-10 20:12:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1367 transitions. [2020-02-10 20:12:25,850 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1367 transitions. Word has length 22 [2020-02-10 20:12:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,851 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1367 transitions. [2020-02-10 20:12:25,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1367 transitions. [2020-02-10 20:12:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:25,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,852 INFO L415 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] [2020-02-10 20:12:25,852 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2023516228, now seen corresponding path program 46 times [2020-02-10 20:12:25,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15531891] [2020-02-10 20:12:25,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15531891] [2020-02-10 20:12:26,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:26,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204986060] [2020-02-10 20:12:26,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:26,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:26,185 INFO L87 Difference]: Start difference. First operand 393 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:12:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,295 INFO L93 Difference]: Finished difference Result 608 states and 1803 transitions. [2020-02-10 20:12:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:26,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,297 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:12:26,297 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:12:26,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:12:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-02-10 20:12:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1361 transitions. [2020-02-10 20:12:26,311 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1361 transitions. Word has length 22 [2020-02-10 20:12:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,311 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1361 transitions. [2020-02-10 20:12:26,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1361 transitions. [2020-02-10 20:12:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:26,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,312 INFO L415 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] [2020-02-10 20:12:26,312 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2134428370, now seen corresponding path program 47 times [2020-02-10 20:12:26,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203806745] [2020-02-10 20:12:26,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203806745] [2020-02-10 20:12:26,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:26,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471065359] [2020-02-10 20:12:26,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:26,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:26,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:26,595 INFO L87 Difference]: Start difference. First operand 390 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:12:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,692 INFO L93 Difference]: Finished difference Result 599 states and 1785 transitions. [2020-02-10 20:12:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:26,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,693 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:12:26,693 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:12:26,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:12:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 391. [2020-02-10 20:12:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:12:26,707 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:12:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,707 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:12:26,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:12:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:26,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,708 INFO L415 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] [2020-02-10 20:12:26,708 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1058717214, now seen corresponding path program 48 times [2020-02-10 20:12:26,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841355640] [2020-02-10 20:12:26,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841355640] [2020-02-10 20:12:27,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:27,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707372342] [2020-02-10 20:12:27,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:27,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:27,003 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:12:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,110 INFO L93 Difference]: Finished difference Result 604 states and 1794 transitions. [2020-02-10 20:12:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:27,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,112 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:12:27,113 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:12:27,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:12:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-02-10 20:12:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:12:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1354 transitions. [2020-02-10 20:12:27,124 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1354 transitions. Word has length 22 [2020-02-10 20:12:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,124 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1354 transitions. [2020-02-10 20:12:27,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1354 transitions. [2020-02-10 20:12:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:27,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,125 INFO L415 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] [2020-02-10 20:12:27,125 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1476212864, now seen corresponding path program 49 times [2020-02-10 20:12:27,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76228232] [2020-02-10 20:12:27,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76228232] [2020-02-10 20:12:27,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:27,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596525278] [2020-02-10 20:12:27,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:27,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:27,480 INFO L87 Difference]: Start difference. First operand 386 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:12:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,583 INFO L93 Difference]: Finished difference Result 630 states and 1870 transitions. [2020-02-10 20:12:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:27,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,585 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:12:27,585 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:12:27,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:12:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 397. [2020-02-10 20:12:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:12:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1386 transitions. [2020-02-10 20:12:27,599 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1386 transitions. Word has length 22 [2020-02-10 20:12:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,600 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1386 transitions. [2020-02-10 20:12:27,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1386 transitions. [2020-02-10 20:12:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:27,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,601 INFO L415 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] [2020-02-10 20:12:27,601 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1228488546, now seen corresponding path program 50 times [2020-02-10 20:12:27,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248836811] [2020-02-10 20:12:27,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248836811] [2020-02-10 20:12:27,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:27,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935290504] [2020-02-10 20:12:27,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:27,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:27,922 INFO L87 Difference]: Start difference. First operand 397 states and 1386 transitions. Second operand 9 states. [2020-02-10 20:12:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,060 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-02-10 20:12:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:28,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,062 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:12:28,062 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:12:28,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:12:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2020-02-10 20:12:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1377 transitions. [2020-02-10 20:12:28,075 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1377 transitions. Word has length 22 [2020-02-10 20:12:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,076 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1377 transitions. [2020-02-10 20:12:28,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1377 transitions. [2020-02-10 20:12:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:28,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,077 INFO L415 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] [2020-02-10 20:12:28,077 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1577125036, now seen corresponding path program 51 times [2020-02-10 20:12:28,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595460093] [2020-02-10 20:12:28,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595460093] [2020-02-10 20:12:28,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:28,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155907139] [2020-02-10 20:12:28,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:28,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:28,387 INFO L87 Difference]: Start difference. First operand 393 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:12:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,496 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-02-10 20:12:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:28,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,498 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:12:28,498 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:12:28,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:12:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 396. [2020-02-10 20:12:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:12:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1381 transitions. [2020-02-10 20:12:28,510 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1381 transitions. Word has length 22 [2020-02-10 20:12:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,511 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1381 transitions. [2020-02-10 20:12:28,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1381 transitions. [2020-02-10 20:12:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:28,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,512 INFO L415 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] [2020-02-10 20:12:28,512 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1703761410, now seen corresponding path program 52 times [2020-02-10 20:12:28,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824969751] [2020-02-10 20:12:28,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824969751] [2020-02-10 20:12:28,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:28,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675055718] [2020-02-10 20:12:28,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:28,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:28,843 INFO L87 Difference]: Start difference. First operand 396 states and 1381 transitions. Second operand 9 states. [2020-02-10 20:12:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,963 INFO L93 Difference]: Finished difference Result 622 states and 1848 transitions. [2020-02-10 20:12:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:28,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,965 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:12:28,965 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:12:28,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:12:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-02-10 20:12:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1374 transitions. [2020-02-10 20:12:28,976 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1374 transitions. Word has length 22 [2020-02-10 20:12:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,976 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1374 transitions. [2020-02-10 20:12:28,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1374 transitions. [2020-02-10 20:12:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:28,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,977 INFO L415 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] [2020-02-10 20:12:28,977 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash -711256758, now seen corresponding path program 53 times [2020-02-10 20:12:28,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468789613] [2020-02-10 20:12:28,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468789613] [2020-02-10 20:12:29,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:29,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220547442] [2020-02-10 20:12:29,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:29,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:29,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:29,358 INFO L87 Difference]: Start difference. First operand 393 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:12:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,496 INFO L93 Difference]: Finished difference Result 617 states and 1839 transitions. [2020-02-10 20:12:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:29,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,499 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:12:29,500 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:12:29,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:12:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-02-10 20:12:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1377 transitions. [2020-02-10 20:12:29,522 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1377 transitions. Word has length 22 [2020-02-10 20:12:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,523 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1377 transitions. [2020-02-10 20:12:29,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1377 transitions. [2020-02-10 20:12:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:29,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,525 INFO L415 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] [2020-02-10 20:12:29,525 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 630676030, now seen corresponding path program 54 times [2020-02-10 20:12:29,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715010522] [2020-02-10 20:12:29,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715010522] [2020-02-10 20:12:29,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:29,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728578590] [2020-02-10 20:12:29,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:29,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:29,878 INFO L87 Difference]: Start difference. First operand 395 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:12:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,975 INFO L93 Difference]: Finished difference Result 616 states and 1835 transitions. [2020-02-10 20:12:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:29,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,977 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:12:29,977 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:12:29,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:12:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2020-02-10 20:12:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1367 transitions. [2020-02-10 20:12:29,991 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1367 transitions. Word has length 22 [2020-02-10 20:12:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,991 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1367 transitions. [2020-02-10 20:12:29,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1367 transitions. [2020-02-10 20:12:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:29,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,992 INFO L415 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] [2020-02-10 20:12:29,993 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 138645650, now seen corresponding path program 55 times [2020-02-10 20:12:29,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682194518] [2020-02-10 20:12:29,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:30,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682194518] [2020-02-10 20:12:30,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:30,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344847191] [2020-02-10 20:12:30,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:30,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:30,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:30,296 INFO L87 Difference]: Start difference. First operand 390 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:12:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,381 INFO L93 Difference]: Finished difference Result 642 states and 1897 transitions. [2020-02-10 20:12:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:30,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,384 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:12:30,384 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:12:30,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:12:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 399. [2020-02-10 20:12:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:12:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1389 transitions. [2020-02-10 20:12:30,403 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1389 transitions. Word has length 22 [2020-02-10 20:12:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,403 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1389 transitions. [2020-02-10 20:12:30,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1389 transitions. [2020-02-10 20:12:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:30,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,404 INFO L415 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] [2020-02-10 20:12:30,404 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1728911536, now seen corresponding path program 56 times [2020-02-10 20:12:30,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345387022] [2020-02-10 20:12:30,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:30,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345387022] [2020-02-10 20:12:30,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:30,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328605030] [2020-02-10 20:12:30,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:30,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:30,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:30,712 INFO L87 Difference]: Start difference. First operand 399 states and 1389 transitions. Second operand 9 states. [2020-02-10 20:12:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,833 INFO L93 Difference]: Finished difference Result 637 states and 1884 transitions. [2020-02-10 20:12:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:30,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,835 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:12:30,835 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:12:30,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:12:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 395. [2020-02-10 20:12:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1379 transitions. [2020-02-10 20:12:30,846 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1379 transitions. Word has length 22 [2020-02-10 20:12:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,846 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1379 transitions. [2020-02-10 20:12:30,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1379 transitions. [2020-02-10 20:12:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:30,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,847 INFO L415 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] [2020-02-10 20:12:30,847 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash 403696514, now seen corresponding path program 57 times [2020-02-10 20:12:30,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248570506] [2020-02-10 20:12:30,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248570506] [2020-02-10 20:12:31,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:31,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706418204] [2020-02-10 20:12:31,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:31,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:31,249 INFO L87 Difference]: Start difference. First operand 395 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:12:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,365 INFO L93 Difference]: Finished difference Result 649 states and 1909 transitions. [2020-02-10 20:12:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:31,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,368 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:12:31,368 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:12:31,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:12:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 403. [2020-02-10 20:12:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 20:12:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1392 transitions. [2020-02-10 20:12:31,386 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1392 transitions. Word has length 22 [2020-02-10 20:12:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,386 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1392 transitions. [2020-02-10 20:12:31,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1392 transitions. [2020-02-10 20:12:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:31,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,389 INFO L415 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] [2020-02-10 20:12:31,389 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1093875036, now seen corresponding path program 58 times [2020-02-10 20:12:31,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796002659] [2020-02-10 20:12:31,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796002659] [2020-02-10 20:12:31,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:31,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76967483] [2020-02-10 20:12:31,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:31,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:31,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:31,712 INFO L87 Difference]: Start difference. First operand 403 states and 1392 transitions. Second operand 9 states. [2020-02-10 20:12:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,819 INFO L93 Difference]: Finished difference Result 647 states and 1899 transitions. [2020-02-10 20:12:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:31,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,821 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:12:31,822 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:12:31,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:12:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 20:12:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1374 transitions. [2020-02-10 20:12:31,832 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1374 transitions. Word has length 22 [2020-02-10 20:12:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,833 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1374 transitions. [2020-02-10 20:12:31,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1374 transitions. [2020-02-10 20:12:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:31,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,834 INFO L415 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] [2020-02-10 20:12:31,834 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,834 INFO L82 PathProgramCache]: Analyzing trace with hash -811599900, now seen corresponding path program 59 times [2020-02-10 20:12:31,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748607382] [2020-02-10 20:12:31,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748607382] [2020-02-10 20:12:32,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:32,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466166155] [2020-02-10 20:12:32,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:32,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:32,147 INFO L87 Difference]: Start difference. First operand 395 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:12:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,289 INFO L93 Difference]: Finished difference Result 634 states and 1874 transitions. [2020-02-10 20:12:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:32,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,291 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:12:32,292 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:12:32,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:12:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 398. [2020-02-10 20:12:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:12:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1379 transitions. [2020-02-10 20:12:32,307 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1379 transitions. Word has length 22 [2020-02-10 20:12:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,308 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1379 transitions. [2020-02-10 20:12:32,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1379 transitions. [2020-02-10 20:12:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:32,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,313 INFO L415 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] [2020-02-10 20:12:32,313 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash -793165874, now seen corresponding path program 60 times [2020-02-10 20:12:32,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680513158] [2020-02-10 20:12:32,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680513158] [2020-02-10 20:12:32,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:32,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402668270] [2020-02-10 20:12:32,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:32,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:32,609 INFO L87 Difference]: Start difference. First operand 398 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:12:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,714 INFO L93 Difference]: Finished difference Result 637 states and 1877 transitions. [2020-02-10 20:12:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:32,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,716 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:12:32,717 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:12:32,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:12:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 390. [2020-02-10 20:12:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 20:12:32,727 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,728 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 20:12:32,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 20:12:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:32,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,729 INFO L415 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] [2020-02-10 20:12:32,729 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1075532706, now seen corresponding path program 61 times [2020-02-10 20:12:32,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028025018] [2020-02-10 20:12:32,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028025018] [2020-02-10 20:12:33,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:33,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368531247] [2020-02-10 20:12:33,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:33,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:33,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:33,095 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:12:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,173 INFO L93 Difference]: Finished difference Result 636 states and 1876 transitions. [2020-02-10 20:12:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:33,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,175 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:12:33,175 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:12:33,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:12:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 397. [2020-02-10 20:12:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:12:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-02-10 20:12:33,185 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-02-10 20:12:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,185 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-02-10 20:12:33,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-02-10 20:12:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:33,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,186 INFO L415 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] [2020-02-10 20:12:33,186 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1202169080, now seen corresponding path program 62 times [2020-02-10 20:12:33,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359589274] [2020-02-10 20:12:33,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359589274] [2020-02-10 20:12:33,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:33,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515183547] [2020-02-10 20:12:33,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:33,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:33,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:33,489 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:12:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,596 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-02-10 20:12:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:33,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,598 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:12:33,598 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:33,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-02-10 20:12:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-02-10 20:12:33,608 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-02-10 20:12:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,609 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-02-10 20:12:33,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-02-10 20:12:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:33,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,610 INFO L415 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] [2020-02-10 20:12:33,610 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1611119408, now seen corresponding path program 63 times [2020-02-10 20:12:33,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863858038] [2020-02-10 20:12:33,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863858038] [2020-02-10 20:12:33,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:33,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820364047] [2020-02-10 20:12:33,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:33,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:33,913 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:12:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,008 INFO L93 Difference]: Finished difference Result 645 states and 1894 transitions. [2020-02-10 20:12:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:34,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,010 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:12:34,011 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:12:34,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:12:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 402. [2020-02-10 20:12:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:12:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1385 transitions. [2020-02-10 20:12:34,021 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1385 transitions. Word has length 22 [2020-02-10 20:12:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,021 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1385 transitions. [2020-02-10 20:12:34,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1385 transitions. [2020-02-10 20:12:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:34,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,022 INFO L415 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] [2020-02-10 20:12:34,022 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2034402296, now seen corresponding path program 64 times [2020-02-10 20:12:34,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570102463] [2020-02-10 20:12:34,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570102463] [2020-02-10 20:12:34,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:34,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27706180] [2020-02-10 20:12:34,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:34,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:34,420 INFO L87 Difference]: Start difference. First operand 402 states and 1385 transitions. Second operand 9 states. [2020-02-10 20:12:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,561 INFO L93 Difference]: Finished difference Result 643 states and 1884 transitions. [2020-02-10 20:12:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:34,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,563 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:12:34,564 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:12:34,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:12:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-02-10 20:12:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1368 transitions. [2020-02-10 20:12:34,583 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1368 transitions. Word has length 22 [2020-02-10 20:12:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,583 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1368 transitions. [2020-02-10 20:12:34,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1368 transitions. [2020-02-10 20:12:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:34,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,585 INFO L415 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] [2020-02-10 20:12:34,585 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,585 INFO L82 PathProgramCache]: Analyzing trace with hash 664313502, now seen corresponding path program 65 times [2020-02-10 20:12:34,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7085807] [2020-02-10 20:12:34,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7085807] [2020-02-10 20:12:34,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:34,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824191778] [2020-02-10 20:12:34,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:34,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:34,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:34,849 INFO L87 Difference]: Start difference. First operand 394 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:12:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,946 INFO L93 Difference]: Finished difference Result 627 states and 1853 transitions. [2020-02-10 20:12:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:34,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,948 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:12:34,948 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:34,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 396. [2020-02-10 20:12:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:12:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-02-10 20:12:34,958 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-02-10 20:12:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,959 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-02-10 20:12:34,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-02-10 20:12:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:34,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,960 INFO L415 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] [2020-02-10 20:12:34,960 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash -253636688, now seen corresponding path program 66 times [2020-02-10 20:12:34,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050681000] [2020-02-10 20:12:34,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050681000] [2020-02-10 20:12:35,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:35,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783106809] [2020-02-10 20:12:35,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:35,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:35,327 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:12:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,481 INFO L93 Difference]: Finished difference Result 631 states and 1859 transitions. [2020-02-10 20:12:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:35,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,484 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:12:35,484 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:12:35,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:12:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-02-10 20:12:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-02-10 20:12:35,501 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-02-10 20:12:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,502 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-02-10 20:12:35,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-02-10 20:12:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:35,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,503 INFO L415 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] [2020-02-10 20:12:35,503 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -118757500, now seen corresponding path program 67 times [2020-02-10 20:12:35,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621582670] [2020-02-10 20:12:35,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621582670] [2020-02-10 20:12:35,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:35,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199629888] [2020-02-10 20:12:35,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:35,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:35,826 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:12:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,929 INFO L93 Difference]: Finished difference Result 612 states and 1824 transitions. [2020-02-10 20:12:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:35,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,931 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:12:35,931 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:12:35,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:12:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 394. [2020-02-10 20:12:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 20:12:35,942 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 20:12:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,942 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 20:12:35,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 20:12:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:35,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,943 INFO L415 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] [2020-02-10 20:12:35,943 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1223175288, now seen corresponding path program 68 times [2020-02-10 20:12:35,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653334886] [2020-02-10 20:12:35,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653334886] [2020-02-10 20:12:36,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:36,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398919635] [2020-02-10 20:12:36,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:36,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:36,258 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:12:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,368 INFO L93 Difference]: Finished difference Result 611 states and 1820 transitions. [2020-02-10 20:12:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:36,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,370 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:12:36,370 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:12:36,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:12:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2020-02-10 20:12:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 20:12:36,380 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 20:12:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,381 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 20:12:36,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 20:12:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:36,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,382 INFO L415 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] [2020-02-10 20:12:36,382 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1489557682, now seen corresponding path program 69 times [2020-02-10 20:12:36,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639062996] [2020-02-10 20:12:36,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639062996] [2020-02-10 20:12:36,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:36,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15901489] [2020-02-10 20:12:36,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:36,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:36,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:36,687 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:12:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,793 INFO L93 Difference]: Finished difference Result 617 states and 1833 transitions. [2020-02-10 20:12:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:36,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,795 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:12:36,795 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:12:36,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:12:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-02-10 20:12:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-02-10 20:12:36,805 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-02-10 20:12:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,805 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-02-10 20:12:36,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-02-10 20:12:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:36,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,806 INFO L415 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] [2020-02-10 20:12:36,806 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1938849630, now seen corresponding path program 70 times [2020-02-10 20:12:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534454374] [2020-02-10 20:12:36,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534454374] [2020-02-10 20:12:37,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:37,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226387420] [2020-02-10 20:12:37,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:37,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,110 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:12:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,218 INFO L93 Difference]: Finished difference Result 620 states and 1836 transitions. [2020-02-10 20:12:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:37,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,220 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:12:37,221 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:12:37,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:12:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 392. [2020-02-10 20:12:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 20:12:37,230 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 20:12:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,230 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 20:12:37,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 20:12:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:37,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,231 INFO L415 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] [2020-02-10 20:12:37,232 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1758405090, now seen corresponding path program 71 times [2020-02-10 20:12:37,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932665430] [2020-02-10 20:12:37,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932665430] [2020-02-10 20:12:37,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:37,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014366698] [2020-02-10 20:12:37,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:37,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,534 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:12:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,636 INFO L93 Difference]: Finished difference Result 614 states and 1824 transitions. [2020-02-10 20:12:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:37,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,638 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:12:37,638 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:12:37,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:12:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 394. [2020-02-10 20:12:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1365 transitions. [2020-02-10 20:12:37,649 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1365 transitions. Word has length 22 [2020-02-10 20:12:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,650 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1365 transitions. [2020-02-10 20:12:37,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1365 transitions. [2020-02-10 20:12:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:37,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,651 INFO L415 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] [2020-02-10 20:12:37,651 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash 840454900, now seen corresponding path program 72 times [2020-02-10 20:12:37,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188835432] [2020-02-10 20:12:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188835432] [2020-02-10 20:12:37,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:37,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223976587] [2020-02-10 20:12:37,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:37,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,948 INFO L87 Difference]: Start difference. First operand 394 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:12:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,065 INFO L93 Difference]: Finished difference Result 618 states and 1830 transitions. [2020-02-10 20:12:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:38,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,067 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:12:38,067 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:12:38,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:12:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-02-10 20:12:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:12:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1351 transitions. [2020-02-10 20:12:38,078 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1351 transitions. Word has length 22 [2020-02-10 20:12:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,078 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1351 transitions. [2020-02-10 20:12:38,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1351 transitions. [2020-02-10 20:12:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:38,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,079 INFO L415 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] [2020-02-10 20:12:38,079 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1531024386, now seen corresponding path program 73 times [2020-02-10 20:12:38,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860252601] [2020-02-10 20:12:38,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:38,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860252601] [2020-02-10 20:12:38,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:38,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63323739] [2020-02-10 20:12:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:38,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:38,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:38,388 INFO L87 Difference]: Start difference. First operand 386 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:12:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,479 INFO L93 Difference]: Finished difference Result 608 states and 1800 transitions. [2020-02-10 20:12:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:38,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,480 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:12:38,480 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:12:38,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:12:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 393. [2020-02-10 20:12:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 20:12:38,494 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 20:12:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,494 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 20:12:38,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 20:12:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:38,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,496 INFO L415 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] [2020-02-10 20:12:38,496 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2092092878, now seen corresponding path program 74 times [2020-02-10 20:12:38,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125491938] [2020-02-10 20:12:38,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:38,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125491938] [2020-02-10 20:12:38,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:38,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428466873] [2020-02-10 20:12:38,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:38,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:38,791 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:12:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,870 INFO L93 Difference]: Finished difference Result 601 states and 1785 transitions. [2020-02-10 20:12:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:38,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,872 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:12:38,872 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:12:38,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:12:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 391. [2020-02-10 20:12:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 20:12:38,882 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,882 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 20:12:38,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 20:12:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:38,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,883 INFO L415 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] [2020-02-10 20:12:38,883 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash -69413468, now seen corresponding path program 75 times [2020-02-10 20:12:38,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660436965] [2020-02-10 20:12:38,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660436965] [2020-02-10 20:12:39,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:39,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117326595] [2020-02-10 20:12:39,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:39,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:39,193 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,272 INFO L93 Difference]: Finished difference Result 610 states and 1803 transitions. [2020-02-10 20:12:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:39,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,274 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:12:39,274 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:12:39,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:12:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2020-02-10 20:12:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-02-10 20:12:39,284 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-02-10 20:12:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,284 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-02-10 20:12:39,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-02-10 20:12:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:39,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,285 INFO L415 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] [2020-02-10 20:12:39,285 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1031617130, now seen corresponding path program 76 times [2020-02-10 20:12:39,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377352841] [2020-02-10 20:12:39,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377352841] [2020-02-10 20:12:39,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:39,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815339420] [2020-02-10 20:12:39,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:39,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:39,607 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:12:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,723 INFO L93 Difference]: Finished difference Result 604 states and 1789 transitions. [2020-02-10 20:12:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:39,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,725 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:12:39,725 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:12:39,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:12:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 391. [2020-02-10 20:12:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 20:12:39,735 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 20:12:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,735 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 20:12:39,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 20:12:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:39,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,736 INFO L415 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] [2020-02-10 20:12:39,736 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,736 INFO L82 PathProgramCache]: Analyzing trace with hash -14691242, now seen corresponding path program 77 times [2020-02-10 20:12:39,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097006745] [2020-02-10 20:12:39,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097006745] [2020-02-10 20:12:40,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:40,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802085435] [2020-02-10 20:12:40,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:40,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,056 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:12:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,157 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2020-02-10 20:12:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:40,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,159 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:12:40,159 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:12:40,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:12:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 392. [2020-02-10 20:12:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-02-10 20:12:40,169 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-02-10 20:12:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,169 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-02-10 20:12:40,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-02-10 20:12:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:40,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,170 INFO L415 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] [2020-02-10 20:12:40,170 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1596249716, now seen corresponding path program 78 times [2020-02-10 20:12:40,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947808354] [2020-02-10 20:12:40,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947808354] [2020-02-10 20:12:40,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:40,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732009760] [2020-02-10 20:12:40,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:40,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:40,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,478 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:12:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,583 INFO L93 Difference]: Finished difference Result 595 states and 1771 transitions. [2020-02-10 20:12:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:40,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,585 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:12:40,585 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:12:40,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:12:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 389. [2020-02-10 20:12:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 20:12:40,597 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 20:12:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,597 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 20:12:40,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 20:12:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:40,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,599 INFO L415 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] [2020-02-10 20:12:40,599 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash 933687728, now seen corresponding path program 79 times [2020-02-10 20:12:40,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142112654] [2020-02-10 20:12:40,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142112654] [2020-02-10 20:12:40,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:40,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213590475] [2020-02-10 20:12:40,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:40,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,986 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:12:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,064 INFO L93 Difference]: Finished difference Result 618 states and 1821 transitions. [2020-02-10 20:12:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:41,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,065 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:12:41,066 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:12:41,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:12:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 394. [2020-02-10 20:12:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:12:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-02-10 20:12:41,076 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-02-10 20:12:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,077 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-02-10 20:12:41,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-02-10 20:12:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:41,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,078 INFO L415 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] [2020-02-10 20:12:41,078 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1494756220, now seen corresponding path program 80 times [2020-02-10 20:12:41,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199218873] [2020-02-10 20:12:41,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199218873] [2020-02-10 20:12:41,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:41,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082031520] [2020-02-10 20:12:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:41,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:41,354 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:12:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,431 INFO L93 Difference]: Finished difference Result 611 states and 1806 transitions. [2020-02-10 20:12:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:41,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,433 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:12:41,433 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:12:41,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:12:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 392. [2020-02-10 20:12:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1366 transitions. [2020-02-10 20:12:41,443 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,443 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1366 transitions. [2020-02-10 20:12:41,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1366 transitions. [2020-02-10 20:12:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:41,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,445 INFO L415 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] [2020-02-10 20:12:41,445 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1946380260, now seen corresponding path program 81 times [2020-02-10 20:12:41,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825217215] [2020-02-10 20:12:41,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825217215] [2020-02-10 20:12:41,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:41,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573513548] [2020-02-10 20:12:41,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:41,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:41,761 INFO L87 Difference]: Start difference. First operand 392 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,841 INFO L93 Difference]: Finished difference Result 629 states and 1845 transitions. [2020-02-10 20:12:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:41,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,843 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:12:41,843 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:12:41,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:12:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 400. [2020-02-10 20:12:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:12:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1379 transitions. [2020-02-10 20:12:41,853 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1379 transitions. Word has length 22 [2020-02-10 20:12:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,853 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1379 transitions. [2020-02-10 20:12:41,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1379 transitions. [2020-02-10 20:12:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:41,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,854 INFO L415 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] [2020-02-10 20:12:41,854 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1816409814, now seen corresponding path program 82 times [2020-02-10 20:12:41,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121874548] [2020-02-10 20:12:41,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121874548] [2020-02-10 20:12:42,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:42,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655382458] [2020-02-10 20:12:42,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:42,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:42,155 INFO L87 Difference]: Start difference. First operand 400 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:12:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,257 INFO L93 Difference]: Finished difference Result 627 states and 1835 transitions. [2020-02-10 20:12:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:42,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,259 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:12:42,260 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:12:42,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:12:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 392. [2020-02-10 20:12:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1363 transitions. [2020-02-10 20:12:42,269 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,269 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1363 transitions. [2020-02-10 20:12:42,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1363 transitions. [2020-02-10 20:12:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:42,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,270 INFO L415 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] [2020-02-10 20:12:42,270 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2001102486, now seen corresponding path program 83 times [2020-02-10 20:12:42,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385431924] [2020-02-10 20:12:42,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385431924] [2020-02-10 20:12:42,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:42,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817438870] [2020-02-10 20:12:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:42,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:42,545 INFO L87 Difference]: Start difference. First operand 392 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:12:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,624 INFO L93 Difference]: Finished difference Result 608 states and 1798 transitions. [2020-02-10 20:12:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:42,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,626 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:12:42,626 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:12:42,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:12:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 393. [2020-02-10 20:12:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 20:12:42,637 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 20:12:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,637 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 20:12:42,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 20:12:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:42,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,638 INFO L415 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] [2020-02-10 20:12:42,638 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 925391330, now seen corresponding path program 84 times [2020-02-10 20:12:42,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183482812] [2020-02-10 20:12:42,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183482812] [2020-02-10 20:12:42,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:42,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816613781] [2020-02-10 20:12:42,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:42,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:42,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:42,936 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:12:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,041 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-02-10 20:12:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:43,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,043 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:12:43,043 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:12:43,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:12:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 389. [2020-02-10 20:12:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1357 transitions. [2020-02-10 20:12:43,056 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1357 transitions. Word has length 22 [2020-02-10 20:12:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,057 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1357 transitions. [2020-02-10 20:12:43,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1357 transitions. [2020-02-10 20:12:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:43,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,058 INFO L415 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] [2020-02-10 20:12:43,058 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1259283952, now seen corresponding path program 85 times [2020-02-10 20:12:43,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583108155] [2020-02-10 20:12:43,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583108155] [2020-02-10 20:12:43,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:43,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411144193] [2020-02-10 20:12:43,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:43,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:43,383 INFO L87 Difference]: Start difference. First operand 389 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:12:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,479 INFO L93 Difference]: Finished difference Result 624 states and 1835 transitions. [2020-02-10 20:12:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:43,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,481 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:12:43,481 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:12:43,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:12:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 396. [2020-02-10 20:12:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:12:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1373 transitions. [2020-02-10 20:12:43,492 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1373 transitions. Word has length 22 [2020-02-10 20:12:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,492 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1373 transitions. [2020-02-10 20:12:43,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1373 transitions. [2020-02-10 20:12:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:43,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,500 INFO L415 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] [2020-02-10 20:12:43,500 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash 297080290, now seen corresponding path program 86 times [2020-02-10 20:12:43,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570046579] [2020-02-10 20:12:43,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570046579] [2020-02-10 20:12:43,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:43,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107435216] [2020-02-10 20:12:43,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:43,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:43,796 INFO L87 Difference]: Start difference. First operand 396 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:12:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,897 INFO L93 Difference]: Finished difference Result 618 states and 1821 transitions. [2020-02-10 20:12:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:43,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,899 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:12:43,899 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:12:43,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:12:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2020-02-10 20:12:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 20:12:43,909 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,909 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 20:12:43,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 20:12:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:43,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,910 INFO L415 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] [2020-02-10 20:12:43,910 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash -422552958, now seen corresponding path program 87 times [2020-02-10 20:12:43,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921535164] [2020-02-10 20:12:43,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921535164] [2020-02-10 20:12:44,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:44,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414798529] [2020-02-10 20:12:44,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:44,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:44,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:44,201 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,311 INFO L93 Difference]: Finished difference Result 633 states and 1853 transitions. [2020-02-10 20:12:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:44,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,313 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:12:44,313 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:44,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 401. [2020-02-10 20:12:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:12:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1379 transitions. [2020-02-10 20:12:44,322 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1379 transitions. Word has length 22 [2020-02-10 20:12:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,323 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1379 transitions. [2020-02-10 20:12:44,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1379 transitions. [2020-02-10 20:12:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:44,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:44,324 INFO L415 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] [2020-02-10 20:12:44,324 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash -552523404, now seen corresponding path program 88 times [2020-02-10 20:12:44,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439502010] [2020-02-10 20:12:44,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439502010] [2020-02-10 20:12:44,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:44,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062136256] [2020-02-10 20:12:44,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:44,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:44,618 INFO L87 Difference]: Start difference. First operand 401 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:12:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,742 INFO L93 Difference]: Finished difference Result 631 states and 1843 transitions. [2020-02-10 20:12:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:44,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,744 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:12:44,744 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:12:44,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:12:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-02-10 20:12:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 20:12:44,755 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 20:12:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,755 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 20:12:44,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 20:12:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:44,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:44,756 INFO L415 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] [2020-02-10 20:12:44,756 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1316914946, now seen corresponding path program 89 times [2020-02-10 20:12:44,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857564852] [2020-02-10 20:12:44,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857564852] [2020-02-10 20:12:45,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:45,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147999708] [2020-02-10 20:12:45,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:45,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:45,029 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:12:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,136 INFO L93 Difference]: Finished difference Result 615 states and 1812 transitions. [2020-02-10 20:12:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:45,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,138 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:12:45,138 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:12:45,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:12:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 395. [2020-02-10 20:12:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:12:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-02-10 20:12:45,147 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-02-10 20:12:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,147 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-02-10 20:12:45,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-02-10 20:12:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:45,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,148 INFO L415 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] [2020-02-10 20:12:45,148 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2060102160, now seen corresponding path program 90 times [2020-02-10 20:12:45,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990189439] [2020-02-10 20:12:45,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990189439] [2020-02-10 20:12:45,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:45,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322978604] [2020-02-10 20:12:45,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:45,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:45,433 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:12:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,544 INFO L93 Difference]: Finished difference Result 619 states and 1818 transitions. [2020-02-10 20:12:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:45,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,546 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:12:45,546 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:12:45,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:12:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-02-10 20:12:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 20:12:45,556 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 20:12:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,556 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 20:12:45,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 20:12:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:45,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,557 INFO L415 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] [2020-02-10 20:12:45,558 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1497826180, now seen corresponding path program 91 times [2020-02-10 20:12:45,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419788743] [2020-02-10 20:12:45,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419788743] [2020-02-10 20:12:45,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:45,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420299994] [2020-02-10 20:12:45,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:45,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:45,866 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:12:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,949 INFO L93 Difference]: Finished difference Result 589 states and 1756 transitions. [2020-02-10 20:12:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:45,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,951 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:12:45,951 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:12:45,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:12:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 391. [2020-02-10 20:12:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 20:12:45,964 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 20:12:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,964 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 20:12:45,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 20:12:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:45,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,965 INFO L415 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] [2020-02-10 20:12:45,966 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 113114778, now seen corresponding path program 92 times [2020-02-10 20:12:45,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031910483] [2020-02-10 20:12:45,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031910483] [2020-02-10 20:12:46,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:46,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940409854] [2020-02-10 20:12:46,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:46,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:46,286 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:12:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,394 INFO L93 Difference]: Finished difference Result 590 states and 1757 transitions. [2020-02-10 20:12:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:46,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,396 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:12:46,396 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:12:46,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:12:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 390. [2020-02-10 20:12:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1356 transitions. [2020-02-10 20:12:46,407 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1356 transitions. Word has length 22 [2020-02-10 20:12:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,407 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1356 transitions. [2020-02-10 20:12:46,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1356 transitions. [2020-02-10 20:12:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:46,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,408 INFO L415 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] [2020-02-10 20:12:46,408 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1115304206, now seen corresponding path program 93 times [2020-02-10 20:12:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920416800] [2020-02-10 20:12:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920416800] [2020-02-10 20:12:46,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:46,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50028791] [2020-02-10 20:12:46,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:46,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:46,706 INFO L87 Difference]: Start difference. First operand 390 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:12:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,788 INFO L93 Difference]: Finished difference Result 593 states and 1763 transitions. [2020-02-10 20:12:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:46,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,790 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:12:46,790 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:12:46,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:12:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 391. [2020-02-10 20:12:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1357 transitions. [2020-02-10 20:12:46,800 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1357 transitions. Word has length 22 [2020-02-10 20:12:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,800 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1357 transitions. [2020-02-10 20:12:46,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1357 transitions. [2020-02-10 20:12:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:46,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,801 INFO L415 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] [2020-02-10 20:12:46,801 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 39593050, now seen corresponding path program 94 times [2020-02-10 20:12:46,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006245850] [2020-02-10 20:12:46,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006245850] [2020-02-10 20:12:47,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:47,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146701507] [2020-02-10 20:12:47,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:47,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:47,072 INFO L87 Difference]: Start difference. First operand 391 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:12:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,188 INFO L93 Difference]: Finished difference Result 598 states and 1772 transitions. [2020-02-10 20:12:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:47,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,190 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:12:47,190 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:12:47,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:12:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 390. [2020-02-10 20:12:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 20:12:47,200 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 20:12:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,200 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 20:12:47,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 20:12:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:47,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,201 INFO L415 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] [2020-02-10 20:12:47,201 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1125807310, now seen corresponding path program 95 times [2020-02-10 20:12:47,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766938459] [2020-02-10 20:12:47,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766938459] [2020-02-10 20:12:47,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:47,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8955679] [2020-02-10 20:12:47,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:47,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:47,509 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:12:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,631 INFO L93 Difference]: Finished difference Result 596 states and 1769 transitions. [2020-02-10 20:12:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:47,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,633 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:12:47,633 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:12:47,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:12:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2020-02-10 20:12:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1358 transitions. [2020-02-10 20:12:47,644 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1358 transitions. Word has length 22 [2020-02-10 20:12:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,644 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1358 transitions. [2020-02-10 20:12:47,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1358 transitions. [2020-02-10 20:12:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:47,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,645 INFO L415 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] [2020-02-10 20:12:47,645 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1560844804, now seen corresponding path program 96 times [2020-02-10 20:12:47,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134582948] [2020-02-10 20:12:47,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134582948] [2020-02-10 20:12:47,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:47,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178269739] [2020-02-10 20:12:47,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:47,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:47,915 INFO L87 Difference]: Start difference. First operand 392 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:12:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,021 INFO L93 Difference]: Finished difference Result 600 states and 1775 transitions. [2020-02-10 20:12:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:48,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,023 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:12:48,023 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:12:48,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:12:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-02-10 20:12:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:12:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1348 transitions. [2020-02-10 20:12:48,033 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1348 transitions. Word has length 22 [2020-02-10 20:12:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,033 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1348 transitions. [2020-02-10 20:12:48,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1348 transitions. [2020-02-10 20:12:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:48,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,034 INFO L415 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] [2020-02-10 20:12:48,034 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash -951136412, now seen corresponding path program 97 times [2020-02-10 20:12:48,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48955627] [2020-02-10 20:12:48,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48955627] [2020-02-10 20:12:48,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:48,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703956163] [2020-02-10 20:12:48,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:48,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:48,334 INFO L87 Difference]: Start difference. First operand 386 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:12:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,446 INFO L93 Difference]: Finished difference Result 570 states and 1716 transitions. [2020-02-10 20:12:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:48,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,448 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:12:48,448 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:12:48,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:12:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 389. [2020-02-10 20:12:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:12:48,459 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:12:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,459 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:12:48,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:12:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:48,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,460 INFO L415 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] [2020-02-10 20:12:48,460 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1898313874, now seen corresponding path program 98 times [2020-02-10 20:12:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106458534] [2020-02-10 20:12:48,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106458534] [2020-02-10 20:12:48,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:48,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43713439] [2020-02-10 20:12:48,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:48,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:48,766 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:12:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,857 INFO L93 Difference]: Finished difference Result 568 states and 1711 transitions. [2020-02-10 20:12:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:48,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,858 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:12:48,858 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:12:48,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:12:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2020-02-10 20:12:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1354 transitions. [2020-02-10 20:12:48,867 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1354 transitions. Word has length 22 [2020-02-10 20:12:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,867 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1354 transitions. [2020-02-10 20:12:48,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1354 transitions. [2020-02-10 20:12:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:48,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,869 INFO L415 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] [2020-02-10 20:12:48,869 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1743393030, now seen corresponding path program 99 times [2020-02-10 20:12:48,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555119049] [2020-02-10 20:12:48,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555119049] [2020-02-10 20:12:49,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:49,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126205739] [2020-02-10 20:12:49,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:49,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:49,199 INFO L87 Difference]: Start difference. First operand 388 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:12:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,324 INFO L93 Difference]: Finished difference Result 572 states and 1720 transitions. [2020-02-10 20:12:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:49,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,327 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:12:49,327 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:12:49,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:12:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 390. [2020-02-10 20:12:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 20:12:49,341 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 20:12:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,341 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 20:12:49,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 20:12:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:49,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,342 INFO L415 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] [2020-02-10 20:12:49,343 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1996485782, now seen corresponding path program 100 times [2020-02-10 20:12:49,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005170578] [2020-02-10 20:12:49,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005170578] [2020-02-10 20:12:49,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:49,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683253104] [2020-02-10 20:12:49,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:49,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:49,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:49,639 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:12:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,762 INFO L93 Difference]: Finished difference Result 571 states and 1716 transitions. [2020-02-10 20:12:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:49,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,764 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:12:49,764 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:12:49,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:12:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-02-10 20:12:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-02-10 20:12:49,778 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-02-10 20:12:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,778 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-02-10 20:12:49,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-02-10 20:12:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:49,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,779 INFO L415 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] [2020-02-10 20:12:49,779 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1302561834, now seen corresponding path program 101 times [2020-02-10 20:12:49,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968357010] [2020-02-10 20:12:49,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968357010] [2020-02-10 20:12:50,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:50,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159984823] [2020-02-10 20:12:50,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:50,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:50,103 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:12:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,190 INFO L93 Difference]: Finished difference Result 567 states and 1708 transitions. [2020-02-10 20:12:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:50,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,192 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:12:50,192 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:12:50,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:12:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 389. [2020-02-10 20:12:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 20:12:50,201 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 20:12:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,202 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 20:12:50,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 20:12:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:50,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,202 INFO L415 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] [2020-02-10 20:12:50,202 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 308379124, now seen corresponding path program 102 times [2020-02-10 20:12:50,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233049542] [2020-02-10 20:12:50,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233049542] [2020-02-10 20:12:50,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:50,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846129642] [2020-02-10 20:12:50,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:50,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:50,515 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:12:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,619 INFO L93 Difference]: Finished difference Result 568 states and 1709 transitions. [2020-02-10 20:12:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:50,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,621 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:12:50,621 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:12:50,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:12:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 387. [2020-02-10 20:12:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:12:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1351 transitions. [2020-02-10 20:12:50,631 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1351 transitions. Word has length 22 [2020-02-10 20:12:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,631 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1351 transitions. [2020-02-10 20:12:50,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1351 transitions. [2020-02-10 20:12:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:50,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,632 INFO L415 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] [2020-02-10 20:12:50,632 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1548473070, now seen corresponding path program 103 times [2020-02-10 20:12:50,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934511474] [2020-02-10 20:12:50,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934511474] [2020-02-10 20:12:50,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:50,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130995100] [2020-02-10 20:12:50,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:50,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:50,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:50,919 INFO L87 Difference]: Start difference. First operand 387 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:12:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,028 INFO L93 Difference]: Finished difference Result 575 states and 1726 transitions. [2020-02-10 20:12:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:51,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,030 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:12:51,030 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:12:51,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:12:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 389. [2020-02-10 20:12:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1355 transitions. [2020-02-10 20:12:51,040 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1355 transitions. Word has length 22 [2020-02-10 20:12:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,040 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1355 transitions. [2020-02-10 20:12:51,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1355 transitions. [2020-02-10 20:12:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:51,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,041 INFO L415 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] [2020-02-10 20:12:51,041 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1300977216, now seen corresponding path program 104 times [2020-02-10 20:12:51,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677590778] [2020-02-10 20:12:51,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677590778] [2020-02-10 20:12:51,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:51,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857859104] [2020-02-10 20:12:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:51,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:51,333 INFO L87 Difference]: Start difference. First operand 389 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:12:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,416 INFO L93 Difference]: Finished difference Result 573 states and 1721 transitions. [2020-02-10 20:12:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:51,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,418 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:12:51,418 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:12:51,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:12:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 388. [2020-02-10 20:12:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-02-10 20:12:51,428 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-02-10 20:12:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,428 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-02-10 20:12:51,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-02-10 20:12:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:51,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,429 INFO L415 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] [2020-02-10 20:12:51,429 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -535780538, now seen corresponding path program 105 times [2020-02-10 20:12:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210936204] [2020-02-10 20:12:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210936204] [2020-02-10 20:12:51,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:51,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368545524] [2020-02-10 20:12:51,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:51,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:51,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:51,735 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:12:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,839 INFO L93 Difference]: Finished difference Result 582 states and 1741 transitions. [2020-02-10 20:12:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:51,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,841 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:12:51,841 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:12:51,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:12:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 391. [2020-02-10 20:12:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 20:12:51,850 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 20:12:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,850 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 20:12:51,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 20:12:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:51,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,851 INFO L415 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] [2020-02-10 20:12:51,851 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash 850254592, now seen corresponding path program 106 times [2020-02-10 20:12:51,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173319720] [2020-02-10 20:12:51,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173319720] [2020-02-10 20:12:52,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:52,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390377841] [2020-02-10 20:12:52,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:52,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:52,130 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:12:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,237 INFO L93 Difference]: Finished difference Result 585 states and 1744 transitions. [2020-02-10 20:12:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:52,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,239 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:12:52,239 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:12:52,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:12:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 388. [2020-02-10 20:12:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 20:12:52,249 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 20:12:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,249 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 20:12:52,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 20:12:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:52,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,250 INFO L415 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] [2020-02-10 20:12:52,250 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash 713231894, now seen corresponding path program 107 times [2020-02-10 20:12:52,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036750583] [2020-02-10 20:12:52,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036750583] [2020-02-10 20:12:52,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:52,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443639914] [2020-02-10 20:12:52,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:52,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:52,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:52,548 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:12:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,627 INFO L93 Difference]: Finished difference Result 576 states and 1726 transitions. [2020-02-10 20:12:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:52,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,629 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:12:52,629 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:12:52,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:12:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 389. [2020-02-10 20:12:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 20:12:52,639 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 20:12:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,639 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 20:12:52,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 20:12:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:52,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,640 INFO L415 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] [2020-02-10 20:12:52,640 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -362479262, now seen corresponding path program 108 times [2020-02-10 20:12:52,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798115108] [2020-02-10 20:12:52,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798115108] [2020-02-10 20:12:52,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:52,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082566242] [2020-02-10 20:12:52,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:52,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:52,908 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:12:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,010 INFO L93 Difference]: Finished difference Result 581 states and 1735 transitions. [2020-02-10 20:12:53,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:53,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,012 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:12:53,012 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:12:53,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:12:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-02-10 20:12:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:12:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-02-10 20:12:53,023 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-02-10 20:12:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,023 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-02-10 20:12:53,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-02-10 20:12:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:53,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,024 INFO L415 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] [2020-02-10 20:12:53,025 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1222876846, now seen corresponding path program 109 times [2020-02-10 20:12:53,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616867020] [2020-02-10 20:12:53,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616867020] [2020-02-10 20:12:53,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:53,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945997366] [2020-02-10 20:12:53,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:53,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:53,318 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:12:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,439 INFO L93 Difference]: Finished difference Result 581 states and 1742 transitions. [2020-02-10 20:12:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:53,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,440 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:12:53,440 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:12:53,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:12:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 391. [2020-02-10 20:12:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 20:12:53,451 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 20:12:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,451 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 20:12:53,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 20:12:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:53,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,452 INFO L415 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] [2020-02-10 20:12:53,452 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash -969784094, now seen corresponding path program 110 times [2020-02-10 20:12:53,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129626643] [2020-02-10 20:12:53,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129626643] [2020-02-10 20:12:53,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:53,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050177459] [2020-02-10 20:12:53,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:53,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:53,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:53,739 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:12:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,842 INFO L93 Difference]: Finished difference Result 580 states and 1738 transitions. [2020-02-10 20:12:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:53,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,844 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:12:53,844 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:12:53,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:12:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-02-10 20:12:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1355 transitions. [2020-02-10 20:12:53,853 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1355 transitions. Word has length 22 [2020-02-10 20:12:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,853 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1355 transitions. [2020-02-10 20:12:53,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1355 transitions. [2020-02-10 20:12:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:53,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,854 INFO L415 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] [2020-02-10 20:12:53,854 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1390253540, now seen corresponding path program 111 times [2020-02-10 20:12:53,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977478832] [2020-02-10 20:12:53,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977478832] [2020-02-10 20:12:54,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:54,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598025638] [2020-02-10 20:12:54,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:54,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:54,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:54,135 INFO L87 Difference]: Start difference. First operand 389 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:12:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,241 INFO L93 Difference]: Finished difference Result 586 states and 1751 transitions. [2020-02-10 20:12:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:54,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,243 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:12:54,243 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:12:54,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:12:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 392. [2020-02-10 20:12:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:12:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1360 transitions. [2020-02-10 20:12:54,252 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1360 transitions. Word has length 22 [2020-02-10 20:12:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,252 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1360 transitions. [2020-02-10 20:12:54,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1360 transitions. [2020-02-10 20:12:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:54,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,253 INFO L415 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] [2020-02-10 20:12:54,253 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1518678626, now seen corresponding path program 112 times [2020-02-10 20:12:54,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225613153] [2020-02-10 20:12:54,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225613153] [2020-02-10 20:12:54,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:54,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610673000] [2020-02-10 20:12:54,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:54,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:54,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:54,541 INFO L87 Difference]: Start difference. First operand 392 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:12:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,647 INFO L93 Difference]: Finished difference Result 589 states and 1754 transitions. [2020-02-10 20:12:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:54,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,649 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:12:54,649 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:12:54,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:12:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-02-10 20:12:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 20:12:54,660 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 20:12:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,660 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 20:12:54,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 20:12:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:54,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,661 INFO L415 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] [2020-02-10 20:12:54,661 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1510693950, now seen corresponding path program 113 times [2020-02-10 20:12:54,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143606418] [2020-02-10 20:12:54,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143606418] [2020-02-10 20:12:54,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:54,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422825966] [2020-02-10 20:12:54,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:54,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:54,935 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:12:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,038 INFO L93 Difference]: Finished difference Result 583 states and 1742 transitions. [2020-02-10 20:12:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:55,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,040 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:12:55,040 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:12:55,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:12:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 391. [2020-02-10 20:12:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 20:12:55,050 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 20:12:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,050 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 20:12:55,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 20:12:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:55,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,051 INFO L415 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] [2020-02-10 20:12:55,051 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1866323156, now seen corresponding path program 114 times [2020-02-10 20:12:55,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407830313] [2020-02-10 20:12:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:55,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407830313] [2020-02-10 20:12:55,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:55,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306536924] [2020-02-10 20:12:55,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:55,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:55,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:55,320 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:12:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,431 INFO L93 Difference]: Finished difference Result 587 states and 1748 transitions. [2020-02-10 20:12:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:55,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,433 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:12:55,433 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:12:55,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:12:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-02-10 20:12:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:12:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-02-10 20:12:55,443 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-02-10 20:12:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,443 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-02-10 20:12:55,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-02-10 20:12:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:55,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,444 INFO L415 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] [2020-02-10 20:12:55,444 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1952169664, now seen corresponding path program 115 times [2020-02-10 20:12:55,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49502750] [2020-02-10 20:12:55,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:55,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49502750] [2020-02-10 20:12:55,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:55,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33596737] [2020-02-10 20:12:55,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:55,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:55,741 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:12:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,817 INFO L93 Difference]: Finished difference Result 570 states and 1713 transitions. [2020-02-10 20:12:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:55,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:55,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,819 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:12:55,819 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:12:55,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:12:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 389. [2020-02-10 20:12:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 20:12:55,828 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 20:12:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,829 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 20:12:55,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 20:12:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:55,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,829 INFO L415 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] [2020-02-10 20:12:55,830 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash -731856674, now seen corresponding path program 116 times [2020-02-10 20:12:55,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454247819] [2020-02-10 20:12:55,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454247819] [2020-02-10 20:12:56,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:56,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880934131] [2020-02-10 20:12:56,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:56,129 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:12:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,231 INFO L93 Difference]: Finished difference Result 571 states and 1714 transitions. [2020-02-10 20:12:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:56,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,233 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:12:56,233 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:12:56,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:12:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 388. [2020-02-10 20:12:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-02-10 20:12:56,242 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-02-10 20:12:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,242 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-02-10 20:12:56,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-02-10 20:12:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:56,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,243 INFO L415 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] [2020-02-10 20:12:56,243 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash 270332754, now seen corresponding path program 117 times [2020-02-10 20:12:56,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984883370] [2020-02-10 20:12:56,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984883370] [2020-02-10 20:12:56,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:56,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352215564] [2020-02-10 20:12:56,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:56,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:56,515 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:12:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,594 INFO L93 Difference]: Finished difference Result 574 states and 1720 transitions. [2020-02-10 20:12:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:56,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,595 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:12:56,596 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:12:56,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:12:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 389. [2020-02-10 20:12:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-02-10 20:12:56,604 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-02-10 20:12:56,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,605 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-02-10 20:12:56,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-02-10 20:12:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:56,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,605 INFO L415 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] [2020-02-10 20:12:56,606 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash -805378402, now seen corresponding path program 118 times [2020-02-10 20:12:56,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563941346] [2020-02-10 20:12:56,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563941346] [2020-02-10 20:12:56,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:56,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979593251] [2020-02-10 20:12:56,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:56,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:56,877 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:12:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,994 INFO L93 Difference]: Finished difference Result 579 states and 1729 transitions. [2020-02-10 20:12:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:56,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,996 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:12:56,996 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:12:56,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:12:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-02-10 20:12:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:12:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-02-10 20:12:57,009 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-02-10 20:12:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,010 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-02-10 20:12:57,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-02-10 20:12:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:57,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,011 INFO L415 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] [2020-02-10 20:12:57,012 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash 280835858, now seen corresponding path program 119 times [2020-02-10 20:12:57,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470353396] [2020-02-10 20:12:57,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470353396] [2020-02-10 20:12:57,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:57,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453390447] [2020-02-10 20:12:57,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:57,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:57,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:57,339 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:12:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,457 INFO L93 Difference]: Finished difference Result 577 states and 1726 transitions. [2020-02-10 20:12:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:57,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,459 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:12:57,459 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:12:57,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:12:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 390. [2020-02-10 20:12:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1353 transitions. [2020-02-10 20:12:57,469 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1353 transitions. Word has length 22 [2020-02-10 20:12:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,469 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1353 transitions. [2020-02-10 20:12:57,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1353 transitions. [2020-02-10 20:12:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:57,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,470 INFO L415 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] [2020-02-10 20:12:57,470 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1889151040, now seen corresponding path program 120 times [2020-02-10 20:12:57,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166629742] [2020-02-10 20:12:57,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166629742] [2020-02-10 20:12:57,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:57,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051991405] [2020-02-10 20:12:57,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:57,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:57,773 INFO L87 Difference]: Start difference. First operand 390 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:12:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,878 INFO L93 Difference]: Finished difference Result 581 states and 1732 transitions. [2020-02-10 20:12:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:57,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,880 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:12:57,881 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:12:57,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:12:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-02-10 20:12:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:12:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1342 transitions. [2020-02-10 20:12:57,890 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1342 transitions. Word has length 22 [2020-02-10 20:12:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,890 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1342 transitions. [2020-02-10 20:12:57,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1342 transitions. [2020-02-10 20:12:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:57,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,891 INFO L415 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] [2020-02-10 20:12:57,891 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash -317402012, now seen corresponding path program 121 times [2020-02-10 20:12:57,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866353010] [2020-02-10 20:12:57,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866353010] [2020-02-10 20:12:58,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:58,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059671055] [2020-02-10 20:12:58,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:58,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:58,158 INFO L87 Difference]: Start difference. First operand 383 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:12:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,240 INFO L93 Difference]: Finished difference Result 594 states and 1772 transitions. [2020-02-10 20:12:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:58,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,242 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:12:58,242 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:12:58,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:12:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 393. [2020-02-10 20:12:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:12:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1372 transitions. [2020-02-10 20:12:58,252 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1372 transitions. Word has length 22 [2020-02-10 20:12:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,252 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1372 transitions. [2020-02-10 20:12:58,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1372 transitions. [2020-02-10 20:12:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:58,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,253 INFO L415 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] [2020-02-10 20:12:58,253 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1272863874, now seen corresponding path program 122 times [2020-02-10 20:12:58,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443817425] [2020-02-10 20:12:58,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443817425] [2020-02-10 20:12:58,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:58,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443167510] [2020-02-10 20:12:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:58,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:58,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:58,532 INFO L87 Difference]: Start difference. First operand 393 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:12:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,644 INFO L93 Difference]: Finished difference Result 589 states and 1759 transitions. [2020-02-10 20:12:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:58,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,647 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:12:58,647 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:12:58,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:12:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 389. [2020-02-10 20:12:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1364 transitions. [2020-02-10 20:12:58,659 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1364 transitions. Word has length 22 [2020-02-10 20:12:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,659 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1364 transitions. [2020-02-10 20:12:58,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1364 transitions. [2020-02-10 20:12:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:58,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,661 INFO L415 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] [2020-02-10 20:12:58,661 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1035148308, now seen corresponding path program 123 times [2020-02-10 20:12:58,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392672982] [2020-02-10 20:12:58,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392672982] [2020-02-10 20:12:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:58,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936012989] [2020-02-10 20:12:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:58,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:58,940 INFO L87 Difference]: Start difference. First operand 389 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:12:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,024 INFO L93 Difference]: Finished difference Result 590 states and 1760 transitions. [2020-02-10 20:12:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:59,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,027 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:12:59,027 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:12:59,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:12:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 391. [2020-02-10 20:12:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:12:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 20:12:59,037 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 20:12:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,037 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 20:12:59,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 20:12:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:59,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,038 INFO L415 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] [2020-02-10 20:12:59,038 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1596216800, now seen corresponding path program 124 times [2020-02-10 20:12:59,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847599670] [2020-02-10 20:12:59,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847599670] [2020-02-10 20:12:59,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:59,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484600740] [2020-02-10 20:12:59,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:59,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:59,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:59,316 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:12:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,407 INFO L93 Difference]: Finished difference Result 583 states and 1745 transitions. [2020-02-10 20:12:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:59,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,409 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:12:59,409 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:12:59,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:12:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-02-10 20:12:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:12:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-02-10 20:12:59,420 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-02-10 20:12:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,420 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-02-10 20:12:59,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-02-10 20:12:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:59,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,421 INFO L415 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] [2020-02-10 20:12:59,421 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash -159141898, now seen corresponding path program 125 times [2020-02-10 20:12:59,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307393035] [2020-02-10 20:12:59,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307393035] [2020-02-10 20:12:59,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:12:59,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785659506] [2020-02-10 20:12:59,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:12:59,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:12:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:59,714 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:12:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,820 INFO L93 Difference]: Finished difference Result 579 states and 1738 transitions. [2020-02-10 20:12:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:12:59,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:12:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,823 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:12:59,823 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:12:59,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:12:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-02-10 20:12:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:12:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 20:12:59,834 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 20:12:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,834 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 20:12:59,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:12:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 20:12:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:12:59,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,835 INFO L415 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] [2020-02-10 20:12:59,835 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1604658908, now seen corresponding path program 126 times [2020-02-10 20:12:59,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174869154] [2020-02-10 20:12:59,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174869154] [2020-02-10 20:13:00,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:00,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140970300] [2020-02-10 20:13:00,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:00,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:00,160 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:13:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,258 INFO L93 Difference]: Finished difference Result 577 states and 1733 transitions. [2020-02-10 20:13:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:00,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,260 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:13:00,260 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:13:00,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:13:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-02-10 20:13:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1358 transitions. [2020-02-10 20:13:00,270 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,270 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1358 transitions. [2020-02-10 20:13:00,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1358 transitions. [2020-02-10 20:13:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:00,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,271 INFO L415 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] [2020-02-10 20:13:00,271 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash -739887738, now seen corresponding path program 127 times [2020-02-10 20:13:00,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789474456] [2020-02-10 20:13:00,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789474456] [2020-02-10 20:13:00,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:00,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806035756] [2020-02-10 20:13:00,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:00,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:00,542 INFO L87 Difference]: Start difference. First operand 387 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,627 INFO L93 Difference]: Finished difference Result 598 states and 1782 transitions. [2020-02-10 20:13:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:00,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,629 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:13:00,630 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:13:00,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:13:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 394. [2020-02-10 20:13:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1374 transitions. [2020-02-10 20:13:00,639 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1374 transitions. Word has length 22 [2020-02-10 20:13:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,639 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1374 transitions. [2020-02-10 20:13:00,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1374 transitions. [2020-02-10 20:13:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:00,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,640 INFO L415 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] [2020-02-10 20:13:00,640 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 850378148, now seen corresponding path program 128 times [2020-02-10 20:13:00,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618847794] [2020-02-10 20:13:00,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618847794] [2020-02-10 20:13:00,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:00,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657399939] [2020-02-10 20:13:00,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:00,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:00,911 INFO L87 Difference]: Start difference. First operand 394 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:13:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,023 INFO L93 Difference]: Finished difference Result 593 states and 1769 transitions. [2020-02-10 20:13:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:01,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,025 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:13:01,025 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:13:01,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:13:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-02-10 20:13:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-02-10 20:13:01,035 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-02-10 20:13:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,036 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-02-10 20:13:01,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-02-10 20:13:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:01,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,037 INFO L415 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] [2020-02-10 20:13:01,037 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash -638975566, now seen corresponding path program 129 times [2020-02-10 20:13:01,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291873580] [2020-02-10 20:13:01,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291873580] [2020-02-10 20:13:01,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:01,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399530769] [2020-02-10 20:13:01,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:01,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:01,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:01,330 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:13:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,443 INFO L93 Difference]: Finished difference Result 596 states and 1774 transitions. [2020-02-10 20:13:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:01,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,445 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:13:01,445 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:13:01,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:13:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2020-02-10 20:13:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1369 transitions. [2020-02-10 20:13:01,455 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1369 transitions. Word has length 22 [2020-02-10 20:13:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,455 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1369 transitions. [2020-02-10 20:13:01,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1369 transitions. [2020-02-10 20:13:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:01,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,456 INFO L415 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] [2020-02-10 20:13:01,456 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash -512339192, now seen corresponding path program 130 times [2020-02-10 20:13:01,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344702293] [2020-02-10 20:13:01,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344702293] [2020-02-10 20:13:01,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:01,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324772148] [2020-02-10 20:13:01,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:01,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:01,720 INFO L87 Difference]: Start difference. First operand 393 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:13:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,839 INFO L93 Difference]: Finished difference Result 590 states and 1760 transitions. [2020-02-10 20:13:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:01,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,841 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:13:01,841 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:13:01,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:13:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2020-02-10 20:13:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1362 transitions. [2020-02-10 20:13:01,853 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,853 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1362 transitions. [2020-02-10 20:13:01,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1362 transitions. [2020-02-10 20:13:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:01,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,854 INFO L415 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] [2020-02-10 20:13:01,854 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1367609936, now seen corresponding path program 131 times [2020-02-10 20:13:01,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672675879] [2020-02-10 20:13:01,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672675879] [2020-02-10 20:13:02,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:02,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890554598] [2020-02-10 20:13:02,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:02,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:02,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:02,120 INFO L87 Difference]: Start difference. First operand 390 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,228 INFO L93 Difference]: Finished difference Result 585 states and 1751 transitions. [2020-02-10 20:13:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:02,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,229 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:13:02,229 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:13:02,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:13:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 392. [2020-02-10 20:13:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-02-10 20:13:02,239 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-02-10 20:13:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,239 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-02-10 20:13:02,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-02-10 20:13:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:02,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,240 INFO L415 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] [2020-02-10 20:13:02,240 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1585424572, now seen corresponding path program 132 times [2020-02-10 20:13:02,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319759487] [2020-02-10 20:13:02,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319759487] [2020-02-10 20:13:02,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:02,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233290895] [2020-02-10 20:13:02,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:02,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:02,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:02,517 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:13:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,656 INFO L93 Difference]: Finished difference Result 584 states and 1747 transitions. [2020-02-10 20:13:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:02,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,658 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:13:02,659 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:13:02,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:13:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-02-10 20:13:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1356 transitions. [2020-02-10 20:13:02,667 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,668 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1356 transitions. [2020-02-10 20:13:02,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1356 transitions. [2020-02-10 20:13:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:02,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,668 INFO L415 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] [2020-02-10 20:13:02,668 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1016560404, now seen corresponding path program 133 times [2020-02-10 20:13:02,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066111780] [2020-02-10 20:13:02,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066111780] [2020-02-10 20:13:02,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:02,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086404911] [2020-02-10 20:13:02,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:02,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:02,960 INFO L87 Difference]: Start difference. First operand 387 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,042 INFO L93 Difference]: Finished difference Result 588 states and 1753 transitions. [2020-02-10 20:13:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:03,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,044 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:13:03,044 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:13:03,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:13:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 391. [2020-02-10 20:13:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 20:13:03,054 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,054 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 20:13:03,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 20:13:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:03,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,055 INFO L415 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] [2020-02-10 20:13:03,055 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1577628896, now seen corresponding path program 134 times [2020-02-10 20:13:03,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107123110] [2020-02-10 20:13:03,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107123110] [2020-02-10 20:13:03,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:03,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635276229] [2020-02-10 20:13:03,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:03,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:03,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:03,354 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,446 INFO L93 Difference]: Finished difference Result 581 states and 1738 transitions. [2020-02-10 20:13:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:03,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,449 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:13:03,449 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:13:03,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:03,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:13:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 389. [2020-02-10 20:13:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 20:13:03,459 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 20:13:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,459 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 20:13:03,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 20:13:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:03,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,460 INFO L415 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] [2020-02-10 20:13:03,460 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash -583877450, now seen corresponding path program 135 times [2020-02-10 20:13:03,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619049020] [2020-02-10 20:13:03,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619049020] [2020-02-10 20:13:03,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:03,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576195858] [2020-02-10 20:13:03,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:03,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:03,739 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:13:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,831 INFO L93 Difference]: Finished difference Result 590 states and 1756 transitions. [2020-02-10 20:13:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:03,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,833 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:13:03,833 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:13:03,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:13:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 392. [2020-02-10 20:13:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 20:13:03,843 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,844 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 20:13:03,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 20:13:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:03,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,844 INFO L415 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] [2020-02-10 20:13:03,844 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1546081112, now seen corresponding path program 136 times [2020-02-10 20:13:03,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383017322] [2020-02-10 20:13:03,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:04,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383017322] [2020-02-10 20:13:04,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:04,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048256882] [2020-02-10 20:13:04,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:04,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,104 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,216 INFO L93 Difference]: Finished difference Result 584 states and 1742 transitions. [2020-02-10 20:13:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:04,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,218 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:13:04,218 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:13:04,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:13:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 389. [2020-02-10 20:13:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 20:13:04,228 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,228 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 20:13:04,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 20:13:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:04,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,229 INFO L415 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] [2020-02-10 20:13:04,229 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash -529155224, now seen corresponding path program 137 times [2020-02-10 20:13:04,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915697729] [2020-02-10 20:13:04,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915697729] [2020-02-10 20:13:04,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:04,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752512492] [2020-02-10 20:13:04,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:04,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,518 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,617 INFO L93 Difference]: Finished difference Result 574 states and 1723 transitions. [2020-02-10 20:13:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:04,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,619 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:13:04,619 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:13:04,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:13:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2020-02-10 20:13:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-02-10 20:13:04,630 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-02-10 20:13:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,631 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-02-10 20:13:04,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-02-10 20:13:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:04,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,632 INFO L415 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] [2020-02-10 20:13:04,632 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1081785734, now seen corresponding path program 138 times [2020-02-10 20:13:04,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375698999] [2020-02-10 20:13:04,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:04,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375698999] [2020-02-10 20:13:04,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:04,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732101730] [2020-02-10 20:13:04,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:04,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,922 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:13:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,039 INFO L93 Difference]: Finished difference Result 575 states and 1724 transitions. [2020-02-10 20:13:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:05,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,040 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:13:05,040 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:13:05,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:13:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 387. [2020-02-10 20:13:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-02-10 20:13:05,054 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,054 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-02-10 20:13:05,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-02-10 20:13:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:05,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,055 INFO L415 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] [2020-02-10 20:13:05,055 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash -620628942, now seen corresponding path program 139 times [2020-02-10 20:13:05,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221582765] [2020-02-10 20:13:05,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221582765] [2020-02-10 20:13:05,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:05,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434291526] [2020-02-10 20:13:05,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:05,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:05,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:05,337 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,463 INFO L93 Difference]: Finished difference Result 569 states and 1715 transitions. [2020-02-10 20:13:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:05,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,465 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:13:05,466 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:13:05,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:13:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 389. [2020-02-10 20:13:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 20:13:05,477 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,478 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 20:13:05,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 20:13:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:05,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,478 INFO L415 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] [2020-02-10 20:13:05,479 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2066145952, now seen corresponding path program 140 times [2020-02-10 20:13:05,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950869059] [2020-02-10 20:13:05,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950869059] [2020-02-10 20:13:05,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:05,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030124680] [2020-02-10 20:13:05,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:05,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:05,780 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,873 INFO L93 Difference]: Finished difference Result 567 states and 1710 transitions. [2020-02-10 20:13:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:05,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,875 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:13:05,876 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:13:05,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:13:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 388. [2020-02-10 20:13:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1356 transitions. [2020-02-10 20:13:05,884 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,885 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1356 transitions. [2020-02-10 20:13:05,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1356 transitions. [2020-02-10 20:13:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:05,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,885 INFO L415 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] [2020-02-10 20:13:05,886 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2073900500, now seen corresponding path program 141 times [2020-02-10 20:13:05,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052541634] [2020-02-10 20:13:05,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052541634] [2020-02-10 20:13:06,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:06,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613575578] [2020-02-10 20:13:06,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:06,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:06,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:06,170 INFO L87 Difference]: Start difference. First operand 388 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,284 INFO L93 Difference]: Finished difference Result 571 states and 1719 transitions. [2020-02-10 20:13:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:06,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,285 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:13:06,286 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:13:06,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:13:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-02-10 20:13:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-02-10 20:13:06,294 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-02-10 20:13:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,295 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-02-10 20:13:06,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-02-10 20:13:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:06,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,295 INFO L415 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] [2020-02-10 20:13:06,296 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1967974044, now seen corresponding path program 142 times [2020-02-10 20:13:06,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870243300] [2020-02-10 20:13:06,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870243300] [2020-02-10 20:13:06,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:06,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906972670] [2020-02-10 20:13:06,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:06,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:06,584 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:13:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,696 INFO L93 Difference]: Finished difference Result 570 states and 1715 transitions. [2020-02-10 20:13:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:06,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,698 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:13:06,698 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:13:06,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:13:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2020-02-10 20:13:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-02-10 20:13:06,711 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-02-10 20:13:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,711 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-02-10 20:13:06,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-02-10 20:13:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:06,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,712 INFO L415 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] [2020-02-10 20:13:06,713 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash -972054364, now seen corresponding path program 143 times [2020-02-10 20:13:06,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444302841] [2020-02-10 20:13:06,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444302841] [2020-02-10 20:13:07,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:07,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512609019] [2020-02-10 20:13:07,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:07,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,091 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:13:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,183 INFO L93 Difference]: Finished difference Result 566 states and 1707 transitions. [2020-02-10 20:13:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:07,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,185 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:13:07,185 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:13:07,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:13:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 389. [2020-02-10 20:13:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:13:07,196 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,196 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:13:07,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:13:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:07,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,197 INFO L415 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] [2020-02-10 20:13:07,197 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash 638886594, now seen corresponding path program 144 times [2020-02-10 20:13:07,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995105883] [2020-02-10 20:13:07,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995105883] [2020-02-10 20:13:07,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:07,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787865419] [2020-02-10 20:13:07,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:07,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:07,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,490 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,625 INFO L93 Difference]: Finished difference Result 567 states and 1708 transitions. [2020-02-10 20:13:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:07,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,627 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:13:07,627 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:13:07,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:13:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 385. [2020-02-10 20:13:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:13:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1350 transitions. [2020-02-10 20:13:07,638 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1350 transitions. Word has length 22 [2020-02-10 20:13:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,638 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1350 transitions. [2020-02-10 20:13:07,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1350 transitions. [2020-02-10 20:13:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:07,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,639 INFO L415 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] [2020-02-10 20:13:07,639 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash 743376078, now seen corresponding path program 145 times [2020-02-10 20:13:07,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078862718] [2020-02-10 20:13:07,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078862718] [2020-02-10 20:13:07,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:07,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518202430] [2020-02-10 20:13:07,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:07,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,893 INFO L87 Difference]: Start difference. First operand 385 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:13:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,981 INFO L93 Difference]: Finished difference Result 602 states and 1792 transitions. [2020-02-10 20:13:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:07,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,983 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:13:07,983 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:13:07,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:13:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 393. [2020-02-10 20:13:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 20:13:07,993 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 20:13:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,993 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 20:13:07,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 20:13:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:07,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,994 INFO L415 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] [2020-02-10 20:13:07,994 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1961325332, now seen corresponding path program 146 times [2020-02-10 20:13:07,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820723521] [2020-02-10 20:13:07,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820723521] [2020-02-10 20:13:08,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:08,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735131617] [2020-02-10 20:13:08,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:08,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:08,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:08,264 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:13:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,375 INFO L93 Difference]: Finished difference Result 597 states and 1779 transitions. [2020-02-10 20:13:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:08,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,376 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:13:08,377 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:13:08,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:13:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 389. [2020-02-10 20:13:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-02-10 20:13:08,386 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,386 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-02-10 20:13:08,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-02-10 20:13:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:08,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,387 INFO L415 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] [2020-02-10 20:13:08,387 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2095926398, now seen corresponding path program 147 times [2020-02-10 20:13:08,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456045683] [2020-02-10 20:13:08,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456045683] [2020-02-10 20:13:08,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:08,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326554984] [2020-02-10 20:13:08,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:08,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:08,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:08,743 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,874 INFO L93 Difference]: Finished difference Result 598 states and 1780 transitions. [2020-02-10 20:13:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:08,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,877 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:13:08,877 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:13:08,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:13:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 391. [2020-02-10 20:13:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 20:13:08,896 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,897 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 20:13:08,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 20:13:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:08,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,898 INFO L415 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] [2020-02-10 20:13:08,898 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1637972406, now seen corresponding path program 148 times [2020-02-10 20:13:08,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789784834] [2020-02-10 20:13:08,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789784834] [2020-02-10 20:13:09,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:09,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824172652] [2020-02-10 20:13:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:09,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:09,323 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,455 INFO L93 Difference]: Finished difference Result 591 states and 1765 transitions. [2020-02-10 20:13:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:09,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,458 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:13:09,458 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:13:09,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:13:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-02-10 20:13:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 20:13:09,478 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 20:13:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,478 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 20:13:09,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 20:13:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:09,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,480 INFO L415 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] [2020-02-10 20:13:09,481 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,481 INFO L82 PathProgramCache]: Analyzing trace with hash 901636192, now seen corresponding path program 149 times [2020-02-10 20:13:09,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411795624] [2020-02-10 20:13:09,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411795624] [2020-02-10 20:13:09,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:09,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763681801] [2020-02-10 20:13:09,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:09,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:09,884 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:13:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,037 INFO L93 Difference]: Finished difference Result 587 states and 1758 transitions. [2020-02-10 20:13:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:10,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,039 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:13:10,039 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:13:10,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:13:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 390. [2020-02-10 20:13:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1361 transitions. [2020-02-10 20:13:10,060 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1361 transitions. Word has length 22 [2020-02-10 20:13:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,060 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1361 transitions. [2020-02-10 20:13:10,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1361 transitions. [2020-02-10 20:13:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:10,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,062 INFO L415 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] [2020-02-10 20:13:10,062 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -543880818, now seen corresponding path program 150 times [2020-02-10 20:13:10,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529613508] [2020-02-10 20:13:10,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529613508] [2020-02-10 20:13:10,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:10,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854735251] [2020-02-10 20:13:10,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:10,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:10,486 INFO L87 Difference]: Start difference. First operand 390 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:13:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,619 INFO L93 Difference]: Finished difference Result 585 states and 1753 transitions. [2020-02-10 20:13:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:10,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,622 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:13:10,622 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:13:10,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:13:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 387. [2020-02-10 20:13:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1356 transitions. [2020-02-10 20:13:10,642 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,642 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1356 transitions. [2020-02-10 20:13:10,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1356 transitions. [2020-02-10 20:13:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:10,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,644 INFO L415 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] [2020-02-10 20:13:10,644 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1861648314, now seen corresponding path program 151 times [2020-02-10 20:13:10,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450527815] [2020-02-10 20:13:10,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450527815] [2020-02-10 20:13:10,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:10,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439433322] [2020-02-10 20:13:10,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:10,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:10,934 INFO L87 Difference]: Start difference. First operand 387 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,017 INFO L93 Difference]: Finished difference Result 614 states and 1824 transitions. [2020-02-10 20:13:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:11,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,019 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:13:11,019 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:13:11,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:13:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2020-02-10 20:13:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1376 transitions. [2020-02-10 20:13:11,032 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1376 transitions. Word has length 22 [2020-02-10 20:13:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,032 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1376 transitions. [2020-02-10 20:13:11,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1376 transitions. [2020-02-10 20:13:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:11,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,033 INFO L415 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] [2020-02-10 20:13:11,033 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash -271382428, now seen corresponding path program 152 times [2020-02-10 20:13:11,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428784915] [2020-02-10 20:13:11,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428784915] [2020-02-10 20:13:11,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:11,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122008387] [2020-02-10 20:13:11,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:11,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:11,302 INFO L87 Difference]: Start difference. First operand 395 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:13:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,413 INFO L93 Difference]: Finished difference Result 609 states and 1811 transitions. [2020-02-10 20:13:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:11,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,416 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:13:11,416 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:13:11,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:13:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 391. [2020-02-10 20:13:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 20:13:11,426 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,426 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 20:13:11,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 20:13:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:11,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,427 INFO L415 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] [2020-02-10 20:13:11,427 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash -529085386, now seen corresponding path program 153 times [2020-02-10 20:13:11,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712127698] [2020-02-10 20:13:11,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712127698] [2020-02-10 20:13:11,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:11,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009459418] [2020-02-10 20:13:11,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:11,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:11,702 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:13:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,798 INFO L93 Difference]: Finished difference Result 618 states and 1830 transitions. [2020-02-10 20:13:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:11,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,800 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:13:11,800 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:13:11,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:13:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 397. [2020-02-10 20:13:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:13:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-02-10 20:13:11,811 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-02-10 20:13:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,812 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-02-10 20:13:11,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-02-10 20:13:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:11,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,813 INFO L415 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] [2020-02-10 20:13:11,813 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2120185414, now seen corresponding path program 154 times [2020-02-10 20:13:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696499009] [2020-02-10 20:13:11,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696499009] [2020-02-10 20:13:12,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:12,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815981793] [2020-02-10 20:13:12,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:12,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,094 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:13:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,203 INFO L93 Difference]: Finished difference Result 615 states and 1819 transitions. [2020-02-10 20:13:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:12,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,205 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:13:12,205 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:13:12,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:13:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-02-10 20:13:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:13:12,214 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,214 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:13:12,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:13:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:12,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,215 INFO L415 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] [2020-02-10 20:13:12,215 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1744381800, now seen corresponding path program 155 times [2020-02-10 20:13:12,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658260775] [2020-02-10 20:13:12,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658260775] [2020-02-10 20:13:12,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:12,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524733977] [2020-02-10 20:13:12,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:12,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,470 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,585 INFO L93 Difference]: Finished difference Result 605 states and 1800 transitions. [2020-02-10 20:13:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:12,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,587 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:13:12,587 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:13:12,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:13:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2020-02-10 20:13:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 20:13:12,596 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 20:13:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,596 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 20:13:12,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 20:13:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:12,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,597 INFO L415 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] [2020-02-10 20:13:12,597 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -15334466, now seen corresponding path program 156 times [2020-02-10 20:13:12,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595441920] [2020-02-10 20:13:12,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595441920] [2020-02-10 20:13:12,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:12,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214100466] [2020-02-10 20:13:12,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:12,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,849 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:13:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,981 INFO L93 Difference]: Finished difference Result 607 states and 1801 transitions. [2020-02-10 20:13:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:12,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,983 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:13:12,983 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:13:12,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:13:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 387. [2020-02-10 20:13:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-02-10 20:13:12,993 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,993 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-02-10 20:13:12,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-02-10 20:13:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:12,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,994 INFO L415 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] [2020-02-10 20:13:12,994 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1145435970, now seen corresponding path program 157 times [2020-02-10 20:13:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513525592] [2020-02-10 20:13:12,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513525592] [2020-02-10 20:13:13,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:13,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117148578] [2020-02-10 20:13:13,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:13,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:13,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:13,246 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,350 INFO L93 Difference]: Finished difference Result 602 states and 1788 transitions. [2020-02-10 20:13:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:13,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,352 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:13:13,352 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:13:13,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:13:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 391. [2020-02-10 20:13:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:13:13,362 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:13,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,362 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:13:13,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:13:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:13,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,363 INFO L415 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] [2020-02-10 20:13:13,363 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash -584367478, now seen corresponding path program 158 times [2020-02-10 20:13:13,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254936887] [2020-02-10 20:13:13,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254936887] [2020-02-10 20:13:13,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:13,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970273161] [2020-02-10 20:13:13,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:13,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:13,685 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,787 INFO L93 Difference]: Finished difference Result 595 states and 1773 transitions. [2020-02-10 20:13:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:13,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,789 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:13:13,789 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:13:13,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:13:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-02-10 20:13:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 20:13:13,806 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,806 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 20:13:13,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 20:13:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:13,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,808 INFO L415 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] [2020-02-10 20:13:13,809 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash 961348150, now seen corresponding path program 159 times [2020-02-10 20:13:13,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462955160] [2020-02-10 20:13:13,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462955160] [2020-02-10 20:13:14,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337147931] [2020-02-10 20:13:14,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:14,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:14,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:14,091 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,168 INFO L93 Difference]: Finished difference Result 610 states and 1806 transitions. [2020-02-10 20:13:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:14,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,170 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:13:14,170 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:13:14,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:13:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 395. [2020-02-10 20:13:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-02-10 20:13:14,183 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-02-10 20:13:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,184 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-02-10 20:13:14,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-02-10 20:13:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:14,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,185 INFO L415 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] [2020-02-10 20:13:14,185 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1154168842, now seen corresponding path program 160 times [2020-02-10 20:13:14,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654458505] [2020-02-10 20:13:14,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654458505] [2020-02-10 20:13:14,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:14,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867310041] [2020-02-10 20:13:14,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:14,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:14,445 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:13:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,578 INFO L93 Difference]: Finished difference Result 607 states and 1795 transitions. [2020-02-10 20:13:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:14,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,580 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:13:14,580 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:13:14,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:13:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2020-02-10 20:13:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:13:14,589 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,589 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:13:14,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:13:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:14,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,590 INFO L415 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] [2020-02-10 20:13:14,590 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1016070376, now seen corresponding path program 161 times [2020-02-10 20:13:14,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958668401] [2020-02-10 20:13:14,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958668401] [2020-02-10 20:13:14,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:14,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189445769] [2020-02-10 20:13:14,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:14,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:14,844 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,944 INFO L93 Difference]: Finished difference Result 591 states and 1764 transitions. [2020-02-10 20:13:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:14,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,946 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:13:14,946 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:13:14,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:13:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-02-10 20:13:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 20:13:14,956 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 20:13:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,956 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 20:13:14,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 20:13:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:14,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,957 INFO L415 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] [2020-02-10 20:13:14,957 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1132726160, now seen corresponding path program 162 times [2020-02-10 20:13:14,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718969600] [2020-02-10 20:13:14,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718969600] [2020-02-10 20:13:15,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:15,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541429874] [2020-02-10 20:13:15,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:15,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:15,207 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:13:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,319 INFO L93 Difference]: Finished difference Result 595 states and 1771 transitions. [2020-02-10 20:13:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:15,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,321 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:13:15,321 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:13:15,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:13:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-02-10 20:13:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-02-10 20:13:15,330 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,330 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-02-10 20:13:15,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-02-10 20:13:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:15,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,331 INFO L415 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] [2020-02-10 20:13:15,331 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1512341980, now seen corresponding path program 163 times [2020-02-10 20:13:15,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756888567] [2020-02-10 20:13:15,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756888567] [2020-02-10 20:13:15,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:15,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910610336] [2020-02-10 20:13:15,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:15,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:15,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:15,607 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,724 INFO L93 Difference]: Finished difference Result 581 states and 1744 transitions. [2020-02-10 20:13:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:15,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,726 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:13:15,726 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:13:15,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:13:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 389. [2020-02-10 20:13:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:13:15,736 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,736 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:13:15,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:13:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:15,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,737 INFO L415 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] [2020-02-10 20:13:15,737 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash 66824970, now seen corresponding path program 164 times [2020-02-10 20:13:15,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533331095] [2020-02-10 20:13:15,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533331095] [2020-02-10 20:13:16,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:16,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689042018] [2020-02-10 20:13:16,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:16,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:16,018 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,109 INFO L93 Difference]: Finished difference Result 579 states and 1739 transitions. [2020-02-10 20:13:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:16,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,111 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:13:16,111 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:13:16,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:13:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 388. [2020-02-10 20:13:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1354 transitions. [2020-02-10 20:13:16,121 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,121 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1354 transitions. [2020-02-10 20:13:16,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1354 transitions. [2020-02-10 20:13:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:16,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,122 INFO L415 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] [2020-02-10 20:13:16,122 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -675841196, now seen corresponding path program 165 times [2020-02-10 20:13:16,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011954106] [2020-02-10 20:13:16,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011954106] [2020-02-10 20:13:16,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:16,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750881008] [2020-02-10 20:13:16,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:16,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:16,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:16,391 INFO L87 Difference]: Start difference. First operand 388 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,498 INFO L93 Difference]: Finished difference Result 587 states and 1757 transitions. [2020-02-10 20:13:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:16,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,500 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:13:16,501 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:13:16,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:16,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:13:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2020-02-10 20:13:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-02-10 20:13:16,509 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-02-10 20:13:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,510 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-02-10 20:13:16,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-02-10 20:13:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:16,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,510 INFO L415 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] [2020-02-10 20:13:16,510 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1457840438, now seen corresponding path program 166 times [2020-02-10 20:13:16,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194098126] [2020-02-10 20:13:16,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194098126] [2020-02-10 20:13:16,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:16,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65212339] [2020-02-10 20:13:16,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:16,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:16,762 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:13:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,897 INFO L93 Difference]: Finished difference Result 589 states and 1758 transitions. [2020-02-10 20:13:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:16,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,899 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:13:16,900 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:13:16,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:13:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 388. [2020-02-10 20:13:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-02-10 20:13:16,909 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-02-10 20:13:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,909 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-02-10 20:13:16,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-02-10 20:13:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:16,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,910 INFO L415 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] [2020-02-10 20:13:16,910 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash 573171236, now seen corresponding path program 167 times [2020-02-10 20:13:16,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023782214] [2020-02-10 20:13:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023782214] [2020-02-10 20:13:17,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:17,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572311397] [2020-02-10 20:13:17,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:17,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,166 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:13:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,276 INFO L93 Difference]: Finished difference Result 581 states and 1742 transitions. [2020-02-10 20:13:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:17,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,278 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:13:17,278 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:13:17,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:13:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-02-10 20:13:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 20:13:17,288 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,288 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 20:13:17,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 20:13:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:17,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,289 INFO L415 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] [2020-02-10 20:13:17,289 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1575625300, now seen corresponding path program 168 times [2020-02-10 20:13:17,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342427062] [2020-02-10 20:13:17,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342427062] [2020-02-10 20:13:17,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:17,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048565662] [2020-02-10 20:13:17,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:17,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,542 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,656 INFO L93 Difference]: Finished difference Result 585 states and 1749 transitions. [2020-02-10 20:13:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:17,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,658 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:13:17,658 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:13:17,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:13:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 385. [2020-02-10 20:13:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:13:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1348 transitions. [2020-02-10 20:13:17,667 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1348 transitions. Word has length 22 [2020-02-10 20:13:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,668 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1348 transitions. [2020-02-10 20:13:17,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1348 transitions. [2020-02-10 20:13:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:17,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,668 INFO L415 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] [2020-02-10 20:13:17,668 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash 108734734, now seen corresponding path program 169 times [2020-02-10 20:13:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347106567] [2020-02-10 20:13:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347106567] [2020-02-10 20:13:17,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:17,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728833290] [2020-02-10 20:13:17,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:17,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:17,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,927 INFO L87 Difference]: Start difference. First operand 385 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:13:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,034 INFO L93 Difference]: Finished difference Result 614 states and 1830 transitions. [2020-02-10 20:13:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:18,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,036 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:13:18,036 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:13:18,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:13:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2020-02-10 20:13:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1377 transitions. [2020-02-10 20:13:18,045 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1377 transitions. Word has length 22 [2020-02-10 20:13:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,045 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1377 transitions. [2020-02-10 20:13:18,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1377 transitions. [2020-02-10 20:13:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:18,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,046 INFO L415 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] [2020-02-10 20:13:18,046 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1699000620, now seen corresponding path program 170 times [2020-02-10 20:13:18,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619900441] [2020-02-10 20:13:18,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619900441] [2020-02-10 20:13:18,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:18,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856257920] [2020-02-10 20:13:18,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:18,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:18,296 INFO L87 Difference]: Start difference. First operand 395 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:13:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,404 INFO L93 Difference]: Finished difference Result 609 states and 1817 transitions. [2020-02-10 20:13:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:18,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,406 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:13:18,406 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:13:18,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:13:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 391. [2020-02-10 20:13:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1368 transitions. [2020-02-10 20:13:18,415 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1368 transitions. Word has length 22 [2020-02-10 20:13:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,416 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1368 transitions. [2020-02-10 20:13:18,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1368 transitions. [2020-02-10 20:13:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:18,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,417 INFO L415 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] [2020-02-10 20:13:18,417 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash 209646906, now seen corresponding path program 171 times [2020-02-10 20:13:18,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509814807] [2020-02-10 20:13:18,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509814807] [2020-02-10 20:13:18,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:18,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736022360] [2020-02-10 20:13:18,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:18,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:18,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:18,781 INFO L87 Difference]: Start difference. First operand 391 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:13:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,913 INFO L93 Difference]: Finished difference Result 612 states and 1822 transitions. [2020-02-10 20:13:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:18,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,914 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:13:18,915 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:13:18,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:13:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 394. [2020-02-10 20:13:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-02-10 20:13:18,928 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-02-10 20:13:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,928 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-02-10 20:13:18,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-02-10 20:13:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:18,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,929 INFO L415 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] [2020-02-10 20:13:18,930 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash 336283280, now seen corresponding path program 172 times [2020-02-10 20:13:18,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55561021] [2020-02-10 20:13:18,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55561021] [2020-02-10 20:13:19,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:19,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785851153] [2020-02-10 20:13:19,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:19,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:19,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,186 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:13:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,294 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-02-10 20:13:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:19,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,296 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:13:19,297 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:13:19,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:13:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 391. [2020-02-10 20:13:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1365 transitions. [2020-02-10 20:13:19,307 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1365 transitions. Word has length 22 [2020-02-10 20:13:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,307 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1365 transitions. [2020-02-10 20:13:19,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1365 transitions. [2020-02-10 20:13:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:19,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,308 INFO L415 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] [2020-02-10 20:13:19,308 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2078734888, now seen corresponding path program 173 times [2020-02-10 20:13:19,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541377601] [2020-02-10 20:13:19,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541377601] [2020-02-10 20:13:19,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:19,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071391350] [2020-02-10 20:13:19,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:19,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,563 INFO L87 Difference]: Start difference. First operand 391 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:13:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,671 INFO L93 Difference]: Finished difference Result 601 states and 1799 transitions. [2020-02-10 20:13:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:19,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,673 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:13:19,673 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:13:19,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:13:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 393. [2020-02-10 20:13:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1368 transitions. [2020-02-10 20:13:19,684 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1368 transitions. Word has length 22 [2020-02-10 20:13:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,684 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1368 transitions. [2020-02-10 20:13:19,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1368 transitions. [2020-02-10 20:13:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:19,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,684 INFO L415 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] [2020-02-10 20:13:19,685 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash -736802100, now seen corresponding path program 174 times [2020-02-10 20:13:19,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622312669] [2020-02-10 20:13:19,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622312669] [2020-02-10 20:13:19,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:19,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066751396] [2020-02-10 20:13:19,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:19,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:19,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,935 INFO L87 Difference]: Start difference. First operand 393 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:13:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,036 INFO L93 Difference]: Finished difference Result 600 states and 1795 transitions. [2020-02-10 20:13:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:20,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,037 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:13:20,038 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:13:20,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:13:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 388. [2020-02-10 20:13:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1358 transitions. [2020-02-10 20:13:20,048 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,048 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1358 transitions. [2020-02-10 20:13:20,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1358 transitions. [2020-02-10 20:13:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:20,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,049 INFO L415 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] [2020-02-10 20:13:20,049 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2073803932, now seen corresponding path program 175 times [2020-02-10 20:13:20,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011415619] [2020-02-10 20:13:20,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011415619] [2020-02-10 20:13:20,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:20,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091133161] [2020-02-10 20:13:20,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:20,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:20,303 INFO L87 Difference]: Start difference. First operand 388 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,384 INFO L93 Difference]: Finished difference Result 622 states and 1849 transitions. [2020-02-10 20:13:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:20,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,386 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:13:20,386 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:13:20,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:13:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 396. [2020-02-10 20:13:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:13:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1378 transitions. [2020-02-10 20:13:20,396 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1378 transitions. Word has length 22 [2020-02-10 20:13:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,396 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1378 transitions. [2020-02-10 20:13:20,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1378 transitions. [2020-02-10 20:13:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:20,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,397 INFO L415 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] [2020-02-10 20:13:20,397 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash -483538046, now seen corresponding path program 176 times [2020-02-10 20:13:20,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286462772] [2020-02-10 20:13:20,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286462772] [2020-02-10 20:13:20,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:20,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482479419] [2020-02-10 20:13:20,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:20,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:20,647 INFO L87 Difference]: Start difference. First operand 396 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:13:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,749 INFO L93 Difference]: Finished difference Result 617 states and 1836 transitions. [2020-02-10 20:13:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:20,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,751 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:13:20,751 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:13:20,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:13:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-02-10 20:13:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1368 transitions. [2020-02-10 20:13:20,760 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1368 transitions. Word has length 22 [2020-02-10 20:13:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,760 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1368 transitions. [2020-02-10 20:13:20,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1368 transitions. [2020-02-10 20:13:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:20,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,761 INFO L415 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] [2020-02-10 20:13:20,761 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash -741241004, now seen corresponding path program 177 times [2020-02-10 20:13:20,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897929318] [2020-02-10 20:13:20,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897929318] [2020-02-10 20:13:21,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:21,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997283321] [2020-02-10 20:13:21,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:21,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:21,028 INFO L87 Difference]: Start difference. First operand 392 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:13:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,108 INFO L93 Difference]: Finished difference Result 626 states and 1855 transitions. [2020-02-10 20:13:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:21,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,110 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:13:21,110 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:13:21,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:13:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 398. [2020-02-10 20:13:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:13:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1378 transitions. [2020-02-10 20:13:21,120 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1378 transitions. Word has length 22 [2020-02-10 20:13:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,120 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1378 transitions. [2020-02-10 20:13:21,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1378 transitions. [2020-02-10 20:13:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:21,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,121 INFO L415 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] [2020-02-10 20:13:21,121 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1962626264, now seen corresponding path program 178 times [2020-02-10 20:13:21,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201940838] [2020-02-10 20:13:21,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201940838] [2020-02-10 20:13:21,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:21,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903354110] [2020-02-10 20:13:21,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:21,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:21,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:21,416 INFO L87 Difference]: Start difference. First operand 398 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:13:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,528 INFO L93 Difference]: Finished difference Result 623 states and 1844 transitions. [2020-02-10 20:13:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:21,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,530 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:13:21,530 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:13:21,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:13:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2020-02-10 20:13:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 20:13:21,539 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,539 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 20:13:21,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 20:13:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:21,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,540 INFO L415 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] [2020-02-10 20:13:21,540 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1956537418, now seen corresponding path program 179 times [2020-02-10 20:13:21,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849220999] [2020-02-10 20:13:21,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849220999] [2020-02-10 20:13:21,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:21,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147042893] [2020-02-10 20:13:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:21,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:21,809 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,915 INFO L93 Difference]: Finished difference Result 613 states and 1825 transitions. [2020-02-10 20:13:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:21,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,917 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:13:21,918 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:13:21,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:13:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 395. [2020-02-10 20:13:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-02-10 20:13:21,928 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-02-10 20:13:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,928 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-02-10 20:13:21,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-02-10 20:13:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:21,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,929 INFO L415 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] [2020-02-10 20:13:21,929 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash -227490084, now seen corresponding path program 180 times [2020-02-10 20:13:21,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341799751] [2020-02-10 20:13:21,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341799751] [2020-02-10 20:13:22,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:22,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791111758] [2020-02-10 20:13:22,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:22,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:22,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,183 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:13:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,293 INFO L93 Difference]: Finished difference Result 615 states and 1826 transitions. [2020-02-10 20:13:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:22,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,296 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:13:22,296 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:13:22,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:13:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2020-02-10 20:13:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-02-10 20:13:22,308 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-02-10 20:13:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,308 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-02-10 20:13:22,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-02-10 20:13:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:22,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,310 INFO L415 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] [2020-02-10 20:13:22,310 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash -485724428, now seen corresponding path program 181 times [2020-02-10 20:13:22,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941979026] [2020-02-10 20:13:22,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941979026] [2020-02-10 20:13:22,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:22,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081875117] [2020-02-10 20:13:22,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:22,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:22,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,589 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:13:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,669 INFO L93 Difference]: Finished difference Result 616 states and 1829 transitions. [2020-02-10 20:13:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:22,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,671 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:13:22,672 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:13:22,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:13:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 394. [2020-02-10 20:13:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 20:13:22,681 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 20:13:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,681 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 20:13:22,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 20:13:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:22,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,682 INFO L415 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] [2020-02-10 20:13:22,682 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash -359088054, now seen corresponding path program 182 times [2020-02-10 20:13:22,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370683051] [2020-02-10 20:13:22,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370683051] [2020-02-10 20:13:22,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:22,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725069494] [2020-02-10 20:13:22,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:22,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,931 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:13:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,039 INFO L93 Difference]: Finished difference Result 610 states and 1815 transitions. [2020-02-10 20:13:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:23,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,041 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:13:23,041 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:13:23,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:13:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 391. [2020-02-10 20:13:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:13:23,050 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,051 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:13:23,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:13:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:23,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,052 INFO L415 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] [2020-02-10 20:13:23,052 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 49505374, now seen corresponding path program 183 times [2020-02-10 20:13:23,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858299347] [2020-02-10 20:13:23,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858299347] [2020-02-10 20:13:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:23,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119614585] [2020-02-10 20:13:23,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:23,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:23,318 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,394 INFO L93 Difference]: Finished difference Result 622 states and 1841 transitions. [2020-02-10 20:13:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:23,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,396 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:13:23,396 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:13:23,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:13:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 397. [2020-02-10 20:13:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:13:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1372 transitions. [2020-02-10 20:13:23,407 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1372 transitions. Word has length 22 [2020-02-10 20:13:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,407 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1372 transitions. [2020-02-10 20:13:23,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1372 transitions. [2020-02-10 20:13:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:23,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,408 INFO L415 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] [2020-02-10 20:13:23,408 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 795936300, now seen corresponding path program 184 times [2020-02-10 20:13:23,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785577943] [2020-02-10 20:13:23,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785577943] [2020-02-10 20:13:23,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:23,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853515067] [2020-02-10 20:13:23,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:23,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:23,691 INFO L87 Difference]: Start difference. First operand 397 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:13:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,782 INFO L93 Difference]: Finished difference Result 619 states and 1830 transitions. [2020-02-10 20:13:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:23,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,784 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:13:23,784 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:13:23,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:13:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 391. [2020-02-10 20:13:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-02-10 20:13:23,793 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-02-10 20:13:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,794 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-02-10 20:13:23,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-02-10 20:13:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:23,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,795 INFO L415 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] [2020-02-10 20:13:23,795 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1970029012, now seen corresponding path program 185 times [2020-02-10 20:13:23,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977722458] [2020-02-10 20:13:23,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977722458] [2020-02-10 20:13:24,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:24,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385269747] [2020-02-10 20:13:24,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:24,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:24,053 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:13:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,156 INFO L93 Difference]: Finished difference Result 606 states and 1805 transitions. [2020-02-10 20:13:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:24,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,158 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:13:24,158 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:13:24,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:13:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2020-02-10 20:13:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 20:13:24,168 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,168 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 20:13:24,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 20:13:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:24,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,169 INFO L415 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] [2020-02-10 20:13:24,169 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1398574206, now seen corresponding path program 186 times [2020-02-10 20:13:24,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934398285] [2020-02-10 20:13:24,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934398285] [2020-02-10 20:13:24,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:24,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806984703] [2020-02-10 20:13:24,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:24,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:24,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:24,434 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,537 INFO L93 Difference]: Finished difference Result 609 states and 1809 transitions. [2020-02-10 20:13:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:24,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,539 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:13:24,539 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:13:24,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:13:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 388. [2020-02-10 20:13:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 20:13:24,549 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,549 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 20:13:24,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 20:13:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:24,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,551 INFO L415 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] [2020-02-10 20:13:24,551 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1680014634, now seen corresponding path program 187 times [2020-02-10 20:13:24,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650912360] [2020-02-10 20:13:24,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650912360] [2020-02-10 20:13:24,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:24,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862431877] [2020-02-10 20:13:24,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:24,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:24,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:24,820 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,931 INFO L93 Difference]: Finished difference Result 595 states and 1784 transitions. [2020-02-10 20:13:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:24,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,933 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:13:24,933 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:13:24,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:13:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 392. [2020-02-10 20:13:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 20:13:24,943 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,943 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 20:13:24,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 20:13:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:24,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,944 INFO L415 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] [2020-02-10 20:13:24,944 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash -338081846, now seen corresponding path program 188 times [2020-02-10 20:13:24,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925736921] [2020-02-10 20:13:24,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925736921] [2020-02-10 20:13:25,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:25,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565339252] [2020-02-10 20:13:25,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:25,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,204 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,316 INFO L93 Difference]: Finished difference Result 594 states and 1780 transitions. [2020-02-10 20:13:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:25,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,318 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:13:25,319 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:13:25,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:13:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-02-10 20:13:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 20:13:25,328 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 20:13:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,328 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 20:13:25,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 20:13:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:25,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,329 INFO L415 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] [2020-02-10 20:13:25,329 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1144784832, now seen corresponding path program 189 times [2020-02-10 20:13:25,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959116031] [2020-02-10 20:13:25,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959116031] [2020-02-10 20:13:25,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:25,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970771157] [2020-02-10 20:13:25,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:25,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,582 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:13:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,691 INFO L93 Difference]: Finished difference Result 599 states and 1791 transitions. [2020-02-10 20:13:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:25,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,693 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:13:25,694 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:13:25,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:13:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2020-02-10 20:13:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 20:13:25,702 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,703 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 20:13:25,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 20:13:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:25,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,703 INFO L415 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] [2020-02-10 20:13:25,704 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1373173840, now seen corresponding path program 190 times [2020-02-10 20:13:25,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650206441] [2020-02-10 20:13:25,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650206441] [2020-02-10 20:13:25,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:25,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415630581] [2020-02-10 20:13:25,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:25,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,951 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,054 INFO L93 Difference]: Finished difference Result 601 states and 1792 transitions. [2020-02-10 20:13:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:26,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,056 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:13:26,056 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:13:26,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:13:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 390. [2020-02-10 20:13:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 20:13:26,069 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 20:13:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,069 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 20:13:26,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 20:13:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:26,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,070 INFO L415 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] [2020-02-10 20:13:26,070 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -875937424, now seen corresponding path program 191 times [2020-02-10 20:13:26,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058022376] [2020-02-10 20:13:26,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058022376] [2020-02-10 20:13:26,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:26,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751930189] [2020-02-10 20:13:26,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:26,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:26,333 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:13:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,428 INFO L93 Difference]: Finished difference Result 596 states and 1782 transitions. [2020-02-10 20:13:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:26,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,430 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:13:26,430 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:13:26,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:13:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2020-02-10 20:13:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1358 transitions. [2020-02-10 20:13:26,440 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,440 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1358 transitions. [2020-02-10 20:13:26,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1358 transitions. [2020-02-10 20:13:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:26,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,441 INFO L415 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] [2020-02-10 20:13:26,441 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -304482618, now seen corresponding path program 192 times [2020-02-10 20:13:26,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881916904] [2020-02-10 20:13:26,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881916904] [2020-02-10 20:13:26,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:26,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109857993] [2020-02-10 20:13:26,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:26,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:26,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:26,699 INFO L87 Difference]: Start difference. First operand 392 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,797 INFO L93 Difference]: Finished difference Result 599 states and 1786 transitions. [2020-02-10 20:13:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:26,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,799 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:13:26,799 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:13:26,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:13:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-02-10 20:13:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:13:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1346 transitions. [2020-02-10 20:13:26,809 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1346 transitions. Word has length 22 [2020-02-10 20:13:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,809 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1346 transitions. [2020-02-10 20:13:26,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1346 transitions. [2020-02-10 20:13:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:26,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,810 INFO L415 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] [2020-02-10 20:13:26,810 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash -681425196, now seen corresponding path program 193 times [2020-02-10 20:13:26,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573919362] [2020-02-10 20:13:26,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573919362] [2020-02-10 20:13:27,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:27,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57037241] [2020-02-10 20:13:27,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:27,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,078 INFO L87 Difference]: Start difference. First operand 385 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:13:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,157 INFO L93 Difference]: Finished difference Result 592 states and 1761 transitions. [2020-02-10 20:13:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:27,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,159 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:13:27,159 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:13:27,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:13:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2020-02-10 20:13:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:13:27,169 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,169 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:13:27,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:13:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:27,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,170 INFO L415 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] [2020-02-10 20:13:27,170 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,170 INFO L82 PathProgramCache]: Analyzing trace with hash -120356704, now seen corresponding path program 194 times [2020-02-10 20:13:27,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544300553] [2020-02-10 20:13:27,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544300553] [2020-02-10 20:13:27,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:27,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443247815] [2020-02-10 20:13:27,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:27,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,438 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,514 INFO L93 Difference]: Finished difference Result 585 states and 1746 transitions. [2020-02-10 20:13:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:27,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,516 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:13:27,516 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:13:27,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:13:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 389. [2020-02-10 20:13:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 20:13:27,526 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,526 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 20:13:27,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 20:13:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:27,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,527 INFO L415 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] [2020-02-10 20:13:27,527 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2013104246, now seen corresponding path program 195 times [2020-02-10 20:13:27,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959083028] [2020-02-10 20:13:27,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959083028] [2020-02-10 20:13:27,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:27,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868779229] [2020-02-10 20:13:27,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:27,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,816 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,900 INFO L93 Difference]: Finished difference Result 594 states and 1764 transitions. [2020-02-10 20:13:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:27,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,902 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:13:27,902 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:13:27,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:13:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 392. [2020-02-10 20:13:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 20:13:27,912 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,912 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 20:13:27,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 20:13:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:27,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,913 INFO L415 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] [2020-02-10 20:13:27,913 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1050900584, now seen corresponding path program 196 times [2020-02-10 20:13:27,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051571101] [2020-02-10 20:13:27,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051571101] [2020-02-10 20:13:28,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:28,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117520812] [2020-02-10 20:13:28,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:28,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:28,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,174 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,289 INFO L93 Difference]: Finished difference Result 588 states and 1750 transitions. [2020-02-10 20:13:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:28,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,291 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:13:28,291 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:13:28,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:13:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-02-10 20:13:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:13:28,299 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,300 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:13:28,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:13:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:28,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,300 INFO L415 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] [2020-02-10 20:13:28,300 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2067826472, now seen corresponding path program 197 times [2020-02-10 20:13:28,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697153152] [2020-02-10 20:13:28,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697153152] [2020-02-10 20:13:28,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:28,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909244614] [2020-02-10 20:13:28,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:28,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:28,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,577 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,657 INFO L93 Difference]: Finished difference Result 578 states and 1731 transitions. [2020-02-10 20:13:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:28,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,659 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:13:28,659 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:13:28,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:13:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 390. [2020-02-10 20:13:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 20:13:28,669 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 20:13:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,669 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 20:13:28,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 20:13:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:28,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,670 INFO L415 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] [2020-02-10 20:13:28,670 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,670 INFO L82 PathProgramCache]: Analyzing trace with hash -616199866, now seen corresponding path program 198 times [2020-02-10 20:13:28,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255901685] [2020-02-10 20:13:28,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255901685] [2020-02-10 20:13:28,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:28,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887519312] [2020-02-10 20:13:28,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:28,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:28,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,945 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:13:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,045 INFO L93 Difference]: Finished difference Result 579 states and 1732 transitions. [2020-02-10 20:13:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:29,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,047 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:13:29,047 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:13:29,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:13:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 387. [2020-02-10 20:13:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-02-10 20:13:29,056 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,056 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-02-10 20:13:29,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-02-10 20:13:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:29,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,057 INFO L415 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] [2020-02-10 20:13:29,057 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1721660994, now seen corresponding path program 199 times [2020-02-10 20:13:29,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467499599] [2020-02-10 20:13:29,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467499599] [2020-02-10 20:13:29,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:29,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858365788] [2020-02-10 20:13:29,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:29,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:29,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:29,356 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,441 INFO L93 Difference]: Finished difference Result 598 states and 1774 transitions. [2020-02-10 20:13:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:29,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,443 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:13:29,443 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:13:29,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:13:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 391. [2020-02-10 20:13:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 20:13:29,452 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 20:13:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,452 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 20:13:29,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 20:13:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:29,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,453 INFO L415 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] [2020-02-10 20:13:29,453 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1160592502, now seen corresponding path program 200 times [2020-02-10 20:13:29,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272923432] [2020-02-10 20:13:29,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272923432] [2020-02-10 20:13:29,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:29,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561734725] [2020-02-10 20:13:29,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:29,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:29,737 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:13:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,829 INFO L93 Difference]: Finished difference Result 591 states and 1759 transitions. [2020-02-10 20:13:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:29,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,831 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:13:29,831 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:13:29,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:13:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-02-10 20:13:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:13:29,842 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,843 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:13:29,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:13:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:29,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,844 INFO L415 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] [2020-02-10 20:13:29,844 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 385123126, now seen corresponding path program 201 times [2020-02-10 20:13:29,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033750569] [2020-02-10 20:13:29,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033750569] [2020-02-10 20:13:30,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:30,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328675951] [2020-02-10 20:13:30,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:30,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,119 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,202 INFO L93 Difference]: Finished difference Result 606 states and 1792 transitions. [2020-02-10 20:13:30,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:30,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,204 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:13:30,204 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:13:30,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:13:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 395. [2020-02-10 20:13:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1366 transitions. [2020-02-10 20:13:30,213 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,213 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1366 transitions. [2020-02-10 20:13:30,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1366 transitions. [2020-02-10 20:13:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:30,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,214 INFO L415 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] [2020-02-10 20:13:30,214 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash 577943818, now seen corresponding path program 202 times [2020-02-10 20:13:30,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676485014] [2020-02-10 20:13:30,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676485014] [2020-02-10 20:13:30,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:30,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783451421] [2020-02-10 20:13:30,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:30,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:30,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,484 INFO L87 Difference]: Start difference. First operand 395 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:13:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,597 INFO L93 Difference]: Finished difference Result 603 states and 1781 transitions. [2020-02-10 20:13:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:30,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,599 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:13:30,599 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:13:30,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:13:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-02-10 20:13:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 20:13:30,609 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,610 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 20:13:30,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 20:13:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:30,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,611 INFO L415 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] [2020-02-10 20:13:30,611 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 439845352, now seen corresponding path program 203 times [2020-02-10 20:13:30,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186595075] [2020-02-10 20:13:30,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186595075] [2020-02-10 20:13:30,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:30,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17878856] [2020-02-10 20:13:30,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:30,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,908 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,005 INFO L93 Difference]: Finished difference Result 587 states and 1750 transitions. [2020-02-10 20:13:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:31,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,006 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:13:31,006 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:13:31,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:13:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-02-10 20:13:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 20:13:31,014 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 20:13:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,014 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 20:13:31,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 20:13:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:31,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,015 INFO L415 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] [2020-02-10 20:13:31,015 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1708951184, now seen corresponding path program 204 times [2020-02-10 20:13:31,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700650666] [2020-02-10 20:13:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700650666] [2020-02-10 20:13:31,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:31,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684367074] [2020-02-10 20:13:31,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:31,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:31,285 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:13:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,400 INFO L93 Difference]: Finished difference Result 591 states and 1757 transitions. [2020-02-10 20:13:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:31,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,402 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:13:31,402 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:13:31,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:13:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 387. [2020-02-10 20:13:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-02-10 20:13:31,414 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-02-10 20:13:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,414 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-02-10 20:13:31,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-02-10 20:13:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:31,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,415 INFO L415 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] [2020-02-10 20:13:31,415 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1396064770, now seen corresponding path program 205 times [2020-02-10 20:13:31,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368500125] [2020-02-10 20:13:31,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368500125] [2020-02-10 20:13:31,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:31,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488585100] [2020-02-10 20:13:31,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:31,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:31,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:31,693 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:13:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,772 INFO L93 Difference]: Finished difference Result 604 states and 1789 transitions. [2020-02-10 20:13:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:31,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,774 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:13:31,774 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:13:31,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:13:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2020-02-10 20:13:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 20:13:31,783 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,783 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 20:13:31,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 20:13:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:31,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,784 INFO L415 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] [2020-02-10 20:13:31,784 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1936698864, now seen corresponding path program 206 times [2020-02-10 20:13:31,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232358758] [2020-02-10 20:13:31,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232358758] [2020-02-10 20:13:32,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:32,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913635344] [2020-02-10 20:13:32,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:32,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,050 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,146 INFO L93 Difference]: Finished difference Result 598 states and 1775 transitions. [2020-02-10 20:13:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:32,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,148 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:13:32,148 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:13:32,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:13:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 390. [2020-02-10 20:13:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 20:13:32,157 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 20:13:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,158 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 20:13:32,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 20:13:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:32,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,158 INFO L415 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] [2020-02-10 20:13:32,158 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1983810092, now seen corresponding path program 207 times [2020-02-10 20:13:32,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332160550] [2020-02-10 20:13:32,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332160550] [2020-02-10 20:13:32,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:32,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774415004] [2020-02-10 20:13:32,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,436 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:13:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,512 INFO L93 Difference]: Finished difference Result 610 states and 1801 transitions. [2020-02-10 20:13:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:32,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,514 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:13:32,514 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:13:32,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:13:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 396. [2020-02-10 20:13:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:13:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-02-10 20:13:32,524 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-02-10 20:13:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,524 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-02-10 20:13:32,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-02-10 20:13:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:32,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,525 INFO L415 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] [2020-02-10 20:13:32,525 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1790989400, now seen corresponding path program 208 times [2020-02-10 20:13:32,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978993571] [2020-02-10 20:13:32,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978993571] [2020-02-10 20:13:32,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:32,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97217793] [2020-02-10 20:13:32,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:32,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,794 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:13:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,904 INFO L93 Difference]: Finished difference Result 607 states and 1790 transitions. [2020-02-10 20:13:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:32,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,906 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:13:32,906 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:13:32,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:13:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 390. [2020-02-10 20:13:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1354 transitions. [2020-02-10 20:13:32,916 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,916 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1354 transitions. [2020-02-10 20:13:32,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1354 transitions. [2020-02-10 20:13:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:32,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,917 INFO L415 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] [2020-02-10 20:13:32,917 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash 343709836, now seen corresponding path program 209 times [2020-02-10 20:13:32,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132377870] [2020-02-10 20:13:32,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132377870] [2020-02-10 20:13:33,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:33,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819915610] [2020-02-10 20:13:33,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:33,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:33,184 INFO L87 Difference]: Start difference. First operand 390 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,285 INFO L93 Difference]: Finished difference Result 594 states and 1765 transitions. [2020-02-10 20:13:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:33,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,287 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:13:33,287 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:13:33,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:13:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 392. [2020-02-10 20:13:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-02-10 20:13:33,297 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-02-10 20:13:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,297 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-02-10 20:13:33,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-02-10 20:13:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:33,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,297 INFO L415 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] [2020-02-10 20:13:33,298 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,298 INFO L82 PathProgramCache]: Analyzing trace with hash 915164642, now seen corresponding path program 210 times [2020-02-10 20:13:33,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342329929] [2020-02-10 20:13:33,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342329929] [2020-02-10 20:13:33,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:33,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498196091] [2020-02-10 20:13:33,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:33,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:33,570 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:13:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,689 INFO L93 Difference]: Finished difference Result 597 states and 1769 transitions. [2020-02-10 20:13:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:33,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,691 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:13:33,691 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:13:33,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:13:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-02-10 20:13:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-02-10 20:13:33,701 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-02-10 20:13:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,701 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-02-10 20:13:33,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-02-10 20:13:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:33,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,702 INFO L415 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] [2020-02-10 20:13:33,702 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash 141792394, now seen corresponding path program 211 times [2020-02-10 20:13:33,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103515802] [2020-02-10 20:13:33,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103515802] [2020-02-10 20:13:33,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:33,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346002394] [2020-02-10 20:13:33,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:33,993 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:13:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,077 INFO L93 Difference]: Finished difference Result 572 states and 1717 transitions. [2020-02-10 20:13:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:34,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,079 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:13:34,079 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:13:34,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:13:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 389. [2020-02-10 20:13:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-02-10 20:13:34,092 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,092 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-02-10 20:13:34,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-02-10 20:13:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:34,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,094 INFO L415 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] [2020-02-10 20:13:34,094 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1752733352, now seen corresponding path program 212 times [2020-02-10 20:13:34,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401190285] [2020-02-10 20:13:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401190285] [2020-02-10 20:13:34,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:34,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861339483] [2020-02-10 20:13:34,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:34,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:34,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:34,390 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,497 INFO L93 Difference]: Finished difference Result 573 states and 1718 transitions. [2020-02-10 20:13:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:34,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,499 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:13:34,499 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:13:34,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:13:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 388. [2020-02-10 20:13:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-02-10 20:13:34,508 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-02-10 20:13:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,508 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-02-10 20:13:34,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-02-10 20:13:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:34,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,509 INFO L415 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] [2020-02-10 20:13:34,509 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash -445952928, now seen corresponding path program 213 times [2020-02-10 20:13:34,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290311609] [2020-02-10 20:13:34,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290311609] [2020-02-10 20:13:34,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:34,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304752446] [2020-02-10 20:13:34,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:34,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:34,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:34,815 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:13:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,894 INFO L93 Difference]: Finished difference Result 575 states and 1722 transitions. [2020-02-10 20:13:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:34,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,896 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:13:34,896 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:13:34,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:13:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 389. [2020-02-10 20:13:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1351 transitions. [2020-02-10 20:13:34,907 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1351 transitions. Word has length 22 [2020-02-10 20:13:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,907 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1351 transitions. [2020-02-10 20:13:34,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1351 transitions. [2020-02-10 20:13:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:34,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,907 INFO L415 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] [2020-02-10 20:13:34,908 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1700217832, now seen corresponding path program 214 times [2020-02-10 20:13:34,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258090983] [2020-02-10 20:13:34,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258090983] [2020-02-10 20:13:35,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:35,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662921059] [2020-02-10 20:13:35,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:35,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:35,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:35,178 INFO L87 Difference]: Start difference. First operand 389 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:13:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,280 INFO L93 Difference]: Finished difference Result 579 states and 1729 transitions. [2020-02-10 20:13:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:35,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,282 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:13:35,283 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:13:35,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:13:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 388. [2020-02-10 20:13:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 20:13:35,292 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,292 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 20:13:35,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 20:13:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:35,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,293 INFO L415 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] [2020-02-10 20:13:35,293 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,293 INFO L82 PathProgramCache]: Analyzing trace with hash -435449824, now seen corresponding path program 215 times [2020-02-10 20:13:35,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140488028] [2020-02-10 20:13:35,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140488028] [2020-02-10 20:13:35,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:35,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503019926] [2020-02-10 20:13:35,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:35,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:35,563 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,669 INFO L93 Difference]: Finished difference Result 578 states and 1728 transitions. [2020-02-10 20:13:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:35,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,671 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:13:35,671 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:13:35,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:13:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-02-10 20:13:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 20:13:35,681 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,681 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 20:13:35,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 20:13:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:35,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,682 INFO L415 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] [2020-02-10 20:13:35,682 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash 99779978, now seen corresponding path program 216 times [2020-02-10 20:13:35,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948884233] [2020-02-10 20:13:35,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948884233] [2020-02-10 20:13:35,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:35,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592887753] [2020-02-10 20:13:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:35,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:35,951 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,056 INFO L93 Difference]: Finished difference Result 581 states and 1732 transitions. [2020-02-10 20:13:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:36,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,058 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:13:36,058 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:13:36,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:13:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 20:13:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:13:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1344 transitions. [2020-02-10 20:13:36,067 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1344 transitions. Word has length 22 [2020-02-10 20:13:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,067 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1344 transitions. [2020-02-10 20:13:36,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1344 transitions. [2020-02-10 20:13:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:36,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,068 INFO L415 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] [2020-02-10 20:13:36,068 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1131381302, now seen corresponding path program 217 times [2020-02-10 20:13:36,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212895222] [2020-02-10 20:13:36,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212895222] [2020-02-10 20:13:36,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:36,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108878841] [2020-02-10 20:13:36,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:36,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:36,362 INFO L87 Difference]: Start difference. First operand 385 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:13:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,471 INFO L93 Difference]: Finished difference Result 559 states and 1689 transitions. [2020-02-10 20:13:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:36,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,473 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:13:36,473 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:13:36,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:13:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 388. [2020-02-10 20:13:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 20:13:36,483 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,483 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 20:13:36,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 20:13:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:36,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,483 INFO L415 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] [2020-02-10 20:13:36,484 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash -314135708, now seen corresponding path program 218 times [2020-02-10 20:13:36,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103335641] [2020-02-10 20:13:36,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103335641] [2020-02-10 20:13:36,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:36,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152493418] [2020-02-10 20:13:36,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:36,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:36,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:36,779 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,867 INFO L93 Difference]: Finished difference Result 557 states and 1684 transitions. [2020-02-10 20:13:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:36,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,869 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:13:36,869 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:13:36,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:13:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 387. [2020-02-10 20:13:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-02-10 20:13:36,881 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-02-10 20:13:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,881 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-02-10 20:13:36,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-02-10 20:13:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:36,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,882 INFO L415 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] [2020-02-10 20:13:36,882 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,882 INFO L82 PathProgramCache]: Analyzing trace with hash -469056552, now seen corresponding path program 219 times [2020-02-10 20:13:36,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487169897] [2020-02-10 20:13:36,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487169897] [2020-02-10 20:13:37,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:37,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215436559] [2020-02-10 20:13:37,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:37,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:37,162 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:13:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,278 INFO L93 Difference]: Finished difference Result 561 states and 1693 transitions. [2020-02-10 20:13:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:37,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,280 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:13:37,280 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:13:37,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:13:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 389. [2020-02-10 20:13:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 20:13:37,289 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 20:13:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,289 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 20:13:37,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 20:13:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:37,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,290 INFO L415 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] [2020-02-10 20:13:37,290 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -215963800, now seen corresponding path program 220 times [2020-02-10 20:13:37,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054672640] [2020-02-10 20:13:37,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054672640] [2020-02-10 20:13:37,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:37,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158842184] [2020-02-10 20:13:37,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:37,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:37,597 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:13:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,733 INFO L93 Difference]: Finished difference Result 560 states and 1689 transitions. [2020-02-10 20:13:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:37,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,735 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:13:37,735 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:13:37,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:13:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 20:13:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-02-10 20:13:37,745 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,745 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-02-10 20:13:37,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-02-10 20:13:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:37,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,746 INFO L415 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] [2020-02-10 20:13:37,746 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 779955880, now seen corresponding path program 221 times [2020-02-10 20:13:37,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160561456] [2020-02-10 20:13:37,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160561456] [2020-02-10 20:13:38,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:38,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188231407] [2020-02-10 20:13:38,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:38,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,040 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,123 INFO L93 Difference]: Finished difference Result 556 states and 1681 transitions. [2020-02-10 20:13:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:38,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,125 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:13:38,125 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:13:38,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:13:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 388. [2020-02-10 20:13:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-02-10 20:13:38,136 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-02-10 20:13:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,136 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-02-10 20:13:38,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-02-10 20:13:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:38,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,137 INFO L415 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] [2020-02-10 20:13:38,137 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1904070458, now seen corresponding path program 222 times [2020-02-10 20:13:38,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179634523] [2020-02-10 20:13:38,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179634523] [2020-02-10 20:13:38,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:38,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932223880] [2020-02-10 20:13:38,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:38,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,421 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:13:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,537 INFO L93 Difference]: Finished difference Result 557 states and 1682 transitions. [2020-02-10 20:13:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:38,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,539 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:13:38,539 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:13:38,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:13:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 386. [2020-02-10 20:13:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:13:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1347 transitions. [2020-02-10 20:13:38,549 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1347 transitions. Word has length 22 [2020-02-10 20:13:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,549 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1347 transitions. [2020-02-10 20:13:38,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1347 transitions. [2020-02-10 20:13:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:38,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,550 INFO L415 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] [2020-02-10 20:13:38,550 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash 91145504, now seen corresponding path program 223 times [2020-02-10 20:13:38,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444825930] [2020-02-10 20:13:38,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444825930] [2020-02-10 20:13:38,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:38,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774137110] [2020-02-10 20:13:38,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,825 INFO L87 Difference]: Start difference. First operand 386 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:13:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,942 INFO L93 Difference]: Finished difference Result 563 states and 1697 transitions. [2020-02-10 20:13:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:38,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,944 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:13:38,944 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:13:38,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:13:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 388. [2020-02-10 20:13:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-02-10 20:13:38,954 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-02-10 20:13:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,955 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-02-10 20:13:38,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-02-10 20:13:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:38,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,956 INFO L415 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] [2020-02-10 20:13:38,956 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1354371506, now seen corresponding path program 224 times [2020-02-10 20:13:38,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815563904] [2020-02-10 20:13:38,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815563904] [2020-02-10 20:13:39,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:39,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736933539] [2020-02-10 20:13:39,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:39,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:39,242 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:13:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,338 INFO L93 Difference]: Finished difference Result 561 states and 1692 transitions. [2020-02-10 20:13:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:39,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,340 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:13:39,340 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:13:39,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:13:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 20:13:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-02-10 20:13:39,350 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,351 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-02-10 20:13:39,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-02-10 20:13:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:39,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,351 INFO L415 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] [2020-02-10 20:13:39,351 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2097037672, now seen corresponding path program 225 times [2020-02-10 20:13:39,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653906261] [2020-02-10 20:13:39,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653906261] [2020-02-10 20:13:39,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:39,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322230770] [2020-02-10 20:13:39,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:39,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:39,618 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,734 INFO L93 Difference]: Finished difference Result 569 states and 1710 transitions. [2020-02-10 20:13:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:39,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,736 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:13:39,736 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:13:39,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:13:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-02-10 20:13:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1354 transitions. [2020-02-10 20:13:39,748 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,748 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1354 transitions. [2020-02-10 20:13:39,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1354 transitions. [2020-02-10 20:13:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:39,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,749 INFO L415 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] [2020-02-10 20:13:39,750 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1415930382, now seen corresponding path program 226 times [2020-02-10 20:13:39,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700429581] [2020-02-10 20:13:39,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700429581] [2020-02-10 20:13:40,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:40,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153406116] [2020-02-10 20:13:40,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:40,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:40,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,032 INFO L87 Difference]: Start difference. First operand 390 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,155 INFO L93 Difference]: Finished difference Result 571 states and 1711 transitions. [2020-02-10 20:13:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:40,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,157 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:13:40,157 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:13:40,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:13:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 387. [2020-02-10 20:13:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-02-10 20:13:40,167 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-02-10 20:13:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,167 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-02-10 20:13:40,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-02-10 20:13:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:40,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,168 INFO L415 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] [2020-02-10 20:13:40,168 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash -848025240, now seen corresponding path program 227 times [2020-02-10 20:13:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624652042] [2020-02-10 20:13:40,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624652042] [2020-02-10 20:13:40,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:40,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927946469] [2020-02-10 20:13:40,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:40,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:40,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,439 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:13:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,530 INFO L93 Difference]: Finished difference Result 563 states and 1695 transitions. [2020-02-10 20:13:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:40,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,532 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:13:40,532 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:13:40,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:13:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 388. [2020-02-10 20:13:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 20:13:40,549 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,550 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 20:13:40,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 20:13:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:40,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,550 INFO L415 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] [2020-02-10 20:13:40,550 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1298145520, now seen corresponding path program 228 times [2020-02-10 20:13:40,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275794105] [2020-02-10 20:13:40,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275794105] [2020-02-10 20:13:40,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:40,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126067282] [2020-02-10 20:13:40,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:40,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,830 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,934 INFO L93 Difference]: Finished difference Result 567 states and 1702 transitions. [2020-02-10 20:13:40,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:40,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,935 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:13:40,936 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:13:40,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:13:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 386. [2020-02-10 20:13:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:13:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1346 transitions. [2020-02-10 20:13:40,945 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1346 transitions. Word has length 22 [2020-02-10 20:13:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,945 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1346 transitions. [2020-02-10 20:13:40,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1346 transitions. [2020-02-10 20:13:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:40,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,946 INFO L415 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] [2020-02-10 20:13:40,946 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 416741728, now seen corresponding path program 229 times [2020-02-10 20:13:40,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935864605] [2020-02-10 20:13:40,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935864605] [2020-02-10 20:13:41,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:41,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705017485] [2020-02-10 20:13:41,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:41,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:41,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:41,221 INFO L87 Difference]: Start difference. First operand 386 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:13:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,335 INFO L93 Difference]: Finished difference Result 569 states and 1713 transitions. [2020-02-10 20:13:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:41,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,337 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:13:41,337 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:13:41,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:13:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-02-10 20:13:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1356 transitions. [2020-02-10 20:13:41,347 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,347 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1356 transitions. [2020-02-10 20:13:41,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1356 transitions. [2020-02-10 20:13:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:41,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,348 INFO L415 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] [2020-02-10 20:13:41,348 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash 669834480, now seen corresponding path program 230 times [2020-02-10 20:13:41,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689241900] [2020-02-10 20:13:41,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689241900] [2020-02-10 20:13:41,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:41,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825131834] [2020-02-10 20:13:41,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:41,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:41,628 INFO L87 Difference]: Start difference. First operand 390 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,745 INFO L93 Difference]: Finished difference Result 568 states and 1709 transitions. [2020-02-10 20:13:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:41,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,747 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:13:41,747 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:13:41,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:13:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 388. [2020-02-10 20:13:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-02-10 20:13:41,756 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-02-10 20:13:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,756 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-02-10 20:13:41,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-02-10 20:13:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:41,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,757 INFO L415 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] [2020-02-10 20:13:41,757 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash -171003594, now seen corresponding path program 231 times [2020-02-10 20:13:41,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587731647] [2020-02-10 20:13:41,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587731647] [2020-02-10 20:13:42,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:42,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544352843] [2020-02-10 20:13:42,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:42,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:42,024 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:13:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,125 INFO L93 Difference]: Finished difference Result 573 states and 1720 transitions. [2020-02-10 20:13:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:42,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,127 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:13:42,127 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:13:42,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:13:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 391. [2020-02-10 20:13:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 20:13:42,139 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 20:13:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,139 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 20:13:42,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 20:13:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:42,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,140 INFO L415 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] [2020-02-10 20:13:42,141 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -953002836, now seen corresponding path program 232 times [2020-02-10 20:13:42,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405745712] [2020-02-10 20:13:42,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405745712] [2020-02-10 20:13:42,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:42,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086086538] [2020-02-10 20:13:42,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:42,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:42,415 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:13:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,527 INFO L93 Difference]: Finished difference Result 575 states and 1721 transitions. [2020-02-10 20:13:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:42,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,529 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:13:42,529 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:13:42,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:13:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-02-10 20:13:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 20:13:42,539 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,539 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 20:13:42,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 20:13:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:42,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,540 INFO L415 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] [2020-02-10 20:13:42,540 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,540 INFO L82 PathProgramCache]: Analyzing trace with hash 149930832, now seen corresponding path program 233 times [2020-02-10 20:13:42,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71877750] [2020-02-10 20:13:42,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71877750] [2020-02-10 20:13:42,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:42,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558087640] [2020-02-10 20:13:42,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:42,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:42,821 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,944 INFO L93 Difference]: Finished difference Result 570 states and 1711 transitions. [2020-02-10 20:13:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:42,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,946 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:13:42,946 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:13:42,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:13:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-02-10 20:13:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 20:13:42,956 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 20:13:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,956 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 20:13:42,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 20:13:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:42,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,956 INFO L415 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] [2020-02-10 20:13:42,957 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash 721385638, now seen corresponding path program 234 times [2020-02-10 20:13:42,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923848262] [2020-02-10 20:13:42,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923848262] [2020-02-10 20:13:43,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:43,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033119709] [2020-02-10 20:13:43,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:43,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:43,233 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:13:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,350 INFO L93 Difference]: Finished difference Result 573 states and 1715 transitions. [2020-02-10 20:13:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:43,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,352 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:13:43,352 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:13:43,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:13:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2020-02-10 20:13:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:13:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1345 transitions. [2020-02-10 20:13:43,361 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1345 transitions. Word has length 22 [2020-02-10 20:13:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,361 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1345 transitions. [2020-02-10 20:13:43,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1345 transitions. [2020-02-10 20:13:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:43,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,362 INFO L415 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] [2020-02-10 20:13:43,362 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash -703179058, now seen corresponding path program 235 times [2020-02-10 20:13:43,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494511478] [2020-02-10 20:13:43,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494511478] [2020-02-10 20:13:43,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:43,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306987231] [2020-02-10 20:13:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:43,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:43,663 INFO L87 Difference]: Start difference. First operand 386 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:13:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,755 INFO L93 Difference]: Finished difference Result 558 states and 1684 transitions. [2020-02-10 20:13:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:43,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,756 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:13:43,756 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:13:43,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:13:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 388. [2020-02-10 20:13:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 20:13:43,767 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,767 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 20:13:43,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 20:13:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:43,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,768 INFO L415 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] [2020-02-10 20:13:43,768 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash 907761900, now seen corresponding path program 236 times [2020-02-10 20:13:43,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908021683] [2020-02-10 20:13:43,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908021683] [2020-02-10 20:13:44,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:44,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746912499] [2020-02-10 20:13:44,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:44,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:44,051 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,157 INFO L93 Difference]: Finished difference Result 559 states and 1685 transitions. [2020-02-10 20:13:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:44,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,159 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:13:44,159 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:13:44,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:13:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 20:13:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1347 transitions. [2020-02-10 20:13:44,169 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1347 transitions. Word has length 22 [2020-02-10 20:13:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,169 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1347 transitions. [2020-02-10 20:13:44,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1347 transitions. [2020-02-10 20:13:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:44,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,170 INFO L415 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] [2020-02-10 20:13:44,170 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1290924380, now seen corresponding path program 237 times [2020-02-10 20:13:44,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760101367] [2020-02-10 20:13:44,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760101367] [2020-02-10 20:13:44,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:44,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979076866] [2020-02-10 20:13:44,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:44,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:44,453 INFO L87 Difference]: Start difference. First operand 387 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:13:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,535 INFO L93 Difference]: Finished difference Result 561 states and 1689 transitions. [2020-02-10 20:13:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:44,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,536 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:13:44,536 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:13:44,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:13:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 388. [2020-02-10 20:13:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:13:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1348 transitions. [2020-02-10 20:13:44,545 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1348 transitions. Word has length 22 [2020-02-10 20:13:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,545 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1348 transitions. [2020-02-10 20:13:44,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1348 transitions. [2020-02-10 20:13:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:44,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,546 INFO L415 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] [2020-02-10 20:13:44,546 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 855246380, now seen corresponding path program 238 times [2020-02-10 20:13:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279071648] [2020-02-10 20:13:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279071648] [2020-02-10 20:13:44,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:44,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259537415] [2020-02-10 20:13:44,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:44,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:44,845 INFO L87 Difference]: Start difference. First operand 388 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:13:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,948 INFO L93 Difference]: Finished difference Result 565 states and 1696 transitions. [2020-02-10 20:13:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:44,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,950 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:13:44,950 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:13:44,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:13:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 20:13:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1346 transitions. [2020-02-10 20:13:44,960 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1346 transitions. Word has length 22 [2020-02-10 20:13:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,960 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1346 transitions. [2020-02-10 20:13:44,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1346 transitions. [2020-02-10 20:13:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:44,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,961 INFO L415 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] [2020-02-10 20:13:44,961 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1280421276, now seen corresponding path program 239 times [2020-02-10 20:13:44,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507215040] [2020-02-10 20:13:44,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507215040] [2020-02-10 20:13:45,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:45,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423083552] [2020-02-10 20:13:45,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:45,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:45,241 INFO L87 Difference]: Start difference. First operand 387 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:13:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,359 INFO L93 Difference]: Finished difference Result 564 states and 1695 transitions. [2020-02-10 20:13:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:45,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,361 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:13:45,361 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:13:45,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:13:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 389. [2020-02-10 20:13:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-02-10 20:13:45,373 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-02-10 20:13:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,374 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-02-10 20:13:45,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-02-10 20:13:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:45,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,375 INFO L415 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] [2020-02-10 20:13:45,375 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash -745191474, now seen corresponding path program 240 times [2020-02-10 20:13:45,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399267101] [2020-02-10 20:13:45,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399267101] [2020-02-10 20:13:45,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:45,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676039496] [2020-02-10 20:13:45,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:45,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:45,646 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:13:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,764 INFO L93 Difference]: Finished difference Result 567 states and 1699 transitions. [2020-02-10 20:13:45,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:45,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,766 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:13:45,766 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:13:45,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:13:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 20:13:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:13:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1340 transitions. [2020-02-10 20:13:45,776 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1340 transitions. Word has length 22 [2020-02-10 20:13:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,776 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1340 transitions. [2020-02-10 20:13:45,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1340 transitions. [2020-02-10 20:13:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:45,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,777 INFO L415 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] [2020-02-10 20:13:45,777 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -39183836, now seen corresponding path program 241 times [2020-02-10 20:13:45,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438303346] [2020-02-10 20:13:45,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438303346] [2020-02-10 20:13:46,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:46,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223215564] [2020-02-10 20:13:46,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:46,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,050 INFO L87 Difference]: Start difference. First operand 383 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:13:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,149 INFO L93 Difference]: Finished difference Result 638 states and 1890 transitions. [2020-02-10 20:13:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:46,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,151 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:13:46,151 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:13:46,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:13:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 396. [2020-02-10 20:13:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:13:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1380 transitions. [2020-02-10 20:13:46,161 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1380 transitions. Word has length 22 [2020-02-10 20:13:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,161 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1380 transitions. [2020-02-10 20:13:46,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1380 transitions. [2020-02-10 20:13:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:46,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,162 INFO L415 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] [2020-02-10 20:13:46,162 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1551082050, now seen corresponding path program 242 times [2020-02-10 20:13:46,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74159766] [2020-02-10 20:13:46,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74159766] [2020-02-10 20:13:46,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:46,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779687299] [2020-02-10 20:13:46,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:46,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,436 INFO L87 Difference]: Start difference. First operand 396 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:13:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,542 INFO L93 Difference]: Finished difference Result 633 states and 1877 transitions. [2020-02-10 20:13:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:46,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,544 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:13:46,544 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:13:46,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:13:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 392. [2020-02-10 20:13:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1372 transitions. [2020-02-10 20:13:46,554 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1372 transitions. Word has length 22 [2020-02-10 20:13:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,554 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1372 transitions. [2020-02-10 20:13:46,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1372 transitions. [2020-02-10 20:13:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:46,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,554 INFO L415 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] [2020-02-10 20:13:46,555 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1313366484, now seen corresponding path program 243 times [2020-02-10 20:13:46,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635488097] [2020-02-10 20:13:46,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635488097] [2020-02-10 20:13:46,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:46,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396199843] [2020-02-10 20:13:46,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:46,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,827 INFO L87 Difference]: Start difference. First operand 392 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:13:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,909 INFO L93 Difference]: Finished difference Result 634 states and 1878 transitions. [2020-02-10 20:13:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:46,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,910 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:13:46,911 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:13:46,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:13:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 394. [2020-02-10 20:13:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1374 transitions. [2020-02-10 20:13:46,920 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1374 transitions. Word has length 22 [2020-02-10 20:13:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,920 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1374 transitions. [2020-02-10 20:13:46,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1374 transitions. [2020-02-10 20:13:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:46,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,921 INFO L415 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] [2020-02-10 20:13:46,921 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1874434976, now seen corresponding path program 244 times [2020-02-10 20:13:46,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765152651] [2020-02-10 20:13:46,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765152651] [2020-02-10 20:13:47,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:47,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467029974] [2020-02-10 20:13:47,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:47,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:47,200 INFO L87 Difference]: Start difference. First operand 394 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:13:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,296 INFO L93 Difference]: Finished difference Result 627 states and 1863 transitions. [2020-02-10 20:13:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:47,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,298 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:13:47,298 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:13:47,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:13:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 392. [2020-02-10 20:13:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1370 transitions. [2020-02-10 20:13:47,309 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1370 transitions. Word has length 22 [2020-02-10 20:13:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,309 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1370 transitions. [2020-02-10 20:13:47,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1370 transitions. [2020-02-10 20:13:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:47,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,310 INFO L415 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] [2020-02-10 20:13:47,310 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash 119076278, now seen corresponding path program 245 times [2020-02-10 20:13:47,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9663240] [2020-02-10 20:13:47,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9663240] [2020-02-10 20:13:47,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:47,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084784839] [2020-02-10 20:13:47,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:47,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:47,580 INFO L87 Difference]: Start difference. First operand 392 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:13:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,692 INFO L93 Difference]: Finished difference Result 623 states and 1856 transitions. [2020-02-10 20:13:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:47,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,694 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:13:47,694 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:13:47,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:13:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 20:13:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1371 transitions. [2020-02-10 20:13:47,704 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1371 transitions. Word has length 22 [2020-02-10 20:13:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,704 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1371 transitions. [2020-02-10 20:13:47,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1371 transitions. [2020-02-10 20:13:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:47,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,705 INFO L415 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] [2020-02-10 20:13:47,705 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1326440732, now seen corresponding path program 246 times [2020-02-10 20:13:47,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293097693] [2020-02-10 20:13:47,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293097693] [2020-02-10 20:13:47,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:47,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776539228] [2020-02-10 20:13:47,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:47,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:47,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:47,984 INFO L87 Difference]: Start difference. First operand 393 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:13:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,066 INFO L93 Difference]: Finished difference Result 621 states and 1851 transitions. [2020-02-10 20:13:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:48,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,068 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:13:48,068 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:13:48,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:13:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 390. [2020-02-10 20:13:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1366 transitions. [2020-02-10 20:13:48,077 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,077 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1366 transitions. [2020-02-10 20:13:48,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1366 transitions. [2020-02-10 20:13:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:48,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,078 INFO L415 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] [2020-02-10 20:13:48,078 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1799236776, now seen corresponding path program 247 times [2020-02-10 20:13:48,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788690205] [2020-02-10 20:13:48,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:48,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788690205] [2020-02-10 20:13:48,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:48,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810948622] [2020-02-10 20:13:48,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:48,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:48,356 INFO L87 Difference]: Start difference. First operand 390 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:13:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,445 INFO L93 Difference]: Finished difference Result 654 states and 1930 transitions. [2020-02-10 20:13:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:48,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,447 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:13:48,447 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:13:48,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:13:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 399. [2020-02-10 20:13:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:13:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1388 transitions. [2020-02-10 20:13:48,457 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1388 transitions. Word has length 22 [2020-02-10 20:13:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,458 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1388 transitions. [2020-02-10 20:13:48,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1388 transitions. [2020-02-10 20:13:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:48,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,458 INFO L415 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] [2020-02-10 20:13:48,458 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash -208970890, now seen corresponding path program 248 times [2020-02-10 20:13:48,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937616040] [2020-02-10 20:13:48,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:48,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937616040] [2020-02-10 20:13:48,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:48,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737683996] [2020-02-10 20:13:48,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:48,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:48,731 INFO L87 Difference]: Start difference. First operand 399 states and 1388 transitions. Second operand 9 states. [2020-02-10 20:13:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,852 INFO L93 Difference]: Finished difference Result 649 states and 1917 transitions. [2020-02-10 20:13:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:48,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,854 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:13:48,854 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:13:48,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:13:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 395. [2020-02-10 20:13:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1378 transitions. [2020-02-10 20:13:48,866 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1378 transitions. Word has length 22 [2020-02-10 20:13:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,867 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1378 transitions. [2020-02-10 20:13:48,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1378 transitions. [2020-02-10 20:13:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:48,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,867 INFO L415 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] [2020-02-10 20:13:48,868 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1534185912, now seen corresponding path program 249 times [2020-02-10 20:13:48,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895583473] [2020-02-10 20:13:48,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895583473] [2020-02-10 20:13:49,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:49,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062539502] [2020-02-10 20:13:49,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:49,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:49,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,149 INFO L87 Difference]: Start difference. First operand 395 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:13:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,233 INFO L93 Difference]: Finished difference Result 661 states and 1942 transitions. [2020-02-10 20:13:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:49,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,235 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:13:49,236 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:13:49,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:13:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 403. [2020-02-10 20:13:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 20:13:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1391 transitions. [2020-02-10 20:13:49,246 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1391 transitions. Word has length 22 [2020-02-10 20:13:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,246 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1391 transitions. [2020-02-10 20:13:49,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1391 transitions. [2020-02-10 20:13:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:49,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,247 INFO L415 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] [2020-02-10 20:13:49,247 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1263209834, now seen corresponding path program 250 times [2020-02-10 20:13:49,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513890961] [2020-02-10 20:13:49,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513890961] [2020-02-10 20:13:49,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:49,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743539004] [2020-02-10 20:13:49,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:49,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:49,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,532 INFO L87 Difference]: Start difference. First operand 403 states and 1391 transitions. Second operand 9 states. [2020-02-10 20:13:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,657 INFO L93 Difference]: Finished difference Result 659 states and 1932 transitions. [2020-02-10 20:13:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:49,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,660 INFO L225 Difference]: With dead ends: 659 [2020-02-10 20:13:49,661 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:13:49,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:13:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 395. [2020-02-10 20:13:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1373 transitions. [2020-02-10 20:13:49,673 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1373 transitions. Word has length 22 [2020-02-10 20:13:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,673 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1373 transitions. [2020-02-10 20:13:49,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1373 transitions. [2020-02-10 20:13:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:49,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,674 INFO L415 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] [2020-02-10 20:13:49,674 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1545484970, now seen corresponding path program 251 times [2020-02-10 20:13:49,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421319470] [2020-02-10 20:13:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421319470] [2020-02-10 20:13:49,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:49,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491472611] [2020-02-10 20:13:49,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:49,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,949 INFO L87 Difference]: Start difference. First operand 395 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:13:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,053 INFO L93 Difference]: Finished difference Result 646 states and 1907 transitions. [2020-02-10 20:13:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:50,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,055 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:13:50,055 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:13:50,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:13:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 398. [2020-02-10 20:13:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:13:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1378 transitions. [2020-02-10 20:13:50,065 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1378 transitions. Word has length 22 [2020-02-10 20:13:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,065 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1378 transitions. [2020-02-10 20:13:50,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1378 transitions. [2020-02-10 20:13:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:50,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,066 INFO L415 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] [2020-02-10 20:13:50,066 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1563918996, now seen corresponding path program 252 times [2020-02-10 20:13:50,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610504272] [2020-02-10 20:13:50,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610504272] [2020-02-10 20:13:50,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226269664] [2020-02-10 20:13:50,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:50,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:50,343 INFO L87 Difference]: Start difference. First operand 398 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:13:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,453 INFO L93 Difference]: Finished difference Result 649 states and 1910 transitions. [2020-02-10 20:13:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:50,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,455 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:13:50,455 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:13:50,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:13:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 390. [2020-02-10 20:13:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 20:13:50,466 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 20:13:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,466 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 20:13:50,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 20:13:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:50,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,467 INFO L415 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] [2020-02-10 20:13:50,467 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash -640125292, now seen corresponding path program 253 times [2020-02-10 20:13:50,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473029804] [2020-02-10 20:13:50,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473029804] [2020-02-10 20:13:50,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:50,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987702862] [2020-02-10 20:13:50,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:50,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:50,725 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:13:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,813 INFO L93 Difference]: Finished difference Result 642 states and 1893 transitions. [2020-02-10 20:13:50,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:50,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,815 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:13:50,815 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:13:50,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:13:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 395. [2020-02-10 20:13:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1373 transitions. [2020-02-10 20:13:50,827 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1373 transitions. Word has length 22 [2020-02-10 20:13:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,827 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1373 transitions. [2020-02-10 20:13:50,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1373 transitions. [2020-02-10 20:13:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:50,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,827 INFO L415 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] [2020-02-10 20:13:50,828 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash -79056800, now seen corresponding path program 254 times [2020-02-10 20:13:50,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344400621] [2020-02-10 20:13:50,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344400621] [2020-02-10 20:13:51,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:51,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373803996] [2020-02-10 20:13:51,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:51,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:51,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,087 INFO L87 Difference]: Start difference. First operand 395 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:13:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,165 INFO L93 Difference]: Finished difference Result 635 states and 1878 transitions. [2020-02-10 20:13:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:51,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,167 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:13:51,167 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:13:51,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:13:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-02-10 20:13:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1369 transitions. [2020-02-10 20:13:51,176 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1369 transitions. Word has length 22 [2020-02-10 20:13:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,176 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1369 transitions. [2020-02-10 20:13:51,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1369 transitions. [2020-02-10 20:13:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:51,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,177 INFO L415 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] [2020-02-10 20:13:51,177 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 372567240, now seen corresponding path program 255 times [2020-02-10 20:13:51,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255925883] [2020-02-10 20:13:51,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255925883] [2020-02-10 20:13:51,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:51,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899540616] [2020-02-10 20:13:51,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:51,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,471 INFO L87 Difference]: Start difference. First operand 393 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:13:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,567 INFO L93 Difference]: Finished difference Result 653 states and 1917 transitions. [2020-02-10 20:13:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:51,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,569 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:13:51,569 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:13:51,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:13:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 401. [2020-02-10 20:13:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:13:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1382 transitions. [2020-02-10 20:13:51,578 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1382 transitions. Word has length 22 [2020-02-10 20:13:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,579 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1382 transitions. [2020-02-10 20:13:51,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1382 transitions. [2020-02-10 20:13:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:51,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,579 INFO L415 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] [2020-02-10 20:13:51,579 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash 242596794, now seen corresponding path program 256 times [2020-02-10 20:13:51,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342887896] [2020-02-10 20:13:51,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342887896] [2020-02-10 20:13:51,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:51,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894946071] [2020-02-10 20:13:51,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:51,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,848 INFO L87 Difference]: Start difference. First operand 401 states and 1382 transitions. Second operand 9 states. [2020-02-10 20:13:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,947 INFO L93 Difference]: Finished difference Result 651 states and 1907 transitions. [2020-02-10 20:13:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:51,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,949 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:13:51,949 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:13:51,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:13:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 393. [2020-02-10 20:13:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 20:13:51,959 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,959 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 20:13:51,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 20:13:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:51,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,959 INFO L415 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] [2020-02-10 20:13:51,960 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash 427289466, now seen corresponding path program 257 times [2020-02-10 20:13:51,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872895467] [2020-02-10 20:13:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872895467] [2020-02-10 20:13:52,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:52,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081231910] [2020-02-10 20:13:52,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:52,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:52,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:52,222 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:13:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,306 INFO L93 Difference]: Finished difference Result 632 states and 1870 transitions. [2020-02-10 20:13:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:52,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,308 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:13:52,308 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:13:52,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:13:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 394. [2020-02-10 20:13:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 20:13:52,317 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 20:13:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,317 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 20:13:52,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 20:13:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:52,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,318 INFO L415 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] [2020-02-10 20:13:52,318 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash -648421690, now seen corresponding path program 258 times [2020-02-10 20:13:52,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518729027] [2020-02-10 20:13:52,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518729027] [2020-02-10 20:13:52,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:52,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992621493] [2020-02-10 20:13:52,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:52,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:52,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:52,573 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:13:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,677 INFO L93 Difference]: Finished difference Result 637 states and 1879 transitions. [2020-02-10 20:13:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:52,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,679 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:13:52,679 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:13:52,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:13:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 20:13:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:13:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1360 transitions. [2020-02-10 20:13:52,690 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1360 transitions. Word has length 22 [2020-02-10 20:13:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,690 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1360 transitions. [2020-02-10 20:13:52,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1360 transitions. [2020-02-10 20:13:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:52,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,690 INFO L415 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] [2020-02-10 20:13:52,691 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2017652658, now seen corresponding path program 259 times [2020-02-10 20:13:52,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693458309] [2020-02-10 20:13:52,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693458309] [2020-02-10 20:13:52,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:52,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164280168] [2020-02-10 20:13:52,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:52,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:52,965 INFO L87 Difference]: Start difference. First operand 390 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:13:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,078 INFO L93 Difference]: Finished difference Result 618 states and 1842 transitions. [2020-02-10 20:13:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:53,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,080 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:13:53,081 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:13:53,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:13:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2020-02-10 20:13:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 20:13:53,090 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,090 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 20:13:53,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 20:13:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:53,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,091 INFO L415 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] [2020-02-10 20:13:53,091 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash 572135648, now seen corresponding path program 260 times [2020-02-10 20:13:53,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212159504] [2020-02-10 20:13:53,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:53,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212159504] [2020-02-10 20:13:53,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:53,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251102025] [2020-02-10 20:13:53,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:53,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:53,372 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,460 INFO L93 Difference]: Finished difference Result 616 states and 1837 transitions. [2020-02-10 20:13:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:53,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,462 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:13:53,462 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:13:53,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:13:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2020-02-10 20:13:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:13:53,471 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,471 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:13:53,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:13:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:53,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,472 INFO L415 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] [2020-02-10 20:13:53,472 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1264622106, now seen corresponding path program 261 times [2020-02-10 20:13:53,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647802044] [2020-02-10 20:13:53,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:53,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647802044] [2020-02-10 20:13:53,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:53,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233680726] [2020-02-10 20:13:53,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:53,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:53,750 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,867 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-02-10 20:13:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:53,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,869 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:13:53,869 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:13:53,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:13:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2020-02-10 20:13:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:13:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 20:13:53,879 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 20:13:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,879 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 20:13:53,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 20:13:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:53,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,880 INFO L415 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] [2020-02-10 20:13:53,880 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash 121413024, now seen corresponding path program 262 times [2020-02-10 20:13:53,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772011744] [2020-02-10 20:13:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772011744] [2020-02-10 20:13:54,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:54,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665825616] [2020-02-10 20:13:54,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:54,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:54,144 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:13:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,269 INFO L93 Difference]: Finished difference Result 628 states and 1860 transitions. [2020-02-10 20:13:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:54,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,271 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:13:54,271 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:13:54,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:13:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 391. [2020-02-10 20:13:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1361 transitions. [2020-02-10 20:13:54,281 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1361 transitions. Word has length 22 [2020-02-10 20:13:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,281 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1361 transitions. [2020-02-10 20:13:54,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1361 transitions. [2020-02-10 20:13:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:54,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,282 INFO L415 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] [2020-02-10 20:13:54,282 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash -15609674, now seen corresponding path program 263 times [2020-02-10 20:13:54,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58605573] [2020-02-10 20:13:54,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58605573] [2020-02-10 20:13:54,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:54,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556483947] [2020-02-10 20:13:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:54,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:54,551 INFO L87 Difference]: Start difference. First operand 391 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:13:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,651 INFO L93 Difference]: Finished difference Result 619 states and 1842 transitions. [2020-02-10 20:13:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:54,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,653 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:13:54,653 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:13:54,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:13:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-02-10 20:13:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 20:13:54,664 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 20:13:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,665 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 20:13:54,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 20:13:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:54,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,665 INFO L415 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] [2020-02-10 20:13:54,665 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1091320830, now seen corresponding path program 264 times [2020-02-10 20:13:54,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270047601] [2020-02-10 20:13:54,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270047601] [2020-02-10 20:13:54,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:54,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92479277] [2020-02-10 20:13:54,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:54,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:54,926 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:13:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,035 INFO L93 Difference]: Finished difference Result 624 states and 1851 transitions. [2020-02-10 20:13:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:55,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,037 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:13:55,037 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:13:55,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:13:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 387. [2020-02-10 20:13:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:13:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-02-10 20:13:55,046 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-02-10 20:13:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,046 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-02-10 20:13:55,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-02-10 20:13:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:55,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,047 INFO L415 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] [2020-02-10 20:13:55,047 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash -463495072, now seen corresponding path program 265 times [2020-02-10 20:13:55,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208315591] [2020-02-10 20:13:55,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208315591] [2020-02-10 20:13:55,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:55,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776483144] [2020-02-10 20:13:55,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:55,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:55,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:55,332 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:13:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,413 INFO L93 Difference]: Finished difference Result 632 states and 1874 transitions. [2020-02-10 20:13:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:55,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,415 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:13:55,415 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:13:55,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:13:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 395. [2020-02-10 20:13:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:13:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1374 transitions. [2020-02-10 20:13:55,425 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1374 transitions. Word has length 22 [2020-02-10 20:13:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,425 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1374 transitions. [2020-02-10 20:13:55,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1374 transitions. [2020-02-10 20:13:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:55,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,426 INFO L415 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] [2020-02-10 20:13:55,426 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1126770814, now seen corresponding path program 266 times [2020-02-10 20:13:55,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874942972] [2020-02-10 20:13:55,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874942972] [2020-02-10 20:13:55,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:55,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568586604] [2020-02-10 20:13:55,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:55,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:55,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:55,678 INFO L87 Difference]: Start difference. First operand 395 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:13:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,801 INFO L93 Difference]: Finished difference Result 627 states and 1861 transitions. [2020-02-10 20:13:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:55,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,803 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:13:55,803 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:13:55,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:13:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 391. [2020-02-10 20:13:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 20:13:55,813 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,813 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 20:13:55,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 20:13:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:55,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,814 INFO L415 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] [2020-02-10 20:13:55,814 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 889055248, now seen corresponding path program 267 times [2020-02-10 20:13:55,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143030554] [2020-02-10 20:13:55,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143030554] [2020-02-10 20:13:56,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:56,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464116884] [2020-02-10 20:13:56,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:56,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:56,062 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:13:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,146 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-02-10 20:13:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:56,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,147 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:13:56,148 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:13:56,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:13:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 20:13:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1368 transitions. [2020-02-10 20:13:56,160 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1368 transitions. Word has length 22 [2020-02-10 20:13:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,160 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1368 transitions. [2020-02-10 20:13:56,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1368 transitions. [2020-02-10 20:13:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:56,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,161 INFO L415 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] [2020-02-10 20:13:56,161 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1450123740, now seen corresponding path program 268 times [2020-02-10 20:13:56,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022007361] [2020-02-10 20:13:56,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022007361] [2020-02-10 20:13:56,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:56,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865452266] [2020-02-10 20:13:56,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:56,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:56,421 INFO L87 Difference]: Start difference. First operand 393 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:13:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,520 INFO L93 Difference]: Finished difference Result 621 states and 1847 transitions. [2020-02-10 20:13:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:56,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,522 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:13:56,522 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:13:56,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:13:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 391. [2020-02-10 20:13:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:13:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 20:13:56,532 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 20:13:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,532 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 20:13:56,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 20:13:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:56,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,533 INFO L415 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] [2020-02-10 20:13:56,533 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash -305234958, now seen corresponding path program 269 times [2020-02-10 20:13:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078994250] [2020-02-10 20:13:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078994250] [2020-02-10 20:13:56,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:56,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598014437] [2020-02-10 20:13:56,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:56,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:56,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:56,794 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:13:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,910 INFO L93 Difference]: Finished difference Result 617 states and 1840 transitions. [2020-02-10 20:13:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:56,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,912 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:13:56,912 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:13:56,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:13:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 392. [2020-02-10 20:13:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:13:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-02-10 20:13:56,922 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-02-10 20:13:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,922 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-02-10 20:13:56,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-02-10 20:13:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:56,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,923 INFO L415 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] [2020-02-10 20:13:56,923 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1750751968, now seen corresponding path program 270 times [2020-02-10 20:13:56,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947590844] [2020-02-10 20:13:56,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947590844] [2020-02-10 20:13:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002623770] [2020-02-10 20:13:57,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:57,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,179 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:13:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,263 INFO L93 Difference]: Finished difference Result 615 states and 1835 transitions. [2020-02-10 20:13:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:57,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,265 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:13:57,265 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:13:57,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:13:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 389. [2020-02-10 20:13:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 20:13:57,274 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 20:13:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,274 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 20:13:57,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 20:13:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:57,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,275 INFO L415 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] [2020-02-10 20:13:57,275 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1226447832, now seen corresponding path program 271 times [2020-02-10 20:13:57,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383566921] [2020-02-10 20:13:57,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383566921] [2020-02-10 20:13:57,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:57,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055194939] [2020-02-10 20:13:57,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:57,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,530 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:13:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,622 INFO L93 Difference]: Finished difference Result 644 states and 1906 transitions. [2020-02-10 20:13:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:57,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,624 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:13:57,624 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:13:57,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:13:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 397. [2020-02-10 20:13:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:13:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1380 transitions. [2020-02-10 20:13:57,634 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1380 transitions. Word has length 22 [2020-02-10 20:13:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,634 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1380 transitions. [2020-02-10 20:13:57,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1380 transitions. [2020-02-10 20:13:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:57,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,635 INFO L415 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] [2020-02-10 20:13:57,635 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1478253578, now seen corresponding path program 272 times [2020-02-10 20:13:57,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469632746] [2020-02-10 20:13:57,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469632746] [2020-02-10 20:13:57,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:57,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040466422] [2020-02-10 20:13:57,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:57,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:57,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,887 INFO L87 Difference]: Start difference. First operand 397 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:13:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,000 INFO L93 Difference]: Finished difference Result 639 states and 1893 transitions. [2020-02-10 20:13:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:58,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,001 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:13:58,002 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:13:58,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:13:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-02-10 20:13:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 20:13:58,011 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 20:13:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,011 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 20:13:58,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 20:13:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:58,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,012 INFO L415 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] [2020-02-10 20:13:58,012 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1735956536, now seen corresponding path program 273 times [2020-02-10 20:13:58,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147390861] [2020-02-10 20:13:58,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147390861] [2020-02-10 20:13:58,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:58,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113327246] [2020-02-10 20:13:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:58,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:58,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:58,268 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:13:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,346 INFO L93 Difference]: Finished difference Result 648 states and 1912 transitions. [2020-02-10 20:13:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:58,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,348 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:13:58,348 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:13:58,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:13:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 399. [2020-02-10 20:13:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:13:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1380 transitions. [2020-02-10 20:13:58,357 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1380 transitions. Word has length 22 [2020-02-10 20:13:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,357 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1380 transitions. [2020-02-10 20:13:58,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1380 transitions. [2020-02-10 20:13:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:58,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,358 INFO L415 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] [2020-02-10 20:13:58,358 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 967910732, now seen corresponding path program 274 times [2020-02-10 20:13:58,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924303598] [2020-02-10 20:13:58,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924303598] [2020-02-10 20:13:58,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:58,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296076206] [2020-02-10 20:13:58,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:58,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:58,635 INFO L87 Difference]: Start difference. First operand 399 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:13:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,774 INFO L93 Difference]: Finished difference Result 645 states and 1901 transitions. [2020-02-10 20:13:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:58,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,776 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:13:58,776 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:13:58,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:13:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2020-02-10 20:13:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 20:13:58,785 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,786 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 20:13:58,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 20:13:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:58,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,786 INFO L415 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] [2020-02-10 20:13:58,786 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1343714346, now seen corresponding path program 275 times [2020-02-10 20:13:58,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976660612] [2020-02-10 20:13:58,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976660612] [2020-02-10 20:13:59,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:59,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587392052] [2020-02-10 20:13:59,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:59,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:59,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,046 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:13:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,157 INFO L93 Difference]: Finished difference Result 635 states and 1882 transitions. [2020-02-10 20:13:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:59,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,159 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:13:59,159 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:13:59,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:13:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 396. [2020-02-10 20:13:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:13:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-02-10 20:13:59,169 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-02-10 20:13:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,169 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-02-10 20:13:59,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-02-10 20:13:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:59,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,170 INFO L415 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] [2020-02-10 20:13:59,170 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1222205616, now seen corresponding path program 276 times [2020-02-10 20:13:59,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860799959] [2020-02-10 20:13:59,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860799959] [2020-02-10 20:13:59,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:59,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824889612] [2020-02-10 20:13:59,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:59,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,423 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:13:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,528 INFO L93 Difference]: Finished difference Result 637 states and 1883 transitions. [2020-02-10 20:13:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:59,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,530 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:13:59,530 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:13:59,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:13:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 389. [2020-02-10 20:13:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:13:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 20:13:59,540 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 20:13:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,540 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 20:13:59,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 20:13:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:59,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,540 INFO L415 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] [2020-02-10 20:13:59,541 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1942660176, now seen corresponding path program 277 times [2020-02-10 20:13:59,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68854228] [2020-02-10 20:13:59,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68854228] [2020-02-10 20:13:59,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:13:59,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813075323] [2020-02-10 20:13:59,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:13:59,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:13:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,796 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:13:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,878 INFO L93 Difference]: Finished difference Result 632 states and 1870 transitions. [2020-02-10 20:13:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:13:59,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:13:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,880 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:13:59,880 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:13:59,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:13:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 393. [2020-02-10 20:13:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:13:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 20:13:59,889 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 20:13:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,889 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 20:13:59,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:13:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 20:13:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:13:59,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,890 INFO L415 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] [2020-02-10 20:13:59,890 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1791238628, now seen corresponding path program 278 times [2020-02-10 20:13:59,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165056708] [2020-02-10 20:13:59,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165056708] [2020-02-10 20:14:00,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:00,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825322200] [2020-02-10 20:14:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:00,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,157 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:14:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,240 INFO L93 Difference]: Finished difference Result 625 states and 1855 transitions. [2020-02-10 20:14:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:00,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,242 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:14:00,242 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:14:00,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:14:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 391. [2020-02-10 20:14:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:14:00,252 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:14:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,252 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:14:00,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:14:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:00,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,253 INFO L415 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] [2020-02-10 20:14:00,253 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,253 INFO L82 PathProgramCache]: Analyzing trace with hash -245523000, now seen corresponding path program 279 times [2020-02-10 20:14:00,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787504847] [2020-02-10 20:14:00,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787504847] [2020-02-10 20:14:00,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:00,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945929020] [2020-02-10 20:14:00,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:00,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,518 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:14:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,598 INFO L93 Difference]: Finished difference Result 640 states and 1888 transitions. [2020-02-10 20:14:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:00,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,600 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:14:00,600 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:14:00,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:14:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 397. [2020-02-10 20:14:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1372 transitions. [2020-02-10 20:14:00,610 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1372 transitions. Word has length 22 [2020-02-10 20:14:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,610 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1372 transitions. [2020-02-10 20:14:00,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1372 transitions. [2020-02-10 20:14:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:00,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,611 INFO L415 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] [2020-02-10 20:14:00,611 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -52702308, now seen corresponding path program 280 times [2020-02-10 20:14:00,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290996389] [2020-02-10 20:14:00,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290996389] [2020-02-10 20:14:00,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386035531] [2020-02-10 20:14:00,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:00,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,864 INFO L87 Difference]: Start difference. First operand 397 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:14:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,026 INFO L93 Difference]: Finished difference Result 637 states and 1877 transitions. [2020-02-10 20:14:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:01,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,028 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:14:01,028 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:14:01,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:14:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 391. [2020-02-10 20:14:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 20:14:01,048 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 20:14:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,048 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 20:14:01,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 20:14:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:01,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,050 INFO L415 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] [2020-02-10 20:14:01,050 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,050 INFO L82 PathProgramCache]: Analyzing trace with hash -190800774, now seen corresponding path program 281 times [2020-02-10 20:14:01,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986210098] [2020-02-10 20:14:01,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986210098] [2020-02-10 20:14:01,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:01,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666966027] [2020-02-10 20:14:01,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:01,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:01,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:01,360 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:14:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,454 INFO L93 Difference]: Finished difference Result 621 states and 1846 transitions. [2020-02-10 20:14:01,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:01,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,456 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:14:01,456 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:14:01,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:14:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 392. [2020-02-10 20:14:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1361 transitions. [2020-02-10 20:14:01,465 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1361 transitions. Word has length 22 [2020-02-10 20:14:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,465 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1361 transitions. [2020-02-10 20:14:01,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1361 transitions. [2020-02-10 20:14:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:01,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,466 INFO L415 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] [2020-02-10 20:14:01,466 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1955369986, now seen corresponding path program 282 times [2020-02-10 20:14:01,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288934684] [2020-02-10 20:14:01,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288934684] [2020-02-10 20:14:01,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:01,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857667770] [2020-02-10 20:14:01,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:01,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:01,714 INFO L87 Difference]: Start difference. First operand 392 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:14:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,837 INFO L93 Difference]: Finished difference Result 625 states and 1853 transitions. [2020-02-10 20:14:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:01,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,839 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:14:01,839 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:14:01,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:14:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 389. [2020-02-10 20:14:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 20:14:01,849 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 20:14:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,849 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 20:14:01,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 20:14:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:01,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,849 INFO L415 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] [2020-02-10 20:14:01,850 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 305470830, now seen corresponding path program 283 times [2020-02-10 20:14:01,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708847535] [2020-02-10 20:14:01,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708847535] [2020-02-10 20:14:02,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:02,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386486647] [2020-02-10 20:14:02,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:02,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,104 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:14:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,223 INFO L93 Difference]: Finished difference Result 611 states and 1826 transitions. [2020-02-10 20:14:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:02,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,225 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:14:02,225 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:14:02,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:14:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 391. [2020-02-10 20:14:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 20:14:02,234 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 20:14:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,234 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 20:14:02,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 20:14:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:02,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,235 INFO L415 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] [2020-02-10 20:14:02,235 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1140046180, now seen corresponding path program 284 times [2020-02-10 20:14:02,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736468418] [2020-02-10 20:14:02,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736468418] [2020-02-10 20:14:02,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:02,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408546800] [2020-02-10 20:14:02,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:02,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,502 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:14:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,600 INFO L93 Difference]: Finished difference Result 609 states and 1821 transitions. [2020-02-10 20:14:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:02,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,602 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:14:02,602 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:14:02,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:14:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 390. [2020-02-10 20:14:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1358 transitions. [2020-02-10 20:14:02,611 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1358 transitions. Word has length 22 [2020-02-10 20:14:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,611 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1358 transitions. [2020-02-10 20:14:02,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1358 transitions. [2020-02-10 20:14:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:02,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,612 INFO L415 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] [2020-02-10 20:14:02,612 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1882712346, now seen corresponding path program 285 times [2020-02-10 20:14:02,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306606322] [2020-02-10 20:14:02,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306606322] [2020-02-10 20:14:02,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:02,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582510106] [2020-02-10 20:14:02,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:02,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,870 INFO L87 Difference]: Start difference. First operand 390 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:14:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,974 INFO L93 Difference]: Finished difference Result 617 states and 1839 transitions. [2020-02-10 20:14:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:02,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,976 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:14:02,976 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:14:02,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:14:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 393. [2020-02-10 20:14:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1363 transitions. [2020-02-10 20:14:02,986 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1363 transitions. Word has length 22 [2020-02-10 20:14:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,986 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1363 transitions. [2020-02-10 20:14:02,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1363 transitions. [2020-02-10 20:14:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:02,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,987 INFO L415 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] [2020-02-10 20:14:02,987 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1630255708, now seen corresponding path program 286 times [2020-02-10 20:14:02,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167170804] [2020-02-10 20:14:02,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167170804] [2020-02-10 20:14:03,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:03,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99572952] [2020-02-10 20:14:03,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:03,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:03,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:03,240 INFO L87 Difference]: Start difference. First operand 393 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:14:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,357 INFO L93 Difference]: Finished difference Result 619 states and 1840 transitions. [2020-02-10 20:14:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:03,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,359 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:14:03,359 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:14:03,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:14:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 390. [2020-02-10 20:14:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 20:14:03,368 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 20:14:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,368 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 20:14:03,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 20:14:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:03,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,369 INFO L415 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] [2020-02-10 20:14:03,369 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash -633699914, now seen corresponding path program 287 times [2020-02-10 20:14:03,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455820698] [2020-02-10 20:14:03,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455820698] [2020-02-10 20:14:03,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:03,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458630217] [2020-02-10 20:14:03,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:03,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:03,638 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:14:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,732 INFO L93 Difference]: Finished difference Result 611 states and 1824 transitions. [2020-02-10 20:14:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:03,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,734 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:14:03,734 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:14:03,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:14:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 391. [2020-02-10 20:14:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 20:14:03,744 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 20:14:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,744 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 20:14:03,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 20:14:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:03,745 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,745 INFO L415 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] [2020-02-10 20:14:03,745 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1512470846, now seen corresponding path program 288 times [2020-02-10 20:14:03,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564671449] [2020-02-10 20:14:03,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564671449] [2020-02-10 20:14:04,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:04,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822577398] [2020-02-10 20:14:04,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:04,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:04,009 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:14:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,123 INFO L93 Difference]: Finished difference Result 615 states and 1831 transitions. [2020-02-10 20:14:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:04,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,125 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:14:04,125 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:14:04,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:14:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 387. [2020-02-10 20:14:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:14:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-02-10 20:14:04,137 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-02-10 20:14:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,137 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-02-10 20:14:04,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-02-10 20:14:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:04,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,138 INFO L415 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] [2020-02-10 20:14:04,138 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash -950614304, now seen corresponding path program 289 times [2020-02-10 20:14:04,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707674992] [2020-02-10 20:14:04,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707674992] [2020-02-10 20:14:04,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:04,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252829744] [2020-02-10 20:14:04,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:04,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:04,420 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:14:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,516 INFO L93 Difference]: Finished difference Result 680 states and 2010 transitions. [2020-02-10 20:14:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:04,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,519 INFO L225 Difference]: With dead ends: 680 [2020-02-10 20:14:04,519 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 20:14:04,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 20:14:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 402. [2020-02-10 20:14:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1397 transitions. [2020-02-10 20:14:04,529 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1397 transitions. Word has length 22 [2020-02-10 20:14:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,529 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1397 transitions. [2020-02-10 20:14:04,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1397 transitions. [2020-02-10 20:14:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:04,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,530 INFO L415 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] [2020-02-10 20:14:04,530 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash 639651582, now seen corresponding path program 290 times [2020-02-10 20:14:04,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947518272] [2020-02-10 20:14:04,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947518272] [2020-02-10 20:14:04,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:04,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723428638] [2020-02-10 20:14:04,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:04,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:04,804 INFO L87 Difference]: Start difference. First operand 402 states and 1397 transitions. Second operand 9 states. [2020-02-10 20:14:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,904 INFO L93 Difference]: Finished difference Result 675 states and 1997 transitions. [2020-02-10 20:14:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:04,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,906 INFO L225 Difference]: With dead ends: 675 [2020-02-10 20:14:04,906 INFO L226 Difference]: Without dead ends: 660 [2020-02-10 20:14:04,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-02-10 20:14:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 398. [2020-02-10 20:14:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1387 transitions. [2020-02-10 20:14:04,916 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1387 transitions. Word has length 22 [2020-02-10 20:14:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,917 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1387 transitions. [2020-02-10 20:14:04,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1387 transitions. [2020-02-10 20:14:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:04,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,917 INFO L415 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] [2020-02-10 20:14:04,917 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -685563440, now seen corresponding path program 291 times [2020-02-10 20:14:04,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69575323] [2020-02-10 20:14:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69575323] [2020-02-10 20:14:05,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:05,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763217603] [2020-02-10 20:14:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:05,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,204 INFO L87 Difference]: Start difference. First operand 398 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:14:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,293 INFO L93 Difference]: Finished difference Result 687 states and 2022 transitions. [2020-02-10 20:14:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:05,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,295 INFO L225 Difference]: With dead ends: 687 [2020-02-10 20:14:05,296 INFO L226 Difference]: Without dead ends: 671 [2020-02-10 20:14:05,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-02-10 20:14:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 406. [2020-02-10 20:14:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 20:14:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1400 transitions. [2020-02-10 20:14:05,306 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1400 transitions. Word has length 22 [2020-02-10 20:14:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,306 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1400 transitions. [2020-02-10 20:14:05,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1400 transitions. [2020-02-10 20:14:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:05,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,307 INFO L415 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] [2020-02-10 20:14:05,307 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2111832306, now seen corresponding path program 292 times [2020-02-10 20:14:05,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781675529] [2020-02-10 20:14:05,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781675529] [2020-02-10 20:14:05,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:05,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267319908] [2020-02-10 20:14:05,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:05,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,585 INFO L87 Difference]: Start difference. First operand 406 states and 1400 transitions. Second operand 9 states. [2020-02-10 20:14:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,688 INFO L93 Difference]: Finished difference Result 685 states and 2012 transitions. [2020-02-10 20:14:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:05,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,690 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:14:05,690 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 20:14:05,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 20:14:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 398. [2020-02-10 20:14:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1382 transitions. [2020-02-10 20:14:05,700 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1382 transitions. Word has length 22 [2020-02-10 20:14:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,700 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1382 transitions. [2020-02-10 20:14:05,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1382 transitions. [2020-02-10 20:14:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:05,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,701 INFO L415 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] [2020-02-10 20:14:05,701 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1900859854, now seen corresponding path program 293 times [2020-02-10 20:14:05,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401315066] [2020-02-10 20:14:05,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401315066] [2020-02-10 20:14:05,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:05,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734564209] [2020-02-10 20:14:05,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:05,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,974 INFO L87 Difference]: Start difference. First operand 398 states and 1382 transitions. Second operand 9 states. [2020-02-10 20:14:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,083 INFO L93 Difference]: Finished difference Result 672 states and 1987 transitions. [2020-02-10 20:14:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:06,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,085 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:14:06,085 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 20:14:06,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 20:14:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 401. [2020-02-10 20:14:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1387 transitions. [2020-02-10 20:14:06,095 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1387 transitions. Word has length 22 [2020-02-10 20:14:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,096 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1387 transitions. [2020-02-10 20:14:06,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1387 transitions. [2020-02-10 20:14:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:06,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,096 INFO L415 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] [2020-02-10 20:14:06,097 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1882425828, now seen corresponding path program 294 times [2020-02-10 20:14:06,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100339630] [2020-02-10 20:14:06,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100339630] [2020-02-10 20:14:06,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:06,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854923897] [2020-02-10 20:14:06,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:06,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:06,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:06,379 INFO L87 Difference]: Start difference. First operand 401 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:14:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,494 INFO L93 Difference]: Finished difference Result 675 states and 1990 transitions. [2020-02-10 20:14:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:06,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,496 INFO L225 Difference]: With dead ends: 675 [2020-02-10 20:14:06,496 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:14:06,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:14:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 393. [2020-02-10 20:14:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 20:14:06,505 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 20:14:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,505 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 20:14:06,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 20:14:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:06,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,506 INFO L415 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] [2020-02-10 20:14:06,506 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1795585756, now seen corresponding path program 295 times [2020-02-10 20:14:06,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970669996] [2020-02-10 20:14:06,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970669996] [2020-02-10 20:14:06,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:06,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984068771] [2020-02-10 20:14:06,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:06,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:06,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:06,782 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:14:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,873 INFO L93 Difference]: Finished difference Result 676 states and 1997 transitions. [2020-02-10 20:14:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:06,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,875 INFO L225 Difference]: With dead ends: 676 [2020-02-10 20:14:06,875 INFO L226 Difference]: Without dead ends: 660 [2020-02-10 20:14:06,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-02-10 20:14:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 401. [2020-02-10 20:14:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1390 transitions. [2020-02-10 20:14:06,886 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1390 transitions. Word has length 22 [2020-02-10 20:14:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,887 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1390 transitions. [2020-02-10 20:14:06,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1390 transitions. [2020-02-10 20:14:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:06,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,887 INFO L415 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] [2020-02-10 20:14:06,887 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash -205319870, now seen corresponding path program 296 times [2020-02-10 20:14:06,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482690043] [2020-02-10 20:14:06,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482690043] [2020-02-10 20:14:07,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:07,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101976583] [2020-02-10 20:14:07,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:07,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:07,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,168 INFO L87 Difference]: Start difference. First operand 401 states and 1390 transitions. Second operand 9 states. [2020-02-10 20:14:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,278 INFO L93 Difference]: Finished difference Result 671 states and 1984 transitions. [2020-02-10 20:14:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:07,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,280 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:14:07,281 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:14:07,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:14:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 397. [2020-02-10 20:14:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1380 transitions. [2020-02-10 20:14:07,291 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1380 transitions. Word has length 22 [2020-02-10 20:14:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,291 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1380 transitions. [2020-02-10 20:14:07,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1380 transitions. [2020-02-10 20:14:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:07,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,292 INFO L415 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] [2020-02-10 20:14:07,292 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash -463022828, now seen corresponding path program 297 times [2020-02-10 20:14:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951822305] [2020-02-10 20:14:07,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951822305] [2020-02-10 20:14:07,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:07,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877016587] [2020-02-10 20:14:07,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:07,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:07,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,566 INFO L87 Difference]: Start difference. First operand 397 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:14:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,651 INFO L93 Difference]: Finished difference Result 680 states and 2003 transitions. [2020-02-10 20:14:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:07,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,653 INFO L225 Difference]: With dead ends: 680 [2020-02-10 20:14:07,654 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 20:14:07,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 20:14:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 403. [2020-02-10 20:14:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 20:14:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1390 transitions. [2020-02-10 20:14:07,663 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1390 transitions. Word has length 22 [2020-02-10 20:14:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,664 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1390 transitions. [2020-02-10 20:14:07,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1390 transitions. [2020-02-10 20:14:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:07,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,664 INFO L415 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] [2020-02-10 20:14:07,665 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2054122856, now seen corresponding path program 298 times [2020-02-10 20:14:07,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837985113] [2020-02-10 20:14:07,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837985113] [2020-02-10 20:14:07,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:07,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667183704] [2020-02-10 20:14:07,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:07,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,949 INFO L87 Difference]: Start difference. First operand 403 states and 1390 transitions. Second operand 9 states. [2020-02-10 20:14:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,053 INFO L93 Difference]: Finished difference Result 677 states and 1992 transitions. [2020-02-10 20:14:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:08,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,055 INFO L225 Difference]: With dead ends: 677 [2020-02-10 20:14:08,055 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 20:14:08,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 20:14:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 397. [2020-02-10 20:14:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-02-10 20:14:08,064 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,065 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-02-10 20:14:08,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-02-10 20:14:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:08,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,065 INFO L415 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] [2020-02-10 20:14:08,066 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1678319242, now seen corresponding path program 299 times [2020-02-10 20:14:08,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017383928] [2020-02-10 20:14:08,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017383928] [2020-02-10 20:14:08,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065776403] [2020-02-10 20:14:08,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:08,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:08,333 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,452 INFO L93 Difference]: Finished difference Result 667 states and 1973 transitions. [2020-02-10 20:14:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:08,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,453 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:14:08,454 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:14:08,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:14:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 400. [2020-02-10 20:14:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:14:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1381 transitions. [2020-02-10 20:14:08,466 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1381 transitions. Word has length 22 [2020-02-10 20:14:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,466 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1381 transitions. [2020-02-10 20:14:08,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1381 transitions. [2020-02-10 20:14:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:08,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,467 INFO L415 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] [2020-02-10 20:14:08,467 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 50728092, now seen corresponding path program 300 times [2020-02-10 20:14:08,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910445502] [2020-02-10 20:14:08,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910445502] [2020-02-10 20:14:08,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:08,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555118957] [2020-02-10 20:14:08,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:08,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:08,734 INFO L87 Difference]: Start difference. First operand 400 states and 1381 transitions. Second operand 9 states. [2020-02-10 20:14:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,840 INFO L93 Difference]: Finished difference Result 669 states and 1974 transitions. [2020-02-10 20:14:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:08,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,842 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:14:08,842 INFO L226 Difference]: Without dead ends: 649 [2020-02-10 20:14:08,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-02-10 20:14:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 393. [2020-02-10 20:14:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 20:14:08,852 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 20:14:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,852 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 20:14:08,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 20:14:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:08,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,853 INFO L415 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] [2020-02-10 20:14:08,853 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1969181664, now seen corresponding path program 301 times [2020-02-10 20:14:08,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723692168] [2020-02-10 20:14:08,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723692168] [2020-02-10 20:14:09,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:09,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973351822] [2020-02-10 20:14:09,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:09,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:09,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,138 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:14:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,239 INFO L93 Difference]: Finished difference Result 696 states and 2042 transitions. [2020-02-10 20:14:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:09,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,241 INFO L225 Difference]: With dead ends: 696 [2020-02-10 20:14:09,241 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 20:14:09,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 20:14:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 409. [2020-02-10 20:14:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-02-10 20:14:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1404 transitions. [2020-02-10 20:14:09,251 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1404 transitions. Word has length 22 [2020-02-10 20:14:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,252 INFO L479 AbstractCegarLoop]: Abstraction has 409 states and 1404 transitions. [2020-02-10 20:14:09,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1404 transitions. [2020-02-10 20:14:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:09,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,252 INFO L415 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] [2020-02-10 20:14:09,252 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 471610114, now seen corresponding path program 302 times [2020-02-10 20:14:09,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484330988] [2020-02-10 20:14:09,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484330988] [2020-02-10 20:14:09,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:09,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461381134] [2020-02-10 20:14:09,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:09,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:09,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,538 INFO L87 Difference]: Start difference. First operand 409 states and 1404 transitions. Second operand 9 states. [2020-02-10 20:14:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,637 INFO L93 Difference]: Finished difference Result 694 states and 2032 transitions. [2020-02-10 20:14:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:09,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,639 INFO L225 Difference]: With dead ends: 694 [2020-02-10 20:14:09,639 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 20:14:09,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 20:14:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 401. [2020-02-10 20:14:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1384 transitions. [2020-02-10 20:14:09,650 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,650 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1384 transitions. [2020-02-10 20:14:09,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1384 transitions. [2020-02-10 20:14:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:09,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,651 INFO L415 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] [2020-02-10 20:14:09,651 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash -836380636, now seen corresponding path program 303 times [2020-02-10 20:14:09,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19269834] [2020-02-10 20:14:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19269834] [2020-02-10 20:14:09,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:09,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652527888] [2020-02-10 20:14:09,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:09,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,933 INFO L87 Difference]: Start difference. First operand 401 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,019 INFO L93 Difference]: Finished difference Result 693 states and 2029 transitions. [2020-02-10 20:14:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:10,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,021 INFO L225 Difference]: With dead ends: 693 [2020-02-10 20:14:10,021 INFO L226 Difference]: Without dead ends: 677 [2020-02-10 20:14:10,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-02-10 20:14:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 407. [2020-02-10 20:14:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 20:14:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1394 transitions. [2020-02-10 20:14:10,042 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1394 transitions. Word has length 22 [2020-02-10 20:14:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,042 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1394 transitions. [2020-02-10 20:14:10,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1394 transitions. [2020-02-10 20:14:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:10,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,042 INFO L415 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] [2020-02-10 20:14:10,043 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1867486632, now seen corresponding path program 304 times [2020-02-10 20:14:10,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676053667] [2020-02-10 20:14:10,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676053667] [2020-02-10 20:14:10,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:10,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861480582] [2020-02-10 20:14:10,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:10,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:10,335 INFO L87 Difference]: Start difference. First operand 407 states and 1394 transitions. Second operand 9 states. [2020-02-10 20:14:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,440 INFO L93 Difference]: Finished difference Result 690 states and 2018 transitions. [2020-02-10 20:14:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:10,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,442 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:14:10,442 INFO L226 Difference]: Without dead ends: 671 [2020-02-10 20:14:10,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-02-10 20:14:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 401. [2020-02-10 20:14:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1378 transitions. [2020-02-10 20:14:10,452 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1378 transitions. Word has length 22 [2020-02-10 20:14:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,452 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1378 transitions. [2020-02-10 20:14:10,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1378 transitions. [2020-02-10 20:14:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:10,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,453 INFO L415 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] [2020-02-10 20:14:10,453 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1582826058, now seen corresponding path program 305 times [2020-02-10 20:14:10,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697439725] [2020-02-10 20:14:10,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697439725] [2020-02-10 20:14:10,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:10,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61614754] [2020-02-10 20:14:10,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:10,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:10,732 INFO L87 Difference]: Start difference. First operand 401 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:14:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,835 INFO L93 Difference]: Finished difference Result 688 states and 2015 transitions. [2020-02-10 20:14:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:10,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,837 INFO L225 Difference]: With dead ends: 688 [2020-02-10 20:14:10,837 INFO L226 Difference]: Without dead ends: 674 [2020-02-10 20:14:10,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-02-10 20:14:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 406. [2020-02-10 20:14:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 20:14:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1387 transitions. [2020-02-10 20:14:10,846 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1387 transitions. Word has length 22 [2020-02-10 20:14:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,846 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1387 transitions. [2020-02-10 20:14:10,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1387 transitions. [2020-02-10 20:14:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:10,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,847 INFO L415 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] [2020-02-10 20:14:10,847 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1527414798, now seen corresponding path program 306 times [2020-02-10 20:14:10,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294354502] [2020-02-10 20:14:10,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294354502] [2020-02-10 20:14:11,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:11,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669931902] [2020-02-10 20:14:11,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:11,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,125 INFO L87 Difference]: Start difference. First operand 406 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:14:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,253 INFO L93 Difference]: Finished difference Result 687 states and 2008 transitions. [2020-02-10 20:14:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:11,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,255 INFO L225 Difference]: With dead ends: 687 [2020-02-10 20:14:11,255 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 20:14:11,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 20:14:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 393. [2020-02-10 20:14:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-02-10 20:14:11,265 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-02-10 20:14:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,265 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-02-10 20:14:11,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-02-10 20:14:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:11,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,265 INFO L415 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] [2020-02-10 20:14:11,266 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -319200130, now seen corresponding path program 307 times [2020-02-10 20:14:11,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275659371] [2020-02-10 20:14:11,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275659371] [2020-02-10 20:14:11,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:11,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006474989] [2020-02-10 20:14:11,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:11,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,534 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:14:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,648 INFO L93 Difference]: Finished difference Result 663 states and 1963 transitions. [2020-02-10 20:14:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:11,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,650 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:14:11,650 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 20:14:11,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 20:14:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 399. [2020-02-10 20:14:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1376 transitions. [2020-02-10 20:14:11,660 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,660 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1376 transitions. [2020-02-10 20:14:11,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1376 transitions. [2020-02-10 20:14:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:11,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,661 INFO L415 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] [2020-02-10 20:14:11,661 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash -300766104, now seen corresponding path program 308 times [2020-02-10 20:14:11,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014228112] [2020-02-10 20:14:11,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014228112] [2020-02-10 20:14:11,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:11,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449752363] [2020-02-10 20:14:11,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:11,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,923 INFO L87 Difference]: Start difference. First operand 399 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,039 INFO L93 Difference]: Finished difference Result 666 states and 1966 transitions. [2020-02-10 20:14:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:12,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,041 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:14:12,041 INFO L226 Difference]: Without dead ends: 649 [2020-02-10 20:14:12,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-02-10 20:14:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 396. [2020-02-10 20:14:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1368 transitions. [2020-02-10 20:14:12,052 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1368 transitions. Word has length 22 [2020-02-10 20:14:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,052 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1368 transitions. [2020-02-10 20:14:12,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1368 transitions. [2020-02-10 20:14:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:12,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,052 INFO L415 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] [2020-02-10 20:14:12,053 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1170204866, now seen corresponding path program 309 times [2020-02-10 20:14:12,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053253264] [2020-02-10 20:14:12,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053253264] [2020-02-10 20:14:12,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:12,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081697825] [2020-02-10 20:14:12,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:12,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:12,320 INFO L87 Difference]: Start difference. First operand 396 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:14:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,423 INFO L93 Difference]: Finished difference Result 662 states and 1958 transitions. [2020-02-10 20:14:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:12,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,425 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:14:12,425 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 20:14:12,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 20:14:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 399. [2020-02-10 20:14:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1373 transitions. [2020-02-10 20:14:12,434 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1373 transitions. Word has length 22 [2020-02-10 20:14:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,434 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1373 transitions. [2020-02-10 20:14:12,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1373 transitions. [2020-02-10 20:14:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:12,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,435 INFO L415 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] [2020-02-10 20:14:12,435 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1395715096, now seen corresponding path program 310 times [2020-02-10 20:14:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364459559] [2020-02-10 20:14:12,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364459559] [2020-02-10 20:14:12,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:12,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613553996] [2020-02-10 20:14:12,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:12,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:12,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:12,702 INFO L87 Difference]: Start difference. First operand 399 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:14:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,811 INFO L93 Difference]: Finished difference Result 664 states and 1959 transitions. [2020-02-10 20:14:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:12,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,813 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:14:12,813 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:14:12,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:14:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 396. [2020-02-10 20:14:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1365 transitions. [2020-02-10 20:14:12,823 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1365 transitions. Word has length 22 [2020-02-10 20:14:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,824 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1365 transitions. [2020-02-10 20:14:12,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1365 transitions. [2020-02-10 20:14:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:12,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,824 INFO L415 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] [2020-02-10 20:14:12,824 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1760093698, now seen corresponding path program 311 times [2020-02-10 20:14:12,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499293175] [2020-02-10 20:14:12,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499293175] [2020-02-10 20:14:13,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:13,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497026048] [2020-02-10 20:14:13,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:13,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,100 INFO L87 Difference]: Start difference. First operand 396 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:14:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,209 INFO L93 Difference]: Finished difference Result 670 states and 1973 transitions. [2020-02-10 20:14:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:13,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,210 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:14:13,211 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:14:13,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:14:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 401. [2020-02-10 20:14:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1374 transitions. [2020-02-10 20:14:13,220 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1374 transitions. Word has length 22 [2020-02-10 20:14:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,220 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1374 transitions. [2020-02-10 20:14:13,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1374 transitions. [2020-02-10 20:14:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:13,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,221 INFO L415 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] [2020-02-10 20:14:13,221 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash -824260290, now seen corresponding path program 312 times [2020-02-10 20:14:13,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199395354] [2020-02-10 20:14:13,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199395354] [2020-02-10 20:14:13,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:13,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361091130] [2020-02-10 20:14:13,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:13,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,496 INFO L87 Difference]: Start difference. First operand 401 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:14:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,634 INFO L93 Difference]: Finished difference Result 669 states and 1966 transitions. [2020-02-10 20:14:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:13,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,636 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:14:13,637 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:14:13,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:14:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 387. [2020-02-10 20:14:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:14:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-02-10 20:14:13,646 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-02-10 20:14:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,646 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-02-10 20:14:13,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-02-10 20:14:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:13,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,647 INFO L415 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] [2020-02-10 20:14:13,647 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1956856404, now seen corresponding path program 313 times [2020-02-10 20:14:13,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375578202] [2020-02-10 20:14:13,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375578202] [2020-02-10 20:14:13,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:13,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726187372] [2020-02-10 20:14:13,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:13,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,917 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:14:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,011 INFO L93 Difference]: Finished difference Result 652 states and 1916 transitions. [2020-02-10 20:14:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:14,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,013 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:14:14,014 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 20:14:14,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 20:14:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 396. [2020-02-10 20:14:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-02-10 20:14:14,023 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-02-10 20:14:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,023 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-02-10 20:14:14,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-02-10 20:14:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:14,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,024 INFO L415 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] [2020-02-10 20:14:14,024 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1777042400, now seen corresponding path program 314 times [2020-02-10 20:14:14,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121748032] [2020-02-10 20:14:14,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121748032] [2020-02-10 20:14:14,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:14,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831939777] [2020-02-10 20:14:14,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:14,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:14,289 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:14:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,372 INFO L93 Difference]: Finished difference Result 645 states and 1901 transitions. [2020-02-10 20:14:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:14,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,374 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:14:14,374 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:14:14,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:14:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 394. [2020-02-10 20:14:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 20:14:14,384 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 20:14:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,384 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 20:14:14,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 20:14:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:14,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,385 INFO L415 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] [2020-02-10 20:14:14,385 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1325418360, now seen corresponding path program 315 times [2020-02-10 20:14:14,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302138356] [2020-02-10 20:14:14,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302138356] [2020-02-10 20:14:14,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:14,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750836230] [2020-02-10 20:14:14,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:14,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:14,666 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:14:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,769 INFO L93 Difference]: Finished difference Result 663 states and 1940 transitions. [2020-02-10 20:14:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:14,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,771 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:14:14,771 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 20:14:14,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 20:14:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 402. [2020-02-10 20:14:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1380 transitions. [2020-02-10 20:14:14,783 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1380 transitions. Word has length 22 [2020-02-10 20:14:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,783 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1380 transitions. [2020-02-10 20:14:14,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1380 transitions. [2020-02-10 20:14:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:14,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,784 INFO L415 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] [2020-02-10 20:14:14,784 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1455388806, now seen corresponding path program 316 times [2020-02-10 20:14:14,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459394498] [2020-02-10 20:14:14,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459394498] [2020-02-10 20:14:15,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:15,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959690087] [2020-02-10 20:14:15,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:15,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:15,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,054 INFO L87 Difference]: Start difference. First operand 402 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:14:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,179 INFO L93 Difference]: Finished difference Result 661 states and 1930 transitions. [2020-02-10 20:14:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:15,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,181 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:14:15,181 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:14:15,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:14:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-02-10 20:14:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1364 transitions. [2020-02-10 20:14:15,191 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1364 transitions. Word has length 22 [2020-02-10 20:14:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,191 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1364 transitions. [2020-02-10 20:14:15,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1364 transitions. [2020-02-10 20:14:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:15,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,192 INFO L415 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] [2020-02-10 20:14:15,192 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1270696134, now seen corresponding path program 317 times [2020-02-10 20:14:15,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335468027] [2020-02-10 20:14:15,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335468027] [2020-02-10 20:14:15,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:15,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402826845] [2020-02-10 20:14:15,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:15,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:15,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,456 INFO L87 Difference]: Start difference. First operand 394 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:14:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,539 INFO L93 Difference]: Finished difference Result 642 states and 1893 transitions. [2020-02-10 20:14:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:15,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,541 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:14:15,541 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:14:15,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:14:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 395. [2020-02-10 20:14:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-02-10 20:14:15,550 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-02-10 20:14:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,551 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-02-10 20:14:15,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-02-10 20:14:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:15,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,551 INFO L415 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] [2020-02-10 20:14:15,551 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1948560006, now seen corresponding path program 318 times [2020-02-10 20:14:15,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144599758] [2020-02-10 20:14:15,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144599758] [2020-02-10 20:14:15,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:15,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255788470] [2020-02-10 20:14:15,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:15,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:15,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,814 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:14:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,932 INFO L93 Difference]: Finished difference Result 647 states and 1902 transitions. [2020-02-10 20:14:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:15,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,934 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:14:15,934 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:14:15,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:14:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 391. [2020-02-10 20:14:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 20:14:15,943 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 20:14:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,943 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 20:14:15,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 20:14:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:15,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,944 INFO L415 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] [2020-02-10 20:14:15,944 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1513957264, now seen corresponding path program 319 times [2020-02-10 20:14:15,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406256674] [2020-02-10 20:14:15,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406256674] [2020-02-10 20:14:16,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:16,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072152687] [2020-02-10 20:14:16,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:16,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:16,203 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:14:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,296 INFO L93 Difference]: Finished difference Result 648 states and 1905 transitions. [2020-02-10 20:14:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:16,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,298 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:14:16,298 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:14:16,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:14:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 395. [2020-02-10 20:14:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1366 transitions. [2020-02-10 20:14:16,307 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1366 transitions. Word has length 22 [2020-02-10 20:14:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,307 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1366 transitions. [2020-02-10 20:14:16,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1366 transitions. [2020-02-10 20:14:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:16,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,308 INFO L415 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] [2020-02-10 20:14:16,308 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2075025756, now seen corresponding path program 320 times [2020-02-10 20:14:16,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037097557] [2020-02-10 20:14:16,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037097557] [2020-02-10 20:14:16,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:16,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364233990] [2020-02-10 20:14:16,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:16,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:16,569 INFO L87 Difference]: Start difference. First operand 395 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:14:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,675 INFO L93 Difference]: Finished difference Result 641 states and 1890 transitions. [2020-02-10 20:14:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:16,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,677 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:14:16,677 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:14:16,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:14:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 393. [2020-02-10 20:14:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 20:14:16,687 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 20:14:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,687 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 20:14:16,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 20:14:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:16,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,688 INFO L415 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] [2020-02-10 20:14:16,688 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -674225912, now seen corresponding path program 321 times [2020-02-10 20:14:16,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913523816] [2020-02-10 20:14:16,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913523816] [2020-02-10 20:14:16,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:16,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815621790] [2020-02-10 20:14:16,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:16,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:16,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:16,985 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:14:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,087 INFO L93 Difference]: Finished difference Result 656 states and 1923 transitions. [2020-02-10 20:14:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:17,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,089 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:14:17,089 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 20:14:17,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 20:14:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 399. [2020-02-10 20:14:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1372 transitions. [2020-02-10 20:14:17,099 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1372 transitions. Word has length 22 [2020-02-10 20:14:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,100 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1372 transitions. [2020-02-10 20:14:17,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1372 transitions. [2020-02-10 20:14:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:17,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,100 INFO L415 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] [2020-02-10 20:14:17,101 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash -481405220, now seen corresponding path program 322 times [2020-02-10 20:14:17,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948040876] [2020-02-10 20:14:17,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:17,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948040876] [2020-02-10 20:14:17,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:17,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515930754] [2020-02-10 20:14:17,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:17,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:17,377 INFO L87 Difference]: Start difference. First operand 399 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:14:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,497 INFO L93 Difference]: Finished difference Result 653 states and 1912 transitions. [2020-02-10 20:14:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:17,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,498 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:14:17,499 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:14:17,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:14:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 393. [2020-02-10 20:14:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-02-10 20:14:17,508 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-02-10 20:14:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,508 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-02-10 20:14:17,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-02-10 20:14:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:17,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,508 INFO L415 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] [2020-02-10 20:14:17,509 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash -619503686, now seen corresponding path program 323 times [2020-02-10 20:14:17,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869100283] [2020-02-10 20:14:17,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:17,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869100283] [2020-02-10 20:14:17,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:17,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192024396] [2020-02-10 20:14:17,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:17,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:17,784 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:14:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,897 INFO L93 Difference]: Finished difference Result 637 states and 1881 transitions. [2020-02-10 20:14:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:17,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,899 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:14:17,899 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:14:17,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:14:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-02-10 20:14:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1361 transitions. [2020-02-10 20:14:17,910 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1361 transitions. Word has length 22 [2020-02-10 20:14:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,910 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1361 transitions. [2020-02-10 20:14:17,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1361 transitions. [2020-02-10 20:14:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:17,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,911 INFO L415 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] [2020-02-10 20:14:17,911 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1526667074, now seen corresponding path program 324 times [2020-02-10 20:14:17,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128852369] [2020-02-10 20:14:17,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128852369] [2020-02-10 20:14:18,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:18,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757179816] [2020-02-10 20:14:18,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:18,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:18,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:18,182 INFO L87 Difference]: Start difference. First operand 394 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:14:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,312 INFO L93 Difference]: Finished difference Result 641 states and 1888 transitions. [2020-02-10 20:14:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:18,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,313 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:14:18,314 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:14:18,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:14:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2020-02-10 20:14:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 20:14:18,323 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 20:14:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,323 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 20:14:18,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 20:14:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:18,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,324 INFO L415 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] [2020-02-10 20:14:18,324 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash -439620080, now seen corresponding path program 325 times [2020-02-10 20:14:18,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3106720] [2020-02-10 20:14:18,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3106720] [2020-02-10 20:14:18,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:18,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730721429] [2020-02-10 20:14:18,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:18,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:18,612 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:14:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,705 INFO L93 Difference]: Finished difference Result 680 states and 1986 transitions. [2020-02-10 20:14:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:18,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,707 INFO L225 Difference]: With dead ends: 680 [2020-02-10 20:14:18,707 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 20:14:18,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 20:14:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 407. [2020-02-10 20:14:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 20:14:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1394 transitions. [2020-02-10 20:14:18,716 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1394 transitions. Word has length 22 [2020-02-10 20:14:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,717 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1394 transitions. [2020-02-10 20:14:18,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1394 transitions. [2020-02-10 20:14:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:18,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,717 INFO L415 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] [2020-02-10 20:14:18,717 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash -569590526, now seen corresponding path program 326 times [2020-02-10 20:14:18,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850932363] [2020-02-10 20:14:18,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850932363] [2020-02-10 20:14:19,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:19,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577930756] [2020-02-10 20:14:19,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:19,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,004 INFO L87 Difference]: Start difference. First operand 407 states and 1394 transitions. Second operand 9 states. [2020-02-10 20:14:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,134 INFO L93 Difference]: Finished difference Result 678 states and 1976 transitions. [2020-02-10 20:14:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:19,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,136 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:14:19,136 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:14:19,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:14:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2020-02-10 20:14:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1374 transitions. [2020-02-10 20:14:19,146 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1374 transitions. Word has length 22 [2020-02-10 20:14:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,146 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1374 transitions. [2020-02-10 20:14:19,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1374 transitions. [2020-02-10 20:14:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:19,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,147 INFO L415 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] [2020-02-10 20:14:19,147 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,147 INFO L82 PathProgramCache]: Analyzing trace with hash 654471508, now seen corresponding path program 327 times [2020-02-10 20:14:19,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130261002] [2020-02-10 20:14:19,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130261002] [2020-02-10 20:14:19,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:19,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739086091] [2020-02-10 20:14:19,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:19,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,427 INFO L87 Difference]: Start difference. First operand 399 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:14:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,522 INFO L93 Difference]: Finished difference Result 677 states and 1973 transitions. [2020-02-10 20:14:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:19,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,524 INFO L225 Difference]: With dead ends: 677 [2020-02-10 20:14:19,524 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 20:14:19,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 20:14:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 405. [2020-02-10 20:14:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 20:14:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1384 transitions. [2020-02-10 20:14:19,533 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,533 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1384 transitions. [2020-02-10 20:14:19,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1384 transitions. [2020-02-10 20:14:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:19,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,534 INFO L415 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] [2020-02-10 20:14:19,534 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash 847292200, now seen corresponding path program 328 times [2020-02-10 20:14:19,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604810463] [2020-02-10 20:14:19,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604810463] [2020-02-10 20:14:19,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:19,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916084617] [2020-02-10 20:14:19,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:19,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:19,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,847 INFO L87 Difference]: Start difference. First operand 405 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,978 INFO L93 Difference]: Finished difference Result 674 states and 1962 transitions. [2020-02-10 20:14:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:19,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,980 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:14:19,980 INFO L226 Difference]: Without dead ends: 655 [2020-02-10 20:14:19,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-02-10 20:14:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 399. [2020-02-10 20:14:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1368 transitions. [2020-02-10 20:14:19,990 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1368 transitions. Word has length 22 [2020-02-10 20:14:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,991 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1368 transitions. [2020-02-10 20:14:19,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1368 transitions. [2020-02-10 20:14:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:19,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,991 INFO L415 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] [2020-02-10 20:14:19,991 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1137908070, now seen corresponding path program 329 times [2020-02-10 20:14:19,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737688391] [2020-02-10 20:14:19,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737688391] [2020-02-10 20:14:20,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:20,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361262991] [2020-02-10 20:14:20,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:20,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:20,265 INFO L87 Difference]: Start difference. First operand 399 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:14:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,398 INFO L93 Difference]: Finished difference Result 672 states and 1959 transitions. [2020-02-10 20:14:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:20,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,400 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:14:20,400 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 20:14:20,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 20:14:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 404. [2020-02-10 20:14:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 20:14:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1377 transitions. [2020-02-10 20:14:20,409 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1377 transitions. Word has length 22 [2020-02-10 20:14:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,409 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1377 transitions. [2020-02-10 20:14:20,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1377 transitions. [2020-02-10 20:14:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:20,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,410 INFO L415 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] [2020-02-10 20:14:20,410 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1193319330, now seen corresponding path program 330 times [2020-02-10 20:14:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679253863] [2020-02-10 20:14:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679253863] [2020-02-10 20:14:20,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:20,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907768638] [2020-02-10 20:14:20,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:20,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:20,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:20,696 INFO L87 Difference]: Start difference. First operand 404 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:14:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,828 INFO L93 Difference]: Finished difference Result 671 states and 1952 transitions. [2020-02-10 20:14:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:20,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,830 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:14:20,831 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:14:20,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:14:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 391. [2020-02-10 20:14:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-02-10 20:14:20,840 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-02-10 20:14:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,840 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-02-10 20:14:20,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-02-10 20:14:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:20,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,841 INFO L415 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] [2020-02-10 20:14:20,841 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1098237084, now seen corresponding path program 331 times [2020-02-10 20:14:20,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984328203] [2020-02-10 20:14:20,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984328203] [2020-02-10 20:14:21,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:21,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041620077] [2020-02-10 20:14:21,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:21,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:21,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,104 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:14:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,206 INFO L93 Difference]: Finished difference Result 633 states and 1871 transitions. [2020-02-10 20:14:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:21,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,208 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:14:21,208 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:14:21,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:14:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-02-10 20:14:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-02-10 20:14:21,218 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-02-10 20:14:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,219 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-02-10 20:14:21,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-02-10 20:14:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:21,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,219 INFO L415 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] [2020-02-10 20:14:21,219 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash 22525928, now seen corresponding path program 332 times [2020-02-10 20:14:21,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474968621] [2020-02-10 20:14:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474968621] [2020-02-10 20:14:21,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:21,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810898751] [2020-02-10 20:14:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:21,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,480 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:14:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,617 INFO L93 Difference]: Finished difference Result 638 states and 1880 transitions. [2020-02-10 20:14:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:21,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,619 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:14:21,619 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:14:21,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:14:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 392. [2020-02-10 20:14:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 20:14:21,630 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 20:14:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,630 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 20:14:21,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 20:14:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:21,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,631 INFO L415 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] [2020-02-10 20:14:21,631 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2102638624, now seen corresponding path program 333 times [2020-02-10 20:14:21,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538416282] [2020-02-10 20:14:21,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538416282] [2020-02-10 20:14:21,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:21,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116507873] [2020-02-10 20:14:21,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:21,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:21,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,897 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:14:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,987 INFO L93 Difference]: Finished difference Result 632 states and 1868 transitions. [2020-02-10 20:14:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:21,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,989 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:14:21,990 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:14:21,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:14:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 393. [2020-02-10 20:14:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1355 transitions. [2020-02-10 20:14:21,999 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1355 transitions. Word has length 22 [2020-02-10 20:14:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,999 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1355 transitions. [2020-02-10 20:14:21,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1355 transitions. [2020-02-10 20:14:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:22,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,000 INFO L415 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] [2020-02-10 20:14:22,000 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,000 INFO L82 PathProgramCache]: Analyzing trace with hash 43532136, now seen corresponding path program 334 times [2020-02-10 20:14:22,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394549294] [2020-02-10 20:14:22,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394549294] [2020-02-10 20:14:22,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:22,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19390848] [2020-02-10 20:14:22,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:22,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:22,254 INFO L87 Difference]: Start difference. First operand 393 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:14:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,389 INFO L93 Difference]: Finished difference Result 636 states and 1875 transitions. [2020-02-10 20:14:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:22,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,391 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:14:22,391 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:14:22,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:14:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 392. [2020-02-10 20:14:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1353 transitions. [2020-02-10 20:14:22,400 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1353 transitions. Word has length 22 [2020-02-10 20:14:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,400 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1353 transitions. [2020-02-10 20:14:22,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1353 transitions. [2020-02-10 20:14:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:22,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,401 INFO L415 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] [2020-02-10 20:14:22,401 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2129310048, now seen corresponding path program 335 times [2020-02-10 20:14:22,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999802640] [2020-02-10 20:14:22,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999802640] [2020-02-10 20:14:22,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:22,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033048504] [2020-02-10 20:14:22,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:22,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:22,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:22,678 INFO L87 Difference]: Start difference. First operand 392 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:14:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,814 INFO L93 Difference]: Finished difference Result 646 states and 1899 transitions. [2020-02-10 20:14:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:22,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,816 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:14:22,816 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:14:22,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:14:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 397. [2020-02-10 20:14:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1362 transitions. [2020-02-10 20:14:22,826 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1362 transitions. Word has length 22 [2020-02-10 20:14:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,826 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1362 transitions. [2020-02-10 20:14:22,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1362 transitions. [2020-02-10 20:14:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:22,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,827 INFO L415 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] [2020-02-10 20:14:22,827 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1056224668, now seen corresponding path program 336 times [2020-02-10 20:14:22,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609941826] [2020-02-10 20:14:22,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609941826] [2020-02-10 20:14:23,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:23,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519941224] [2020-02-10 20:14:23,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:23,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:23,110 INFO L87 Difference]: Start difference. First operand 397 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:14:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,249 INFO L93 Difference]: Finished difference Result 645 states and 1892 transitions. [2020-02-10 20:14:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:23,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,251 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:14:23,251 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:14:23,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:14:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 387. [2020-02-10 20:14:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:14:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1344 transitions. [2020-02-10 20:14:23,261 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1344 transitions. Word has length 22 [2020-02-10 20:14:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,261 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1344 transitions. [2020-02-10 20:14:23,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1344 transitions. [2020-02-10 20:14:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:23,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,262 INFO L415 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] [2020-02-10 20:14:23,262 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash -525304394, now seen corresponding path program 337 times [2020-02-10 20:14:23,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359374634] [2020-02-10 20:14:23,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359374634] [2020-02-10 20:14:23,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:23,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377560017] [2020-02-10 20:14:23,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:23,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:23,524 INFO L87 Difference]: Start difference. First operand 387 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:14:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,644 INFO L93 Difference]: Finished difference Result 603 states and 1802 transitions. [2020-02-10 20:14:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:23,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,646 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:14:23,646 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:14:23,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:14:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 390. [2020-02-10 20:14:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 20:14:23,656 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 20:14:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,656 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 20:14:23,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 20:14:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:23,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,656 INFO L415 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] [2020-02-10 20:14:23,657 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1970821404, now seen corresponding path program 338 times [2020-02-10 20:14:23,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442848726] [2020-02-10 20:14:23,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442848726] [2020-02-10 20:14:23,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:23,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072468829] [2020-02-10 20:14:23,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:23,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:23,925 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:14:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,012 INFO L93 Difference]: Finished difference Result 601 states and 1797 transitions. [2020-02-10 20:14:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:24,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,013 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:14:24,014 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:14:24,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:14:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 389. [2020-02-10 20:14:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1350 transitions. [2020-02-10 20:14:24,022 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1350 transitions. Word has length 22 [2020-02-10 20:14:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,023 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1350 transitions. [2020-02-10 20:14:24,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1350 transitions. [2020-02-10 20:14:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:24,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,023 INFO L415 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] [2020-02-10 20:14:24,023 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash 487388138, now seen corresponding path program 339 times [2020-02-10 20:14:24,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178987650] [2020-02-10 20:14:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178987650] [2020-02-10 20:14:24,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:24,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140056907] [2020-02-10 20:14:24,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:24,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:24,276 INFO L87 Difference]: Start difference. First operand 389 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:14:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,392 INFO L93 Difference]: Finished difference Result 610 states and 1817 transitions. [2020-02-10 20:14:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:24,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,394 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:14:24,394 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:14:24,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:14:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2020-02-10 20:14:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-02-10 20:14:24,404 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-02-10 20:14:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,404 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-02-10 20:14:24,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-02-10 20:14:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:24,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,405 INFO L415 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] [2020-02-10 20:14:24,405 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1873423268, now seen corresponding path program 340 times [2020-02-10 20:14:24,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362138721] [2020-02-10 20:14:24,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362138721] [2020-02-10 20:14:24,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:24,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632389748] [2020-02-10 20:14:24,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:24,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:24,656 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:14:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,790 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-02-10 20:14:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:24,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,792 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:14:24,792 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:14:24,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:14:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-02-10 20:14:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-02-10 20:14:24,801 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-02-10 20:14:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,801 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-02-10 20:14:24,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-02-10 20:14:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:24,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,802 INFO L415 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] [2020-02-10 20:14:24,802 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1736400570, now seen corresponding path program 341 times [2020-02-10 20:14:24,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103544553] [2020-02-10 20:14:24,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103544553] [2020-02-10 20:14:25,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:25,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420183909] [2020-02-10 20:14:25,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:25,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:25,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:25,051 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:14:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,161 INFO L93 Difference]: Finished difference Result 604 states and 1802 transitions. [2020-02-10 20:14:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:25,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,163 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:14:25,163 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:14:25,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:14:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 390. [2020-02-10 20:14:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1350 transitions. [2020-02-10 20:14:25,172 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1350 transitions. Word has length 22 [2020-02-10 20:14:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,172 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1350 transitions. [2020-02-10 20:14:25,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1350 transitions. [2020-02-10 20:14:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:25,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,173 INFO L415 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] [2020-02-10 20:14:25,173 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 660689414, now seen corresponding path program 342 times [2020-02-10 20:14:25,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015705153] [2020-02-10 20:14:25,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015705153] [2020-02-10 20:14:25,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:25,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239113820] [2020-02-10 20:14:25,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:25,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:25,418 INFO L87 Difference]: Start difference. First operand 390 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:14:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,551 INFO L93 Difference]: Finished difference Result 609 states and 1811 transitions. [2020-02-10 20:14:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:25,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,553 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:14:25,553 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:14:25,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:14:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 388. [2020-02-10 20:14:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:14:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1347 transitions. [2020-02-10 20:14:25,562 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1347 transitions. Word has length 22 [2020-02-10 20:14:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,563 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1347 transitions. [2020-02-10 20:14:25,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1347 transitions. [2020-02-10 20:14:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:25,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,563 INFO L415 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] [2020-02-10 20:14:25,563 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -968203534, now seen corresponding path program 343 times [2020-02-10 20:14:25,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122790528] [2020-02-10 20:14:25,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122790528] [2020-02-10 20:14:25,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:25,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693466547] [2020-02-10 20:14:25,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:25,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:25,824 INFO L87 Difference]: Start difference. First operand 388 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:14:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,967 INFO L93 Difference]: Finished difference Result 602 states and 1799 transitions. [2020-02-10 20:14:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:25,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,969 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:14:25,969 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:14:25,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:14:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-02-10 20:14:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1351 transitions. [2020-02-10 20:14:25,979 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1351 transitions. Word has length 22 [2020-02-10 20:14:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,979 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1351 transitions. [2020-02-10 20:14:25,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1351 transitions. [2020-02-10 20:14:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:25,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,980 INFO L415 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] [2020-02-10 20:14:25,980 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1881246752, now seen corresponding path program 344 times [2020-02-10 20:14:25,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839270254] [2020-02-10 20:14:25,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839270254] [2020-02-10 20:14:26,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:26,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670015563] [2020-02-10 20:14:26,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:26,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:26,251 INFO L87 Difference]: Start difference. First operand 390 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:14:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,361 INFO L93 Difference]: Finished difference Result 600 states and 1794 transitions. [2020-02-10 20:14:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:26,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,363 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:14:26,363 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:14:26,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:14:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 389. [2020-02-10 20:14:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-02-10 20:14:26,372 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-02-10 20:14:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,372 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-02-10 20:14:26,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-02-10 20:14:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:26,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,373 INFO L415 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] [2020-02-10 20:14:26,373 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1138580586, now seen corresponding path program 345 times [2020-02-10 20:14:26,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164933713] [2020-02-10 20:14:26,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164933713] [2020-02-10 20:14:26,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:26,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684025266] [2020-02-10 20:14:26,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:26,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:26,624 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:14:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,758 INFO L93 Difference]: Finished difference Result 608 states and 1812 transitions. [2020-02-10 20:14:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:26,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,760 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:14:26,760 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:14:26,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:14:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 392. [2020-02-10 20:14:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 20:14:26,770 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 20:14:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,770 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 20:14:26,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 20:14:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:26,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,771 INFO L415 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] [2020-02-10 20:14:26,771 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 356581344, now seen corresponding path program 346 times [2020-02-10 20:14:26,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788790128] [2020-02-10 20:14:26,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788790128] [2020-02-10 20:14:27,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:27,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627451352] [2020-02-10 20:14:27,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:27,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:27,022 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:14:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,155 INFO L93 Difference]: Finished difference Result 610 states and 1813 transitions. [2020-02-10 20:14:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:27,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,156 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:14:27,157 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:14:27,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:14:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 389. [2020-02-10 20:14:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1348 transitions. [2020-02-10 20:14:27,165 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1348 transitions. Word has length 22 [2020-02-10 20:14:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,165 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1348 transitions. [2020-02-10 20:14:27,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1348 transitions. [2020-02-10 20:14:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:27,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,166 INFO L415 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] [2020-02-10 20:14:27,166 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1907374278, now seen corresponding path program 347 times [2020-02-10 20:14:27,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579110354] [2020-02-10 20:14:27,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579110354] [2020-02-10 20:14:27,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:27,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372890798] [2020-02-10 20:14:27,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:27,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:27,422 INFO L87 Difference]: Start difference. First operand 389 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:14:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,532 INFO L93 Difference]: Finished difference Result 602 states and 1797 transitions. [2020-02-10 20:14:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:27,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,534 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:14:27,534 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:14:27,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:14:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2020-02-10 20:14:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 20:14:27,543 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 20:14:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,543 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 20:14:27,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 20:14:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:27,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,544 INFO L415 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] [2020-02-10 20:14:27,544 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 238796482, now seen corresponding path program 348 times [2020-02-10 20:14:27,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425982582] [2020-02-10 20:14:27,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425982582] [2020-02-10 20:14:27,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:27,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290017985] [2020-02-10 20:14:27,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:27,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:27,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:27,798 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:14:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,930 INFO L93 Difference]: Finished difference Result 606 states and 1804 transitions. [2020-02-10 20:14:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:27,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,932 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:14:27,932 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:14:27,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:14:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 388. [2020-02-10 20:14:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:14:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1346 transitions. [2020-02-10 20:14:27,942 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1346 transitions. Word has length 22 [2020-02-10 20:14:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,942 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1346 transitions. [2020-02-10 20:14:27,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1346 transitions. [2020-02-10 20:14:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:27,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,943 INFO L415 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] [2020-02-10 20:14:27,943 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1373186418, now seen corresponding path program 349 times [2020-02-10 20:14:27,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425589420] [2020-02-10 20:14:27,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425589420] [2020-02-10 20:14:28,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:28,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736665484] [2020-02-10 20:14:28,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:28,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,193 INFO L87 Difference]: Start difference. First operand 388 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:14:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,312 INFO L93 Difference]: Finished difference Result 622 states and 1850 transitions. [2020-02-10 20:14:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:28,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,313 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:14:28,314 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:14:28,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:14:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-02-10 20:14:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-02-10 20:14:28,322 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-02-10 20:14:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,322 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-02-10 20:14:28,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-02-10 20:14:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:28,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,323 INFO L415 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] [2020-02-10 20:14:28,323 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1535745748, now seen corresponding path program 350 times [2020-02-10 20:14:28,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445034439] [2020-02-10 20:14:28,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445034439] [2020-02-10 20:14:28,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:28,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601089046] [2020-02-10 20:14:28,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:28,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,575 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:14:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,707 INFO L93 Difference]: Finished difference Result 625 states and 1853 transitions. [2020-02-10 20:14:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:28,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,709 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:14:28,709 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:14:28,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:14:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 391. [2020-02-10 20:14:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 20:14:28,722 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 20:14:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,722 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 20:14:28,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 20:14:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:28,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,723 INFO L415 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] [2020-02-10 20:14:28,724 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1827689290, now seen corresponding path program 351 times [2020-02-10 20:14:28,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661622219] [2020-02-10 20:14:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661622219] [2020-02-10 20:14:28,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:28,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008334602] [2020-02-10 20:14:28,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:28,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,985 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:14:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,112 INFO L93 Difference]: Finished difference Result 621 states and 1845 transitions. [2020-02-10 20:14:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:29,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,114 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:14:29,114 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:14:29,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:14:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-02-10 20:14:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1359 transitions. [2020-02-10 20:14:29,126 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1359 transitions. Word has length 22 [2020-02-10 20:14:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,127 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1359 transitions. [2020-02-10 20:14:29,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1359 transitions. [2020-02-10 20:14:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:29,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,128 INFO L415 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] [2020-02-10 20:14:29,128 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1685278764, now seen corresponding path program 352 times [2020-02-10 20:14:29,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786735439] [2020-02-10 20:14:29,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786735439] [2020-02-10 20:14:29,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:29,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588340715] [2020-02-10 20:14:29,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:29,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:29,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:29,381 INFO L87 Difference]: Start difference. First operand 394 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:14:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,494 INFO L93 Difference]: Finished difference Result 623 states and 1846 transitions. [2020-02-10 20:14:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:29,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,496 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:14:29,496 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:14:29,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:14:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 391. [2020-02-10 20:14:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1351 transitions. [2020-02-10 20:14:29,506 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1351 transitions. Word has length 22 [2020-02-10 20:14:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,506 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1351 transitions. [2020-02-10 20:14:29,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1351 transitions. [2020-02-10 20:14:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:29,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,507 INFO L415 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] [2020-02-10 20:14:29,507 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash -7918474, now seen corresponding path program 353 times [2020-02-10 20:14:29,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812472926] [2020-02-10 20:14:29,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812472926] [2020-02-10 20:14:29,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:29,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425730097] [2020-02-10 20:14:29,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:29,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:29,769 INFO L87 Difference]: Start difference. First operand 391 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:14:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,906 INFO L93 Difference]: Finished difference Result 629 states and 1860 transitions. [2020-02-10 20:14:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:29,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,908 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:14:29,908 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:14:29,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:14:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 396. [2020-02-10 20:14:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1360 transitions. [2020-02-10 20:14:29,916 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1360 transitions. Word has length 22 [2020-02-10 20:14:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,916 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1360 transitions. [2020-02-10 20:14:29,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1360 transitions. [2020-02-10 20:14:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:29,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,917 INFO L415 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] [2020-02-10 20:14:29,917 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1702694834, now seen corresponding path program 354 times [2020-02-10 20:14:29,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149250568] [2020-02-10 20:14:29,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149250568] [2020-02-10 20:14:30,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:30,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831677042] [2020-02-10 20:14:30,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:30,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:30,172 INFO L87 Difference]: Start difference. First operand 396 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:14:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,290 INFO L93 Difference]: Finished difference Result 628 states and 1853 transitions. [2020-02-10 20:14:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:30,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,292 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:14:30,292 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:14:30,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:14:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 388. [2020-02-10 20:14:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:14:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1345 transitions. [2020-02-10 20:14:30,302 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1345 transitions. Word has length 22 [2020-02-10 20:14:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,302 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1345 transitions. [2020-02-10 20:14:30,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1345 transitions. [2020-02-10 20:14:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:30,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,302 INFO L415 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] [2020-02-10 20:14:30,303 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash 253265632, now seen corresponding path program 355 times [2020-02-10 20:14:30,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782748293] [2020-02-10 20:14:30,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782748293] [2020-02-10 20:14:30,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:30,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243581672] [2020-02-10 20:14:30,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:30,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:30,551 INFO L87 Difference]: Start difference. First operand 388 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:14:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,657 INFO L93 Difference]: Finished difference Result 608 states and 1811 transitions. [2020-02-10 20:14:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:30,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,659 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:14:30,659 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:14:30,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:14:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 390. [2020-02-10 20:14:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 20:14:30,669 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 20:14:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,669 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 20:14:30,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 20:14:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:30,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,670 INFO L415 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] [2020-02-10 20:14:30,670 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,670 INFO L82 PathProgramCache]: Analyzing trace with hash -822445524, now seen corresponding path program 356 times [2020-02-10 20:14:30,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471550852] [2020-02-10 20:14:30,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471550852] [2020-02-10 20:14:30,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:30,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57643794] [2020-02-10 20:14:30,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:30,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:30,919 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:14:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,026 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-02-10 20:14:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:31,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,028 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:14:31,028 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:14:31,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:14:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 389. [2020-02-10 20:14:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1347 transitions. [2020-02-10 20:14:31,037 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1347 transitions. Word has length 22 [2020-02-10 20:14:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,037 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1347 transitions. [2020-02-10 20:14:31,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1347 transitions. [2020-02-10 20:14:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:31,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,038 INFO L415 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] [2020-02-10 20:14:31,038 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1347357220, now seen corresponding path program 357 times [2020-02-10 20:14:31,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410675189] [2020-02-10 20:14:31,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410675189] [2020-02-10 20:14:31,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:31,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658711371] [2020-02-10 20:14:31,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:31,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:31,296 INFO L87 Difference]: Start difference. First operand 389 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:14:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,404 INFO L93 Difference]: Finished difference Result 607 states and 1808 transitions. [2020-02-10 20:14:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:31,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,406 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:14:31,406 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:14:31,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:14:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 390. [2020-02-10 20:14:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:14:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1348 transitions. [2020-02-10 20:14:31,415 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1348 transitions. Word has length 22 [2020-02-10 20:14:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,415 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1348 transitions. [2020-02-10 20:14:31,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1348 transitions. [2020-02-10 20:14:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:31,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,416 INFO L415 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] [2020-02-10 20:14:31,416 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,417 INFO L82 PathProgramCache]: Analyzing trace with hash -801439316, now seen corresponding path program 358 times [2020-02-10 20:14:31,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108915704] [2020-02-10 20:14:31,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108915704] [2020-02-10 20:14:31,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:31,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649503025] [2020-02-10 20:14:31,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:31,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:31,669 INFO L87 Difference]: Start difference. First operand 390 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:14:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,778 INFO L93 Difference]: Finished difference Result 611 states and 1815 transitions. [2020-02-10 20:14:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:31,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,780 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:14:31,780 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:14:31,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:14:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 389. [2020-02-10 20:14:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:14:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1346 transitions. [2020-02-10 20:14:31,790 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1346 transitions. Word has length 22 [2020-02-10 20:14:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,790 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1346 transitions. [2020-02-10 20:14:31,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1346 transitions. [2020-02-10 20:14:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:31,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,791 INFO L415 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] [2020-02-10 20:14:31,791 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1284338596, now seen corresponding path program 359 times [2020-02-10 20:14:31,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287978463] [2020-02-10 20:14:31,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287978463] [2020-02-10 20:14:32,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:32,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913322325] [2020-02-10 20:14:32,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:32,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:32,047 INFO L87 Difference]: Start difference. First operand 389 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:14:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,141 INFO L93 Difference]: Finished difference Result 621 states and 1839 transitions. [2020-02-10 20:14:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:32,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,143 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:14:32,143 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:14:32,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:14:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 394. [2020-02-10 20:14:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-02-10 20:14:32,153 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-02-10 20:14:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,153 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-02-10 20:14:32,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-02-10 20:14:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:32,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,154 INFO L415 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] [2020-02-10 20:14:32,154 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash 211253216, now seen corresponding path program 360 times [2020-02-10 20:14:32,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128358132] [2020-02-10 20:14:32,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128358132] [2020-02-10 20:14:32,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:32,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530838231] [2020-02-10 20:14:32,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:32,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:32,413 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:14:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,514 INFO L93 Difference]: Finished difference Result 620 states and 1832 transitions. [2020-02-10 20:14:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:32,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,516 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:14:32,516 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:14:32,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:14:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 383. [2020-02-10 20:14:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:14:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1336 transitions. [2020-02-10 20:14:32,526 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1336 transitions. Word has length 22 [2020-02-10 20:14:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,526 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1336 transitions. [2020-02-10 20:14:32,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1336 transitions. [2020-02-10 20:14:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:32,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,527 INFO L415 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] [2020-02-10 20:14:32,527 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1339285254, now seen corresponding path program 361 times [2020-02-10 20:14:32,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239394778] [2020-02-10 20:14:32,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239394778] [2020-02-10 20:14:32,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:32,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747290317] [2020-02-10 20:14:32,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:32,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:32,806 INFO L87 Difference]: Start difference. First operand 383 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:14:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,881 INFO L93 Difference]: Finished difference Result 666 states and 1990 transitions. [2020-02-10 20:14:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:32,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,883 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:14:32,883 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:14:32,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:14:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 399. [2020-02-10 20:14:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1391 transitions. [2020-02-10 20:14:32,892 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1391 transitions. Word has length 22 [2020-02-10 20:14:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,892 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1391 transitions. [2020-02-10 20:14:32,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1391 transitions. [2020-02-10 20:14:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:32,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,893 INFO L415 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] [2020-02-10 20:14:32,893 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1365416156, now seen corresponding path program 362 times [2020-02-10 20:14:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109569189] [2020-02-10 20:14:32,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:33,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109569189] [2020-02-10 20:14:33,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:33,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857479512] [2020-02-10 20:14:33,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:33,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:33,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,167 INFO L87 Difference]: Start difference. First operand 399 states and 1391 transitions. Second operand 9 states. [2020-02-10 20:14:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,265 INFO L93 Difference]: Finished difference Result 661 states and 1977 transitions. [2020-02-10 20:14:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:33,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,267 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:14:33,267 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:14:33,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:14:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 395. [2020-02-10 20:14:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1382 transitions. [2020-02-10 20:14:33,276 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1382 transitions. Word has length 22 [2020-02-10 20:14:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,276 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1382 transitions. [2020-02-10 20:14:33,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1382 transitions. [2020-02-10 20:14:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:33,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,277 INFO L415 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] [2020-02-10 20:14:33,277 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1440197426, now seen corresponding path program 363 times [2020-02-10 20:14:33,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791805679] [2020-02-10 20:14:33,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:33,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791805679] [2020-02-10 20:14:33,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:33,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371260205] [2020-02-10 20:14:33,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:33,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,555 INFO L87 Difference]: Start difference. First operand 395 states and 1382 transitions. Second operand 9 states. [2020-02-10 20:14:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,630 INFO L93 Difference]: Finished difference Result 664 states and 1982 transitions. [2020-02-10 20:14:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:33,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,632 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:14:33,633 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:14:33,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:14:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2020-02-10 20:14:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1386 transitions. [2020-02-10 20:14:33,642 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1386 transitions. Word has length 22 [2020-02-10 20:14:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,643 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1386 transitions. [2020-02-10 20:14:33,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1386 transitions. [2020-02-10 20:14:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:33,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,643 INFO L415 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] [2020-02-10 20:14:33,643 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1566833800, now seen corresponding path program 364 times [2020-02-10 20:14:33,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95435071] [2020-02-10 20:14:33,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:33,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95435071] [2020-02-10 20:14:33,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:33,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55824700] [2020-02-10 20:14:33,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:33,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:33,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,917 INFO L87 Difference]: Start difference. First operand 398 states and 1386 transitions. Second operand 9 states. [2020-02-10 20:14:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,020 INFO L93 Difference]: Finished difference Result 658 states and 1968 transitions. [2020-02-10 20:14:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:34,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,022 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:14:34,022 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:14:34,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:14:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 395. [2020-02-10 20:14:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1379 transitions. [2020-02-10 20:14:34,031 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1379 transitions. Word has length 22 [2020-02-10 20:14:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,032 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1379 transitions. [2020-02-10 20:14:34,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1379 transitions. [2020-02-10 20:14:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:34,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,032 INFO L415 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] [2020-02-10 20:14:34,032 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash -848184368, now seen corresponding path program 365 times [2020-02-10 20:14:34,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033279590] [2020-02-10 20:14:34,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033279590] [2020-02-10 20:14:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328369266] [2020-02-10 20:14:34,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:34,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:34,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:34,306 INFO L87 Difference]: Start difference. First operand 395 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:14:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,403 INFO L93 Difference]: Finished difference Result 653 states and 1959 transitions. [2020-02-10 20:14:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:34,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,405 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:14:34,405 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:14:34,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:14:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 20:14:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1382 transitions. [2020-02-10 20:14:34,414 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1382 transitions. Word has length 22 [2020-02-10 20:14:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,414 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1382 transitions. [2020-02-10 20:14:34,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1382 transitions. [2020-02-10 20:14:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:34,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,415 INFO L415 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] [2020-02-10 20:14:34,415 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 493748420, now seen corresponding path program 366 times [2020-02-10 20:14:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554172427] [2020-02-10 20:14:34,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554172427] [2020-02-10 20:14:34,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:34,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976811593] [2020-02-10 20:14:34,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:34,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:34,684 INFO L87 Difference]: Start difference. First operand 397 states and 1382 transitions. Second operand 9 states. [2020-02-10 20:14:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,785 INFO L93 Difference]: Finished difference Result 652 states and 1955 transitions. [2020-02-10 20:14:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:34,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,787 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:14:34,787 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:14:34,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:14:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 392. [2020-02-10 20:14:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1372 transitions. [2020-02-10 20:14:34,797 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1372 transitions. Word has length 22 [2020-02-10 20:14:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,797 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1372 transitions. [2020-02-10 20:14:34,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1372 transitions. [2020-02-10 20:14:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:34,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,797 INFO L415 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] [2020-02-10 20:14:34,798 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1718040, now seen corresponding path program 367 times [2020-02-10 20:14:34,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760392398] [2020-02-10 20:14:34,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760392398] [2020-02-10 20:14:35,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:35,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497333237] [2020-02-10 20:14:35,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:35,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:35,080 INFO L87 Difference]: Start difference. First operand 392 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:14:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,154 INFO L93 Difference]: Finished difference Result 678 states and 2017 transitions. [2020-02-10 20:14:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:35,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,156 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:14:35,156 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:14:35,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:14:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 401. [2020-02-10 20:14:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1394 transitions. [2020-02-10 20:14:35,166 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1394 transitions. Word has length 22 [2020-02-10 20:14:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,166 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1394 transitions. [2020-02-10 20:14:35,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1394 transitions. [2020-02-10 20:14:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:35,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,167 INFO L415 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] [2020-02-10 20:14:35,167 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1591983926, now seen corresponding path program 368 times [2020-02-10 20:14:35,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577454152] [2020-02-10 20:14:35,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577454152] [2020-02-10 20:14:35,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:35,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963051544] [2020-02-10 20:14:35,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:35,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:35,443 INFO L87 Difference]: Start difference. First operand 401 states and 1394 transitions. Second operand 9 states. [2020-02-10 20:14:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,546 INFO L93 Difference]: Finished difference Result 673 states and 2004 transitions. [2020-02-10 20:14:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:35,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,548 INFO L225 Difference]: With dead ends: 673 [2020-02-10 20:14:35,548 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 20:14:35,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 20:14:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 397. [2020-02-10 20:14:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1384 transitions. [2020-02-10 20:14:35,558 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,558 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1384 transitions. [2020-02-10 20:14:35,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1384 transitions. [2020-02-10 20:14:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:35,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,559 INFO L415 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] [2020-02-10 20:14:35,559 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 266768904, now seen corresponding path program 369 times [2020-02-10 20:14:35,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593960430] [2020-02-10 20:14:35,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593960430] [2020-02-10 20:14:35,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:35,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727208305] [2020-02-10 20:14:35,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:35,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:35,858 INFO L87 Difference]: Start difference. First operand 397 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,930 INFO L93 Difference]: Finished difference Result 685 states and 2029 transitions. [2020-02-10 20:14:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:35,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,932 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:14:35,932 INFO L226 Difference]: Without dead ends: 669 [2020-02-10 20:14:35,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-02-10 20:14:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 405. [2020-02-10 20:14:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 20:14:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1397 transitions. [2020-02-10 20:14:35,942 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1397 transitions. Word has length 22 [2020-02-10 20:14:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,942 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1397 transitions. [2020-02-10 20:14:35,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1397 transitions. [2020-02-10 20:14:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:35,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,943 INFO L415 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] [2020-02-10 20:14:35,943 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1230802646, now seen corresponding path program 370 times [2020-02-10 20:14:35,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43711767] [2020-02-10 20:14:35,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43711767] [2020-02-10 20:14:36,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:36,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240076137] [2020-02-10 20:14:36,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:36,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,218 INFO L87 Difference]: Start difference. First operand 405 states and 1397 transitions. Second operand 9 states. [2020-02-10 20:14:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,313 INFO L93 Difference]: Finished difference Result 683 states and 2019 transitions. [2020-02-10 20:14:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:36,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,315 INFO L225 Difference]: With dead ends: 683 [2020-02-10 20:14:36,315 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 20:14:36,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 20:14:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 397. [2020-02-10 20:14:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-02-10 20:14:36,324 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-02-10 20:14:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,324 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-02-10 20:14:36,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-02-10 20:14:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:36,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,325 INFO L415 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] [2020-02-10 20:14:36,325 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash -948527510, now seen corresponding path program 371 times [2020-02-10 20:14:36,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52537513] [2020-02-10 20:14:36,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52537513] [2020-02-10 20:14:36,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:36,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904037689] [2020-02-10 20:14:36,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:36,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,597 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:14:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,696 INFO L93 Difference]: Finished difference Result 670 states and 1994 transitions. [2020-02-10 20:14:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:36,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,698 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:14:36,698 INFO L226 Difference]: Without dead ends: 659 [2020-02-10 20:14:36,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-02-10 20:14:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 400. [2020-02-10 20:14:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:14:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1384 transitions. [2020-02-10 20:14:36,707 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,708 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1384 transitions. [2020-02-10 20:14:36,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1384 transitions. [2020-02-10 20:14:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:36,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,708 INFO L415 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] [2020-02-10 20:14:36,708 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash -930093484, now seen corresponding path program 372 times [2020-02-10 20:14:36,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078982178] [2020-02-10 20:14:36,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078982178] [2020-02-10 20:14:36,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:36,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120351878] [2020-02-10 20:14:36,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:36,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:36,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,975 INFO L87 Difference]: Start difference. First operand 400 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,078 INFO L93 Difference]: Finished difference Result 673 states and 1997 transitions. [2020-02-10 20:14:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:37,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,080 INFO L225 Difference]: With dead ends: 673 [2020-02-10 20:14:37,081 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 20:14:37,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 20:14:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 392. [2020-02-10 20:14:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1368 transitions. [2020-02-10 20:14:37,091 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1368 transitions. Word has length 22 [2020-02-10 20:14:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,091 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1368 transitions. [2020-02-10 20:14:37,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1368 transitions. [2020-02-10 20:14:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:37,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,091 INFO L415 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] [2020-02-10 20:14:37,092 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 938605096, now seen corresponding path program 373 times [2020-02-10 20:14:37,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227607887] [2020-02-10 20:14:37,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227607887] [2020-02-10 20:14:37,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:37,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531760493] [2020-02-10 20:14:37,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:37,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:37,394 INFO L87 Difference]: Start difference. First operand 392 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:14:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,472 INFO L93 Difference]: Finished difference Result 672 states and 1996 transitions. [2020-02-10 20:14:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:37,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,474 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:14:37,474 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:14:37,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:14:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2020-02-10 20:14:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1384 transitions. [2020-02-10 20:14:37,484 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,484 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1384 transitions. [2020-02-10 20:14:37,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1384 transitions. [2020-02-10 20:14:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:37,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,485 INFO L415 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] [2020-02-10 20:14:37,485 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1065241470, now seen corresponding path program 374 times [2020-02-10 20:14:37,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073494274] [2020-02-10 20:14:37,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073494274] [2020-02-10 20:14:37,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:37,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084031076] [2020-02-10 20:14:37,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:37,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:37,763 INFO L87 Difference]: Start difference. First operand 399 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,857 INFO L93 Difference]: Finished difference Result 666 states and 1982 transitions. [2020-02-10 20:14:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:37,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,859 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:14:37,859 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:14:37,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:14:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2020-02-10 20:14:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1377 transitions. [2020-02-10 20:14:37,868 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1377 transitions. Word has length 22 [2020-02-10 20:14:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,868 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1377 transitions. [2020-02-10 20:14:37,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1377 transitions. [2020-02-10 20:14:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:37,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,868 INFO L415 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] [2020-02-10 20:14:37,869 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1748047018, now seen corresponding path program 375 times [2020-02-10 20:14:37,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006575200] [2020-02-10 20:14:37,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006575200] [2020-02-10 20:14:38,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:38,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836941053] [2020-02-10 20:14:38,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:38,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:38,148 INFO L87 Difference]: Start difference. First operand 396 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:14:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,221 INFO L93 Difference]: Finished difference Result 681 states and 2014 transitions. [2020-02-10 20:14:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:38,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,223 INFO L225 Difference]: With dead ends: 681 [2020-02-10 20:14:38,223 INFO L226 Difference]: Without dead ends: 665 [2020-02-10 20:14:38,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-02-10 20:14:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 404. [2020-02-10 20:14:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 20:14:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1390 transitions. [2020-02-10 20:14:38,233 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1390 transitions. Word has length 22 [2020-02-10 20:14:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,233 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1390 transitions. [2020-02-10 20:14:38,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1390 transitions. [2020-02-10 20:14:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:38,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:38,234 INFO L415 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] [2020-02-10 20:14:38,234 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1897474686, now seen corresponding path program 376 times [2020-02-10 20:14:38,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063139268] [2020-02-10 20:14:38,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063139268] [2020-02-10 20:14:38,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:38,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726901900] [2020-02-10 20:14:38,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:38,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:38,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:38,510 INFO L87 Difference]: Start difference. First operand 404 states and 1390 transitions. Second operand 9 states. [2020-02-10 20:14:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,621 INFO L93 Difference]: Finished difference Result 679 states and 2004 transitions. [2020-02-10 20:14:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:38,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,623 INFO L225 Difference]: With dead ends: 679 [2020-02-10 20:14:38,623 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:14:38,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:14:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 396. [2020-02-10 20:14:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1373 transitions. [2020-02-10 20:14:38,632 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1373 transitions. Word has length 22 [2020-02-10 20:14:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,632 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1373 transitions. [2020-02-10 20:14:38,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1373 transitions. [2020-02-10 20:14:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:38,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:38,633 INFO L415 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] [2020-02-10 20:14:38,633 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash 527385892, now seen corresponding path program 377 times [2020-02-10 20:14:38,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195138388] [2020-02-10 20:14:38,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195138388] [2020-02-10 20:14:38,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:38,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244704606] [2020-02-10 20:14:38,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:38,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:38,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:38,900 INFO L87 Difference]: Start difference. First operand 396 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:14:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,996 INFO L93 Difference]: Finished difference Result 663 states and 1973 transitions. [2020-02-10 20:14:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:38,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,998 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:14:38,998 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:14:38,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:14:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 398. [2020-02-10 20:14:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-02-10 20:14:39,008 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,008 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-02-10 20:14:39,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-02-10 20:14:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:39,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,009 INFO L415 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] [2020-02-10 20:14:39,009 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash -390564298, now seen corresponding path program 378 times [2020-02-10 20:14:39,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181930039] [2020-02-10 20:14:39,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181930039] [2020-02-10 20:14:39,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:39,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503863138] [2020-02-10 20:14:39,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:39,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:39,271 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,378 INFO L93 Difference]: Finished difference Result 667 states and 1979 transitions. [2020-02-10 20:14:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:39,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,381 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:14:39,381 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 20:14:39,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 20:14:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 392. [2020-02-10 20:14:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:14:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 20:14:39,393 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 20:14:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,393 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 20:14:39,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 20:14:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:39,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,394 INFO L415 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] [2020-02-10 20:14:39,394 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash -255685110, now seen corresponding path program 379 times [2020-02-10 20:14:39,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042608505] [2020-02-10 20:14:39,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042608505] [2020-02-10 20:14:39,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:39,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253248719] [2020-02-10 20:14:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:39,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:39,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:39,670 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:14:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,775 INFO L93 Difference]: Finished difference Result 648 states and 1944 transitions. [2020-02-10 20:14:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:39,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,777 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:14:39,777 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:14:39,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:14:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 396. [2020-02-10 20:14:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1374 transitions. [2020-02-10 20:14:39,788 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1374 transitions. Word has length 22 [2020-02-10 20:14:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,788 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1374 transitions. [2020-02-10 20:14:39,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1374 transitions. [2020-02-10 20:14:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:39,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,789 INFO L415 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] [2020-02-10 20:14:39,789 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1086247678, now seen corresponding path program 380 times [2020-02-10 20:14:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142229649] [2020-02-10 20:14:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142229649] [2020-02-10 20:14:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122420345] [2020-02-10 20:14:40,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:40,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,060 INFO L87 Difference]: Start difference. First operand 396 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:14:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,159 INFO L93 Difference]: Finished difference Result 647 states and 1940 transitions. [2020-02-10 20:14:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:40,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,161 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:14:40,161 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:14:40,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:14:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 394. [2020-02-10 20:14:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 20:14:40,171 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 20:14:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,171 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 20:14:40,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 20:14:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:40,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,171 INFO L415 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] [2020-02-10 20:14:40,171 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1352630072, now seen corresponding path program 381 times [2020-02-10 20:14:40,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60236710] [2020-02-10 20:14:40,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60236710] [2020-02-10 20:14:40,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:40,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827729285] [2020-02-10 20:14:40,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:40,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:40,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,439 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:14:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,535 INFO L93 Difference]: Finished difference Result 653 states and 1953 transitions. [2020-02-10 20:14:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:40,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,537 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:14:40,537 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:14:40,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:14:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 20:14:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1374 transitions. [2020-02-10 20:14:40,545 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1374 transitions. Word has length 22 [2020-02-10 20:14:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,546 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1374 transitions. [2020-02-10 20:14:40,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1374 transitions. [2020-02-10 20:14:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:40,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,546 INFO L415 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] [2020-02-10 20:14:40,546 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2075777240, now seen corresponding path program 382 times [2020-02-10 20:14:40,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713762156] [2020-02-10 20:14:40,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713762156] [2020-02-10 20:14:40,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:40,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971314287] [2020-02-10 20:14:40,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:40,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,810 INFO L87 Difference]: Start difference. First operand 397 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:14:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,917 INFO L93 Difference]: Finished difference Result 656 states and 1956 transitions. [2020-02-10 20:14:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:40,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,919 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:14:40,919 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:14:40,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:14:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-02-10 20:14:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 20:14:40,929 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 20:14:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,929 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 20:14:40,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 20:14:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:40,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,930 INFO L415 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] [2020-02-10 20:14:40,930 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1621477480, now seen corresponding path program 383 times [2020-02-10 20:14:40,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396325669] [2020-02-10 20:14:40,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396325669] [2020-02-10 20:14:41,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:41,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848594029] [2020-02-10 20:14:41,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:41,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:41,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:41,193 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:14:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,305 INFO L93 Difference]: Finished difference Result 650 states and 1944 transitions. [2020-02-10 20:14:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:41,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,307 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:14:41,307 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 20:14:41,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 20:14:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 396. [2020-02-10 20:14:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1370 transitions. [2020-02-10 20:14:41,317 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1370 transitions. Word has length 22 [2020-02-10 20:14:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,317 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1370 transitions. [2020-02-10 20:14:41,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1370 transitions. [2020-02-10 20:14:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:41,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,318 INFO L415 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] [2020-02-10 20:14:41,318 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,318 INFO L82 PathProgramCache]: Analyzing trace with hash 703527290, now seen corresponding path program 384 times [2020-02-10 20:14:41,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089064640] [2020-02-10 20:14:41,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089064640] [2020-02-10 20:14:41,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:41,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814484791] [2020-02-10 20:14:41,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:41,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:41,577 INFO L87 Difference]: Start difference. First operand 396 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:14:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,674 INFO L93 Difference]: Finished difference Result 654 states and 1950 transitions. [2020-02-10 20:14:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:41,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,676 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:14:41,676 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:14:41,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:14:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 388. [2020-02-10 20:14:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:14:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-02-10 20:14:41,686 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-02-10 20:14:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,686 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-02-10 20:14:41,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-02-10 20:14:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:41,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,687 INFO L415 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] [2020-02-10 20:14:41,687 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash 914974018, now seen corresponding path program 385 times [2020-02-10 20:14:41,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933440835] [2020-02-10 20:14:41,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933440835] [2020-02-10 20:14:41,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:41,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303456100] [2020-02-10 20:14:41,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:41,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:41,947 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:14:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,028 INFO L93 Difference]: Finished difference Result 660 states and 1973 transitions. [2020-02-10 20:14:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:42,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,030 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:14:42,030 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 20:14:42,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 20:14:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 398. [2020-02-10 20:14:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1384 transitions. [2020-02-10 20:14:42,040 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,040 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1384 transitions. [2020-02-10 20:14:42,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1384 transitions. [2020-02-10 20:14:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:42,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,040 INFO L415 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] [2020-02-10 20:14:42,041 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1789727392, now seen corresponding path program 386 times [2020-02-10 20:14:42,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569326785] [2020-02-10 20:14:42,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569326785] [2020-02-10 20:14:42,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:42,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185319274] [2020-02-10 20:14:42,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:42,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,282 INFO L87 Difference]: Start difference. First operand 398 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,380 INFO L93 Difference]: Finished difference Result 655 states and 1960 transitions. [2020-02-10 20:14:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:42,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,382 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:14:42,382 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 20:14:42,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 20:14:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 394. [2020-02-10 20:14:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1375 transitions. [2020-02-10 20:14:42,392 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1375 transitions. Word has length 22 [2020-02-10 20:14:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,392 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1375 transitions. [2020-02-10 20:14:42,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1375 transitions. [2020-02-10 20:14:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:42,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,393 INFO L415 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] [2020-02-10 20:14:42,393 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1015886190, now seen corresponding path program 387 times [2020-02-10 20:14:42,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348516658] [2020-02-10 20:14:42,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348516658] [2020-02-10 20:14:42,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339628524] [2020-02-10 20:14:42,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:42,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,645 INFO L87 Difference]: Start difference. First operand 394 states and 1375 transitions. Second operand 9 states. [2020-02-10 20:14:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,720 INFO L93 Difference]: Finished difference Result 658 states and 1965 transitions. [2020-02-10 20:14:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:42,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,722 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:14:42,722 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:14:42,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:14:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 20:14:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-02-10 20:14:42,732 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-02-10 20:14:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,733 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-02-10 20:14:42,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-02-10 20:14:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:42,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,733 INFO L415 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] [2020-02-10 20:14:42,733 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1142522564, now seen corresponding path program 388 times [2020-02-10 20:14:42,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455467763] [2020-02-10 20:14:42,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455467763] [2020-02-10 20:14:42,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:42,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031924267] [2020-02-10 20:14:42,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:42,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,985 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:14:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,084 INFO L93 Difference]: Finished difference Result 652 states and 1951 transitions. [2020-02-10 20:14:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:43,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,085 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:14:43,086 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:14:43,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:14:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-02-10 20:14:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-02-10 20:14:43,095 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-02-10 20:14:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,096 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-02-10 20:14:43,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-02-10 20:14:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:43,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,096 INFO L415 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] [2020-02-10 20:14:43,096 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1272495604, now seen corresponding path program 389 times [2020-02-10 20:14:43,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076299901] [2020-02-10 20:14:43,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:43,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076299901] [2020-02-10 20:14:43,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:43,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175087482] [2020-02-10 20:14:43,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:43,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:43,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:43,351 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:14:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,447 INFO L93 Difference]: Finished difference Result 647 states and 1942 transitions. [2020-02-10 20:14:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:43,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,449 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:14:43,449 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 20:14:43,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 20:14:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 396. [2020-02-10 20:14:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1375 transitions. [2020-02-10 20:14:43,459 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1375 transitions. Word has length 22 [2020-02-10 20:14:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,459 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1375 transitions. [2020-02-10 20:14:43,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1375 transitions. [2020-02-10 20:14:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:43,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,460 INFO L415 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] [2020-02-10 20:14:43,460 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash 69437184, now seen corresponding path program 390 times [2020-02-10 20:14:43,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912638982] [2020-02-10 20:14:43,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912638982] [2020-02-10 20:14:43,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:43,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464395302] [2020-02-10 20:14:43,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:43,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:43,719 INFO L87 Difference]: Start difference. First operand 396 states and 1375 transitions. Second operand 9 states. [2020-02-10 20:14:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,823 INFO L93 Difference]: Finished difference Result 646 states and 1938 transitions. [2020-02-10 20:14:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:43,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,825 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:14:43,825 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:14:43,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:14:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2020-02-10 20:14:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1365 transitions. [2020-02-10 20:14:43,835 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1365 transitions. Word has length 22 [2020-02-10 20:14:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,835 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1365 transitions. [2020-02-10 20:14:43,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1365 transitions. [2020-02-10 20:14:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:43,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,836 INFO L415 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] [2020-02-10 20:14:43,836 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1267564648, now seen corresponding path program 391 times [2020-02-10 20:14:43,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532671404] [2020-02-10 20:14:43,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532671404] [2020-02-10 20:14:44,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:44,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905713120] [2020-02-10 20:14:44,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:44,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:44,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:44,095 INFO L87 Difference]: Start difference. First operand 391 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:14:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,175 INFO L93 Difference]: Finished difference Result 668 states and 1992 transitions. [2020-02-10 20:14:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:44,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,177 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:14:44,177 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 20:14:44,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 20:14:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 399. [2020-02-10 20:14:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1385 transitions. [2020-02-10 20:14:44,187 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1385 transitions. Word has length 22 [2020-02-10 20:14:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,187 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1385 transitions. [2020-02-10 20:14:44,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1385 transitions. [2020-02-10 20:14:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:44,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,188 INFO L415 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] [2020-02-10 20:14:44,188 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash 322701238, now seen corresponding path program 392 times [2020-02-10 20:14:44,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096372887] [2020-02-10 20:14:44,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096372887] [2020-02-10 20:14:44,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:44,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805304566] [2020-02-10 20:14:44,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:44,443 INFO L87 Difference]: Start difference. First operand 399 states and 1385 transitions. Second operand 9 states. [2020-02-10 20:14:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,540 INFO L93 Difference]: Finished difference Result 663 states and 1979 transitions. [2020-02-10 20:14:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:44,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,542 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:14:44,542 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:14:44,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:14:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 395. [2020-02-10 20:14:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1375 transitions. [2020-02-10 20:14:44,552 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1375 transitions. Word has length 22 [2020-02-10 20:14:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,552 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1375 transitions. [2020-02-10 20:14:44,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1375 transitions. [2020-02-10 20:14:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:44,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,553 INFO L415 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] [2020-02-10 20:14:44,553 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 64998280, now seen corresponding path program 393 times [2020-02-10 20:14:44,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444852543] [2020-02-10 20:14:44,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444852543] [2020-02-10 20:14:44,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:44,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063147651] [2020-02-10 20:14:44,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:44,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:44,810 INFO L87 Difference]: Start difference. First operand 395 states and 1375 transitions. Second operand 9 states. [2020-02-10 20:14:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,883 INFO L93 Difference]: Finished difference Result 672 states and 1998 transitions. [2020-02-10 20:14:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:44,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,885 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:14:44,885 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:14:44,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:14:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 401. [2020-02-10 20:14:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1385 transitions. [2020-02-10 20:14:44,894 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1385 transitions. Word has length 22 [2020-02-10 20:14:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,894 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1385 transitions. [2020-02-10 20:14:44,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1385 transitions. [2020-02-10 20:14:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:44,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,895 INFO L415 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] [2020-02-10 20:14:44,895 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1526101748, now seen corresponding path program 394 times [2020-02-10 20:14:44,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036684916] [2020-02-10 20:14:44,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036684916] [2020-02-10 20:14:45,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:45,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179211747] [2020-02-10 20:14:45,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:45,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,146 INFO L87 Difference]: Start difference. First operand 401 states and 1385 transitions. Second operand 9 states. [2020-02-10 20:14:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,244 INFO L93 Difference]: Finished difference Result 669 states and 1987 transitions. [2020-02-10 20:14:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:45,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,246 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:14:45,246 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:14:45,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:14:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 395. [2020-02-10 20:14:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1371 transitions. [2020-02-10 20:14:45,256 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1371 transitions. Word has length 22 [2020-02-10 20:14:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,256 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1371 transitions. [2020-02-10 20:14:45,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1371 transitions. [2020-02-10 20:14:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:45,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,257 INFO L415 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] [2020-02-10 20:14:45,257 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1150298134, now seen corresponding path program 395 times [2020-02-10 20:14:45,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878902279] [2020-02-10 20:14:45,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878902279] [2020-02-10 20:14:45,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:45,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686927949] [2020-02-10 20:14:45,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:45,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,503 INFO L87 Difference]: Start difference. First operand 395 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:14:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,603 INFO L93 Difference]: Finished difference Result 659 states and 1968 transitions. [2020-02-10 20:14:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:45,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,605 INFO L225 Difference]: With dead ends: 659 [2020-02-10 20:14:45,605 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:14:45,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:14:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2020-02-10 20:14:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-02-10 20:14:45,615 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,615 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-02-10 20:14:45,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-02-10 20:14:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:45,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,616 INFO L415 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] [2020-02-10 20:14:45,616 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,616 INFO L82 PathProgramCache]: Analyzing trace with hash 578749200, now seen corresponding path program 396 times [2020-02-10 20:14:45,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447248367] [2020-02-10 20:14:45,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447248367] [2020-02-10 20:14:45,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:45,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979924707] [2020-02-10 20:14:45,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:45,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,867 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,968 INFO L93 Difference]: Finished difference Result 661 states and 1969 transitions. [2020-02-10 20:14:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:45,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,970 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:14:45,970 INFO L226 Difference]: Without dead ends: 641 [2020-02-10 20:14:45,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-02-10 20:14:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 391. [2020-02-10 20:14:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 20:14:45,980 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 20:14:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,980 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 20:14:45,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 20:14:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:45,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,981 INFO L415 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] [2020-02-10 20:14:45,981 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,982 INFO L82 PathProgramCache]: Analyzing trace with hash 320514856, now seen corresponding path program 397 times [2020-02-10 20:14:45,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594675032] [2020-02-10 20:14:45,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594675032] [2020-02-10 20:14:46,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:46,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235474740] [2020-02-10 20:14:46,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:46,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:46,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,245 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:14:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,322 INFO L93 Difference]: Finished difference Result 662 states and 1972 transitions. [2020-02-10 20:14:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:46,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,324 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:14:46,324 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:14:46,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:14:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 397. [2020-02-10 20:14:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-02-10 20:14:46,334 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,334 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-02-10 20:14:46,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-02-10 20:14:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:46,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,335 INFO L415 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] [2020-02-10 20:14:46,335 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 447151230, now seen corresponding path program 398 times [2020-02-10 20:14:46,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113984021] [2020-02-10 20:14:46,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113984021] [2020-02-10 20:14:46,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:46,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759994352] [2020-02-10 20:14:46,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:46,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,584 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,681 INFO L93 Difference]: Finished difference Result 656 states and 1958 transitions. [2020-02-10 20:14:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:46,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,683 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:14:46,683 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 20:14:46,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 20:14:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 394. [2020-02-10 20:14:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 20:14:46,692 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 20:14:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,692 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 20:14:46,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 20:14:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:46,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,693 INFO L415 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] [2020-02-10 20:14:46,693 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash 855744658, now seen corresponding path program 399 times [2020-02-10 20:14:46,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892044615] [2020-02-10 20:14:46,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892044615] [2020-02-10 20:14:46,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:46,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107527511] [2020-02-10 20:14:46,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:46,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,951 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:14:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,024 INFO L93 Difference]: Finished difference Result 668 states and 1984 transitions. [2020-02-10 20:14:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:47,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,026 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:14:47,026 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 20:14:47,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 20:14:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 400. [2020-02-10 20:14:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:14:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1379 transitions. [2020-02-10 20:14:47,036 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1379 transitions. Word has length 22 [2020-02-10 20:14:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,037 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1379 transitions. [2020-02-10 20:14:47,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1379 transitions. [2020-02-10 20:14:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:47,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,037 INFO L415 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] [2020-02-10 20:14:47,037 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1602175584, now seen corresponding path program 400 times [2020-02-10 20:14:47,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052562332] [2020-02-10 20:14:47,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052562332] [2020-02-10 20:14:47,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:47,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948672832] [2020-02-10 20:14:47,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:47,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:47,300 INFO L87 Difference]: Start difference. First operand 400 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:14:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,410 INFO L93 Difference]: Finished difference Result 665 states and 1973 transitions. [2020-02-10 20:14:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:47,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,412 INFO L225 Difference]: With dead ends: 665 [2020-02-10 20:14:47,412 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:14:47,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:14:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 394. [2020-02-10 20:14:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1366 transitions. [2020-02-10 20:14:47,424 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1366 transitions. Word has length 22 [2020-02-10 20:14:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,424 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1366 transitions. [2020-02-10 20:14:47,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1366 transitions. [2020-02-10 20:14:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:47,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,425 INFO L415 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] [2020-02-10 20:14:47,425 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1163789728, now seen corresponding path program 401 times [2020-02-10 20:14:47,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881767979] [2020-02-10 20:14:47,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881767979] [2020-02-10 20:14:47,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:47,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145530223] [2020-02-10 20:14:47,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:47,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:47,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:47,682 INFO L87 Difference]: Start difference. First operand 394 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:14:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,779 INFO L93 Difference]: Finished difference Result 652 states and 1948 transitions. [2020-02-10 20:14:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:47,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,781 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:14:47,781 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:14:47,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:14:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 396. [2020-02-10 20:14:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1369 transitions. [2020-02-10 20:14:47,791 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1369 transitions. Word has length 22 [2020-02-10 20:14:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,791 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1369 transitions. [2020-02-10 20:14:47,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1369 transitions. [2020-02-10 20:14:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:47,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,791 INFO L415 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] [2020-02-10 20:14:47,792 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,792 INFO L82 PathProgramCache]: Analyzing trace with hash -592334922, now seen corresponding path program 402 times [2020-02-10 20:14:47,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175387586] [2020-02-10 20:14:47,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175387586] [2020-02-10 20:14:48,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:48,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671938784] [2020-02-10 20:14:48,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:48,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,067 INFO L87 Difference]: Start difference. First operand 396 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:14:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,168 INFO L93 Difference]: Finished difference Result 655 states and 1952 transitions. [2020-02-10 20:14:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:48,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,170 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:14:48,170 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:14:48,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:14:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 20:14:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:14:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-02-10 20:14:48,182 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-02-10 20:14:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,183 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-02-10 20:14:48,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-02-10 20:14:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:48,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,184 INFO L415 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] [2020-02-10 20:14:48,184 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash -873775350, now seen corresponding path program 403 times [2020-02-10 20:14:48,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725827678] [2020-02-10 20:14:48,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725827678] [2020-02-10 20:14:48,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:48,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94838061] [2020-02-10 20:14:48,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:48,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:48,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,437 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:14:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,547 INFO L93 Difference]: Finished difference Result 641 states and 1927 transitions. [2020-02-10 20:14:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:48,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,550 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:14:48,550 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:14:48,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:14:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 395. [2020-02-10 20:14:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-02-10 20:14:48,560 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-02-10 20:14:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,560 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-02-10 20:14:48,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-02-10 20:14:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:48,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,561 INFO L415 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] [2020-02-10 20:14:48,561 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 468157438, now seen corresponding path program 404 times [2020-02-10 20:14:48,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98102150] [2020-02-10 20:14:48,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98102150] [2020-02-10 20:14:48,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:48,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298526215] [2020-02-10 20:14:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:48,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,821 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:14:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,924 INFO L93 Difference]: Finished difference Result 640 states and 1923 transitions. [2020-02-10 20:14:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:48,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,926 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:14:48,926 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:14:48,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:14:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 393. [2020-02-10 20:14:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 20:14:48,935 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 20:14:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,935 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 20:14:48,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 20:14:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:48,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,936 INFO L415 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] [2020-02-10 20:14:48,936 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash -338545548, now seen corresponding path program 405 times [2020-02-10 20:14:48,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841606170] [2020-02-10 20:14:48,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841606170] [2020-02-10 20:14:49,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:49,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747321058] [2020-02-10 20:14:49,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:49,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:49,187 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:14:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,310 INFO L93 Difference]: Finished difference Result 645 states and 1934 transitions. [2020-02-10 20:14:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:49,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,312 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:14:49,312 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:14:49,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:14:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 396. [2020-02-10 20:14:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:14:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1369 transitions. [2020-02-10 20:14:49,322 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1369 transitions. Word has length 22 [2020-02-10 20:14:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,322 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1369 transitions. [2020-02-10 20:14:49,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1369 transitions. [2020-02-10 20:14:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:49,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,323 INFO L415 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] [2020-02-10 20:14:49,323 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash -566934556, now seen corresponding path program 406 times [2020-02-10 20:14:49,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122976643] [2020-02-10 20:14:49,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122976643] [2020-02-10 20:14:49,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:49,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856176679] [2020-02-10 20:14:49,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:49,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:49,575 INFO L87 Difference]: Start difference. First operand 396 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:14:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,678 INFO L93 Difference]: Finished difference Result 647 states and 1935 transitions. [2020-02-10 20:14:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:49,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,680 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:14:49,680 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:14:49,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:14:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 393. [2020-02-10 20:14:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:14:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 20:14:49,690 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 20:14:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,690 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 20:14:49,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 20:14:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:49,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,690 INFO L415 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] [2020-02-10 20:14:49,691 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash -69698140, now seen corresponding path program 407 times [2020-02-10 20:14:49,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870461010] [2020-02-10 20:14:49,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870461010] [2020-02-10 20:14:49,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:49,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217079129] [2020-02-10 20:14:49,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:49,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:49,948 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:14:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,061 INFO L93 Difference]: Finished difference Result 642 states and 1925 transitions. [2020-02-10 20:14:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:50,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,063 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:14:50,063 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:14:50,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:14:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 395. [2020-02-10 20:14:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:14:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-02-10 20:14:50,073 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-02-10 20:14:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,073 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-02-10 20:14:50,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-02-10 20:14:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:50,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,074 INFO L415 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] [2020-02-10 20:14:50,074 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash 501756666, now seen corresponding path program 408 times [2020-02-10 20:14:50,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092087884] [2020-02-10 20:14:50,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092087884] [2020-02-10 20:14:50,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:50,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59858972] [2020-02-10 20:14:50,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:50,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:50,326 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:14:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,443 INFO L93 Difference]: Finished difference Result 645 states and 1929 transitions. [2020-02-10 20:14:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:50,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,445 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:14:50,445 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:14:50,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:14:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 388. [2020-02-10 20:14:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:14:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 20:14:50,455 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 20:14:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,455 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 20:14:50,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 20:14:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:50,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,456 INFO L415 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] [2020-02-10 20:14:50,456 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1062496130, now seen corresponding path program 409 times [2020-02-10 20:14:50,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799055354] [2020-02-10 20:14:50,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799055354] [2020-02-10 20:14:50,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:50,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099354721] [2020-02-10 20:14:50,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:50,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:50,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:50,728 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:14:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,805 INFO L93 Difference]: Finished difference Result 696 states and 2068 transitions. [2020-02-10 20:14:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:50,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,807 INFO L225 Difference]: With dead ends: 696 [2020-02-10 20:14:50,807 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 20:14:50,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 20:14:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 403. [2020-02-10 20:14:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 20:14:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1397 transitions. [2020-02-10 20:14:50,817 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1397 transitions. Word has length 22 [2020-02-10 20:14:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,817 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1397 transitions. [2020-02-10 20:14:50,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1397 transitions. [2020-02-10 20:14:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:50,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,818 INFO L415 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] [2020-02-10 20:14:50,818 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1642205280, now seen corresponding path program 410 times [2020-02-10 20:14:50,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344565526] [2020-02-10 20:14:50,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344565526] [2020-02-10 20:14:51,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:51,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917932251] [2020-02-10 20:14:51,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:51,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,093 INFO L87 Difference]: Start difference. First operand 403 states and 1397 transitions. Second operand 9 states. [2020-02-10 20:14:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,212 INFO L93 Difference]: Finished difference Result 691 states and 2055 transitions. [2020-02-10 20:14:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:51,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,214 INFO L225 Difference]: With dead ends: 691 [2020-02-10 20:14:51,214 INFO L226 Difference]: Without dead ends: 676 [2020-02-10 20:14:51,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-02-10 20:14:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 399. [2020-02-10 20:14:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1387 transitions. [2020-02-10 20:14:51,224 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1387 transitions. Word has length 22 [2020-02-10 20:14:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,225 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1387 transitions. [2020-02-10 20:14:51,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1387 transitions. [2020-02-10 20:14:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:51,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,225 INFO L415 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] [2020-02-10 20:14:51,225 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1327546994, now seen corresponding path program 411 times [2020-02-10 20:14:51,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505609479] [2020-02-10 20:14:51,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505609479] [2020-02-10 20:14:51,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:51,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356299064] [2020-02-10 20:14:51,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:51,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:51,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,509 INFO L87 Difference]: Start difference. First operand 399 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:14:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,587 INFO L93 Difference]: Finished difference Result 703 states and 2080 transitions. [2020-02-10 20:14:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:51,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,589 INFO L225 Difference]: With dead ends: 703 [2020-02-10 20:14:51,589 INFO L226 Difference]: Without dead ends: 687 [2020-02-10 20:14:51,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-02-10 20:14:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 407. [2020-02-10 20:14:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 20:14:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1400 transitions. [2020-02-10 20:14:51,598 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1400 transitions. Word has length 22 [2020-02-10 20:14:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,598 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1400 transitions. [2020-02-10 20:14:51,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1400 transitions. [2020-02-10 20:14:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:51,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,599 INFO L415 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] [2020-02-10 20:14:51,599 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -170024556, now seen corresponding path program 412 times [2020-02-10 20:14:51,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324793617] [2020-02-10 20:14:51,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324793617] [2020-02-10 20:14:51,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:51,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690744679] [2020-02-10 20:14:51,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:51,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:51,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,879 INFO L87 Difference]: Start difference. First operand 407 states and 1400 transitions. Second operand 9 states. [2020-02-10 20:14:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,989 INFO L93 Difference]: Finished difference Result 701 states and 2070 transitions. [2020-02-10 20:14:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:51,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,991 INFO L225 Difference]: With dead ends: 701 [2020-02-10 20:14:51,991 INFO L226 Difference]: Without dead ends: 679 [2020-02-10 20:14:51,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2020-02-10 20:14:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 399. [2020-02-10 20:14:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:14:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1382 transitions. [2020-02-10 20:14:52,000 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1382 transitions. Word has length 22 [2020-02-10 20:14:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,001 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1382 transitions. [2020-02-10 20:14:52,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1382 transitions. [2020-02-10 20:14:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:52,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,001 INFO L415 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] [2020-02-10 20:14:52,001 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash 112250580, now seen corresponding path program 413 times [2020-02-10 20:14:52,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191563757] [2020-02-10 20:14:52,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191563757] [2020-02-10 20:14:52,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:52,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727391796] [2020-02-10 20:14:52,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:52,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:52,273 INFO L87 Difference]: Start difference. First operand 399 states and 1382 transitions. Second operand 9 states. [2020-02-10 20:14:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,377 INFO L93 Difference]: Finished difference Result 688 states and 2045 transitions. [2020-02-10 20:14:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:52,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,379 INFO L225 Difference]: With dead ends: 688 [2020-02-10 20:14:52,379 INFO L226 Difference]: Without dead ends: 677 [2020-02-10 20:14:52,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-02-10 20:14:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 402. [2020-02-10 20:14:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1387 transitions. [2020-02-10 20:14:52,390 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1387 transitions. Word has length 22 [2020-02-10 20:14:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,390 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1387 transitions. [2020-02-10 20:14:52,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1387 transitions. [2020-02-10 20:14:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:52,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,390 INFO L415 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] [2020-02-10 20:14:52,391 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash 130684606, now seen corresponding path program 414 times [2020-02-10 20:14:52,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617939452] [2020-02-10 20:14:52,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617939452] [2020-02-10 20:14:52,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:52,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161354956] [2020-02-10 20:14:52,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:52,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:52,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:52,661 INFO L87 Difference]: Start difference. First operand 402 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:14:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,764 INFO L93 Difference]: Finished difference Result 691 states and 2048 transitions. [2020-02-10 20:14:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:52,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,766 INFO L225 Difference]: With dead ends: 691 [2020-02-10 20:14:52,766 INFO L226 Difference]: Without dead ends: 669 [2020-02-10 20:14:52,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-02-10 20:14:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 394. [2020-02-10 20:14:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-02-10 20:14:52,776 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-02-10 20:14:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,776 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-02-10 20:14:52,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-02-10 20:14:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:52,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,777 INFO L415 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] [2020-02-10 20:14:52,777 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 217524678, now seen corresponding path program 415 times [2020-02-10 20:14:52,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611642228] [2020-02-10 20:14:52,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611642228] [2020-02-10 20:14:53,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:53,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588068031] [2020-02-10 20:14:53,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:53,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:53,048 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:14:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,127 INFO L93 Difference]: Finished difference Result 692 states and 2055 transitions. [2020-02-10 20:14:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:53,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,129 INFO L225 Difference]: With dead ends: 692 [2020-02-10 20:14:53,129 INFO L226 Difference]: Without dead ends: 676 [2020-02-10 20:14:53,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-02-10 20:14:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 402. [2020-02-10 20:14:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1390 transitions. [2020-02-10 20:14:53,139 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1390 transitions. Word has length 22 [2020-02-10 20:14:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,139 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1390 transitions. [2020-02-10 20:14:53,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1390 transitions. [2020-02-10 20:14:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:53,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,140 INFO L415 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] [2020-02-10 20:14:53,140 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1807790564, now seen corresponding path program 416 times [2020-02-10 20:14:53,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819235530] [2020-02-10 20:14:53,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819235530] [2020-02-10 20:14:53,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:53,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146795831] [2020-02-10 20:14:53,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:53,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:53,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:53,401 INFO L87 Difference]: Start difference. First operand 402 states and 1390 transitions. Second operand 9 states. [2020-02-10 20:14:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,502 INFO L93 Difference]: Finished difference Result 687 states and 2042 transitions. [2020-02-10 20:14:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:53,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,504 INFO L225 Difference]: With dead ends: 687 [2020-02-10 20:14:53,504 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 20:14:53,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 20:14:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 398. [2020-02-10 20:14:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1380 transitions. [2020-02-10 20:14:53,514 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1380 transitions. Word has length 22 [2020-02-10 20:14:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,514 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1380 transitions. [2020-02-10 20:14:53,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1380 transitions. [2020-02-10 20:14:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:53,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,514 INFO L415 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] [2020-02-10 20:14:53,515 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1550087606, now seen corresponding path program 417 times [2020-02-10 20:14:53,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219400943] [2020-02-10 20:14:53,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219400943] [2020-02-10 20:14:53,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:53,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628614184] [2020-02-10 20:14:53,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:53,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:53,796 INFO L87 Difference]: Start difference. First operand 398 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:14:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,875 INFO L93 Difference]: Finished difference Result 696 states and 2061 transitions. [2020-02-10 20:14:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:53,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,877 INFO L225 Difference]: With dead ends: 696 [2020-02-10 20:14:53,877 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 20:14:53,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 20:14:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 404. [2020-02-10 20:14:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 20:14:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1390 transitions. [2020-02-10 20:14:53,887 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1390 transitions. Word has length 22 [2020-02-10 20:14:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,887 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1390 transitions. [2020-02-10 20:14:53,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1390 transitions. [2020-02-10 20:14:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:53,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,899 INFO L415 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] [2020-02-10 20:14:53,899 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,899 INFO L82 PathProgramCache]: Analyzing trace with hash -41012422, now seen corresponding path program 418 times [2020-02-10 20:14:53,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807085486] [2020-02-10 20:14:53,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807085486] [2020-02-10 20:14:54,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:54,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145113420] [2020-02-10 20:14:54,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:54,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,164 INFO L87 Difference]: Start difference. First operand 404 states and 1390 transitions. Second operand 9 states. [2020-02-10 20:14:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,280 INFO L93 Difference]: Finished difference Result 693 states and 2050 transitions. [2020-02-10 20:14:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:54,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,282 INFO L225 Difference]: With dead ends: 693 [2020-02-10 20:14:54,282 INFO L226 Difference]: Without dead ends: 674 [2020-02-10 20:14:54,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-02-10 20:14:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 398. [2020-02-10 20:14:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:14:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-02-10 20:14:54,292 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,292 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-02-10 20:14:54,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-02-10 20:14:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:54,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,293 INFO L415 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] [2020-02-10 20:14:54,293 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 334791192, now seen corresponding path program 419 times [2020-02-10 20:14:54,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960698967] [2020-02-10 20:14:54,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960698967] [2020-02-10 20:14:54,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:54,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470961490] [2020-02-10 20:14:54,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:54,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,556 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,658 INFO L93 Difference]: Finished difference Result 683 states and 2031 transitions. [2020-02-10 20:14:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:54,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,660 INFO L225 Difference]: With dead ends: 683 [2020-02-10 20:14:54,661 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 20:14:54,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 20:14:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 401. [2020-02-10 20:14:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:14:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1381 transitions. [2020-02-10 20:14:54,670 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1381 transitions. Word has length 22 [2020-02-10 20:14:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,670 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1381 transitions. [2020-02-10 20:14:54,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1381 transitions. [2020-02-10 20:14:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:54,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,671 INFO L415 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] [2020-02-10 20:14:54,671 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2063838526, now seen corresponding path program 420 times [2020-02-10 20:14:54,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326442774] [2020-02-10 20:14:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326442774] [2020-02-10 20:14:54,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:54,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123526516] [2020-02-10 20:14:54,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:54,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,935 INFO L87 Difference]: Start difference. First operand 401 states and 1381 transitions. Second operand 9 states. [2020-02-10 20:14:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,042 INFO L93 Difference]: Finished difference Result 685 states and 2032 transitions. [2020-02-10 20:14:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:55,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,044 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:14:55,044 INFO L226 Difference]: Without dead ends: 665 [2020-02-10 20:14:55,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-02-10 20:14:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 394. [2020-02-10 20:14:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1366 transitions. [2020-02-10 20:14:55,053 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1366 transitions. Word has length 22 [2020-02-10 20:14:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,054 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1366 transitions. [2020-02-10 20:14:55,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1366 transitions. [2020-02-10 20:14:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:55,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,054 INFO L415 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] [2020-02-10 20:14:55,054 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash -312675198, now seen corresponding path program 421 times [2020-02-10 20:14:55,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124626899] [2020-02-10 20:14:55,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124626899] [2020-02-10 20:14:55,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:55,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747858998] [2020-02-10 20:14:55,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:55,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:55,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:55,343 INFO L87 Difference]: Start difference. First operand 394 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:14:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,436 INFO L93 Difference]: Finished difference Result 712 states and 2100 transitions. [2020-02-10 20:14:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:55,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,438 INFO L225 Difference]: With dead ends: 712 [2020-02-10 20:14:55,438 INFO L226 Difference]: Without dead ends: 696 [2020-02-10 20:14:55,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-02-10 20:14:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 410. [2020-02-10 20:14:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-02-10 20:14:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1404 transitions. [2020-02-10 20:14:55,449 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1404 transitions. Word has length 22 [2020-02-10 20:14:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,450 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 1404 transitions. [2020-02-10 20:14:55,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1404 transitions. [2020-02-10 20:14:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:55,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,451 INFO L415 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] [2020-02-10 20:14:55,451 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1810246748, now seen corresponding path program 422 times [2020-02-10 20:14:55,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272382917] [2020-02-10 20:14:55,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272382917] [2020-02-10 20:14:55,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:55,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537668191] [2020-02-10 20:14:55,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:55,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:55,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:55,738 INFO L87 Difference]: Start difference. First operand 410 states and 1404 transitions. Second operand 9 states. [2020-02-10 20:14:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,841 INFO L93 Difference]: Finished difference Result 710 states and 2090 transitions. [2020-02-10 20:14:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:55,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,843 INFO L225 Difference]: With dead ends: 710 [2020-02-10 20:14:55,843 INFO L226 Difference]: Without dead ends: 688 [2020-02-10 20:14:55,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-02-10 20:14:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 402. [2020-02-10 20:14:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1384 transitions. [2020-02-10 20:14:55,854 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1384 transitions. Word has length 22 [2020-02-10 20:14:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,854 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1384 transitions. [2020-02-10 20:14:55,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1384 transitions. [2020-02-10 20:14:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:55,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,854 INFO L415 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] [2020-02-10 20:14:55,855 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1176729798, now seen corresponding path program 423 times [2020-02-10 20:14:55,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406508848] [2020-02-10 20:14:55,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406508848] [2020-02-10 20:14:56,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:56,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832555781] [2020-02-10 20:14:56,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:56,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:56,154 INFO L87 Difference]: Start difference. First operand 402 states and 1384 transitions. Second operand 9 states. [2020-02-10 20:14:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,233 INFO L93 Difference]: Finished difference Result 709 states and 2087 transitions. [2020-02-10 20:14:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:56,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,236 INFO L225 Difference]: With dead ends: 709 [2020-02-10 20:14:56,236 INFO L226 Difference]: Without dead ends: 693 [2020-02-10 20:14:56,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-02-10 20:14:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 408. [2020-02-10 20:14:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-02-10 20:14:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1394 transitions. [2020-02-10 20:14:56,249 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1394 transitions. Word has length 22 [2020-02-10 20:14:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,249 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 1394 transitions. [2020-02-10 20:14:56,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1394 transitions. [2020-02-10 20:14:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:56,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,249 INFO L415 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] [2020-02-10 20:14:56,250 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash -414370230, now seen corresponding path program 424 times [2020-02-10 20:14:56,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512544183] [2020-02-10 20:14:56,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512544183] [2020-02-10 20:14:56,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:56,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879769554] [2020-02-10 20:14:56,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:56,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:56,533 INFO L87 Difference]: Start difference. First operand 408 states and 1394 transitions. Second operand 9 states. [2020-02-10 20:14:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,639 INFO L93 Difference]: Finished difference Result 706 states and 2076 transitions. [2020-02-10 20:14:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:56,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,641 INFO L225 Difference]: With dead ends: 706 [2020-02-10 20:14:56,641 INFO L226 Difference]: Without dead ends: 687 [2020-02-10 20:14:56,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-02-10 20:14:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 402. [2020-02-10 20:14:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1378 transitions. [2020-02-10 20:14:56,651 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1378 transitions. Word has length 22 [2020-02-10 20:14:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,651 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1378 transitions. [2020-02-10 20:14:56,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1378 transitions. [2020-02-10 20:14:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:56,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,652 INFO L415 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] [2020-02-10 20:14:56,652 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,652 INFO L82 PathProgramCache]: Analyzing trace with hash 430284376, now seen corresponding path program 425 times [2020-02-10 20:14:56,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318917286] [2020-02-10 20:14:56,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318917286] [2020-02-10 20:14:56,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:56,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368937816] [2020-02-10 20:14:56,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:56,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:56,945 INFO L87 Difference]: Start difference. First operand 402 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:14:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,055 INFO L93 Difference]: Finished difference Result 704 states and 2073 transitions. [2020-02-10 20:14:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:57,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,058 INFO L225 Difference]: With dead ends: 704 [2020-02-10 20:14:57,058 INFO L226 Difference]: Without dead ends: 690 [2020-02-10 20:14:57,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-02-10 20:14:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 407. [2020-02-10 20:14:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 20:14:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1387 transitions. [2020-02-10 20:14:57,068 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1387 transitions. Word has length 22 [2020-02-10 20:14:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,068 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1387 transitions. [2020-02-10 20:14:57,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1387 transitions. [2020-02-10 20:14:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:57,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,069 INFO L415 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] [2020-02-10 20:14:57,069 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 485695636, now seen corresponding path program 426 times [2020-02-10 20:14:57,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305793893] [2020-02-10 20:14:57,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305793893] [2020-02-10 20:14:57,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:57,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29552808] [2020-02-10 20:14:57,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:57,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:57,358 INFO L87 Difference]: Start difference. First operand 407 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:14:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,464 INFO L93 Difference]: Finished difference Result 703 states and 2066 transitions. [2020-02-10 20:14:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:57,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,466 INFO L225 Difference]: With dead ends: 703 [2020-02-10 20:14:57,466 INFO L226 Difference]: Without dead ends: 677 [2020-02-10 20:14:57,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-02-10 20:14:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 394. [2020-02-10 20:14:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:14:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-02-10 20:14:57,476 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-02-10 20:14:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,476 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-02-10 20:14:57,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-02-10 20:14:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:57,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,477 INFO L415 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] [2020-02-10 20:14:57,477 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1693910304, now seen corresponding path program 427 times [2020-02-10 20:14:57,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747083879] [2020-02-10 20:14:57,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747083879] [2020-02-10 20:14:57,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:57,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992980144] [2020-02-10 20:14:57,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:57,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:57,747 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:14:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,853 INFO L93 Difference]: Finished difference Result 679 states and 2021 transitions. [2020-02-10 20:14:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:57,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,855 INFO L225 Difference]: With dead ends: 679 [2020-02-10 20:14:57,855 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 20:14:57,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 20:14:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 400. [2020-02-10 20:14:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:14:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1376 transitions. [2020-02-10 20:14:57,864 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1376 transitions. Word has length 22 [2020-02-10 20:14:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,864 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1376 transitions. [2020-02-10 20:14:57,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1376 transitions. [2020-02-10 20:14:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:57,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,865 INFO L415 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] [2020-02-10 20:14:57,865 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1712344330, now seen corresponding path program 428 times [2020-02-10 20:14:57,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485939963] [2020-02-10 20:14:57,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485939963] [2020-02-10 20:14:58,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:58,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749263568] [2020-02-10 20:14:58,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:58,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:58,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:58,129 INFO L87 Difference]: Start difference. First operand 400 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:14:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,239 INFO L93 Difference]: Finished difference Result 682 states and 2024 transitions. [2020-02-10 20:14:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:58,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,241 INFO L225 Difference]: With dead ends: 682 [2020-02-10 20:14:58,241 INFO L226 Difference]: Without dead ends: 665 [2020-02-10 20:14:58,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-02-10 20:14:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 397. [2020-02-10 20:14:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1368 transitions. [2020-02-10 20:14:58,250 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1368 transitions. Word has length 22 [2020-02-10 20:14:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,250 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1368 transitions. [2020-02-10 20:14:58,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1368 transitions. [2020-02-10 20:14:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:58,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,251 INFO L415 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] [2020-02-10 20:14:58,251 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1111651996, now seen corresponding path program 429 times [2020-02-10 20:14:58,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126672012] [2020-02-10 20:14:58,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126672012] [2020-02-10 20:14:58,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:58,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389160602] [2020-02-10 20:14:58,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:58,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:58,515 INFO L87 Difference]: Start difference. First operand 397 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:14:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,616 INFO L93 Difference]: Finished difference Result 678 states and 2016 transitions. [2020-02-10 20:14:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:58,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,618 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:14:58,618 INFO L226 Difference]: Without dead ends: 667 [2020-02-10 20:14:58,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-02-10 20:14:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 400. [2020-02-10 20:14:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:14:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1373 transitions. [2020-02-10 20:14:58,628 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1373 transitions. Word has length 22 [2020-02-10 20:14:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,628 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1373 transitions. [2020-02-10 20:14:58,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1373 transitions. [2020-02-10 20:14:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:58,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,629 INFO L415 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] [2020-02-10 20:14:58,629 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 617395338, now seen corresponding path program 430 times [2020-02-10 20:14:58,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450949218] [2020-02-10 20:14:58,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450949218] [2020-02-10 20:14:58,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:58,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798171618] [2020-02-10 20:14:58,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:58,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:58,893 INFO L87 Difference]: Start difference. First operand 400 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:14:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,996 INFO L93 Difference]: Finished difference Result 680 states and 2017 transitions. [2020-02-10 20:14:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:58,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:58,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,998 INFO L225 Difference]: With dead ends: 680 [2020-02-10 20:14:58,998 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 20:14:58,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 20:14:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 397. [2020-02-10 20:14:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:14:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1365 transitions. [2020-02-10 20:14:59,008 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1365 transitions. Word has length 22 [2020-02-10 20:14:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,008 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1365 transitions. [2020-02-10 20:14:59,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1365 transitions. [2020-02-10 20:14:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:59,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,009 INFO L415 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] [2020-02-10 20:14:59,009 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash -521763164, now seen corresponding path program 431 times [2020-02-10 20:14:59,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524772534] [2020-02-10 20:14:59,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524772534] [2020-02-10 20:14:59,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:59,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045673313] [2020-02-10 20:14:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:59,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:59,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:59,274 INFO L87 Difference]: Start difference. First operand 397 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:14:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,384 INFO L93 Difference]: Finished difference Result 686 states and 2031 transitions. [2020-02-10 20:14:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:59,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,386 INFO L225 Difference]: With dead ends: 686 [2020-02-10 20:14:59,387 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 20:14:59,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 20:14:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 402. [2020-02-10 20:14:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:14:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1374 transitions. [2020-02-10 20:14:59,397 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1374 transitions. Word has length 22 [2020-02-10 20:14:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,397 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1374 transitions. [2020-02-10 20:14:59,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1374 transitions. [2020-02-10 20:14:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:59,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,398 INFO L415 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] [2020-02-10 20:14:59,398 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1188850144, now seen corresponding path program 432 times [2020-02-10 20:14:59,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660227519] [2020-02-10 20:14:59,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660227519] [2020-02-10 20:14:59,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:14:59,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755433929] [2020-02-10 20:14:59,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:14:59,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:14:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:59,682 INFO L87 Difference]: Start difference. First operand 402 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:14:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,804 INFO L93 Difference]: Finished difference Result 685 states and 2024 transitions. [2020-02-10 20:14:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:14:59,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:14:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,806 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:14:59,806 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 20:14:59,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 20:14:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 388. [2020-02-10 20:14:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:14:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1347 transitions. [2020-02-10 20:14:59,817 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1347 transitions. Word has length 22 [2020-02-10 20:14:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,817 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1347 transitions. [2020-02-10 20:14:59,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:14:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1347 transitions. [2020-02-10 20:14:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:14:59,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,818 INFO L415 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] [2020-02-10 20:14:59,818 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash 856930222, now seen corresponding path program 433 times [2020-02-10 20:14:59,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7398124] [2020-02-10 20:14:59,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7398124] [2020-02-10 20:15:00,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:00,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077463194] [2020-02-10 20:15:00,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:00,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,097 INFO L87 Difference]: Start difference. First operand 388 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:15:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,188 INFO L93 Difference]: Finished difference Result 682 states and 2018 transitions. [2020-02-10 20:15:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:00,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,190 INFO L225 Difference]: With dead ends: 682 [2020-02-10 20:15:00,190 INFO L226 Difference]: Without dead ends: 666 [2020-02-10 20:15:00,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-02-10 20:15:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 400. [2020-02-10 20:15:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:15:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1381 transitions. [2020-02-10 20:15:00,200 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1381 transitions. Word has length 22 [2020-02-10 20:15:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,200 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1381 transitions. [2020-02-10 20:15:00,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1381 transitions. [2020-02-10 20:15:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:00,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,201 INFO L415 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] [2020-02-10 20:15:00,201 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash 983566596, now seen corresponding path program 434 times [2020-02-10 20:15:00,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620879479] [2020-02-10 20:15:00,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620879479] [2020-02-10 20:15:00,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:00,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181565567] [2020-02-10 20:15:00,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:00,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,484 INFO L87 Difference]: Start difference. First operand 400 states and 1381 transitions. Second operand 9 states. [2020-02-10 20:15:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,586 INFO L93 Difference]: Finished difference Result 676 states and 2004 transitions. [2020-02-10 20:15:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:00,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,588 INFO L225 Difference]: With dead ends: 676 [2020-02-10 20:15:00,588 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 20:15:00,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 20:15:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 397. [2020-02-10 20:15:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1374 transitions. [2020-02-10 20:15:00,599 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1374 transitions. Word has length 22 [2020-02-10 20:15:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,599 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1374 transitions. [2020-02-10 20:15:00,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1374 transitions. [2020-02-10 20:15:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:00,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,599 INFO L415 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] [2020-02-10 20:15:00,600 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1829721892, now seen corresponding path program 435 times [2020-02-10 20:15:00,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196222071] [2020-02-10 20:15:00,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196222071] [2020-02-10 20:15:00,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:00,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108248711] [2020-02-10 20:15:00,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:00,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,879 INFO L87 Difference]: Start difference. First operand 397 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:15:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,955 INFO L93 Difference]: Finished difference Result 691 states and 2036 transitions. [2020-02-10 20:15:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:00,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,957 INFO L225 Difference]: With dead ends: 691 [2020-02-10 20:15:00,957 INFO L226 Difference]: Without dead ends: 675 [2020-02-10 20:15:00,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2020-02-10 20:15:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 405. [2020-02-10 20:15:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 20:15:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1387 transitions. [2020-02-10 20:15:00,966 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1387 transitions. Word has length 22 [2020-02-10 20:15:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,966 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1387 transitions. [2020-02-10 20:15:00,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1387 transitions. [2020-02-10 20:15:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:00,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,967 INFO L415 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] [2020-02-10 20:15:00,967 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1815799812, now seen corresponding path program 436 times [2020-02-10 20:15:00,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364585760] [2020-02-10 20:15:00,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364585760] [2020-02-10 20:15:01,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:01,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207374370] [2020-02-10 20:15:01,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:01,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:01,235 INFO L87 Difference]: Start difference. First operand 405 states and 1387 transitions. Second operand 9 states. [2020-02-10 20:15:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,342 INFO L93 Difference]: Finished difference Result 689 states and 2026 transitions. [2020-02-10 20:15:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:01,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,345 INFO L225 Difference]: With dead ends: 689 [2020-02-10 20:15:01,345 INFO L226 Difference]: Without dead ends: 667 [2020-02-10 20:15:01,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-02-10 20:15:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 397. [2020-02-10 20:15:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1370 transitions. [2020-02-10 20:15:01,357 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1370 transitions. Word has length 22 [2020-02-10 20:15:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,357 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1370 transitions. [2020-02-10 20:15:01,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1370 transitions. [2020-02-10 20:15:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:01,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,357 INFO L415 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] [2020-02-10 20:15:01,358 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 445711018, now seen corresponding path program 437 times [2020-02-10 20:15:01,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150154743] [2020-02-10 20:15:01,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150154743] [2020-02-10 20:15:01,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:01,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375492933] [2020-02-10 20:15:01,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:01,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:01,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:01,629 INFO L87 Difference]: Start difference. First operand 397 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:15:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,729 INFO L93 Difference]: Finished difference Result 673 states and 1995 transitions. [2020-02-10 20:15:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:01,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,731 INFO L225 Difference]: With dead ends: 673 [2020-02-10 20:15:01,731 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 20:15:01,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 20:15:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 399. [2020-02-10 20:15:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1373 transitions. [2020-02-10 20:15:01,741 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1373 transitions. Word has length 22 [2020-02-10 20:15:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,741 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1373 transitions. [2020-02-10 20:15:01,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1373 transitions. [2020-02-10 20:15:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:01,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,742 INFO L415 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] [2020-02-10 20:15:01,742 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -472239172, now seen corresponding path program 438 times [2020-02-10 20:15:01,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504544802] [2020-02-10 20:15:01,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504544802] [2020-02-10 20:15:02,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:02,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173859582] [2020-02-10 20:15:02,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:02,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,011 INFO L87 Difference]: Start difference. First operand 399 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:15:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,121 INFO L93 Difference]: Finished difference Result 677 states and 2001 transitions. [2020-02-10 20:15:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:02,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,123 INFO L225 Difference]: With dead ends: 677 [2020-02-10 20:15:02,123 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:15:02,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:15:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 393. [2020-02-10 20:15:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1361 transitions. [2020-02-10 20:15:02,132 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,132 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1361 transitions. [2020-02-10 20:15:02,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1361 transitions. [2020-02-10 20:15:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:02,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,133 INFO L415 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] [2020-02-10 20:15:02,133 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1951021810, now seen corresponding path program 439 times [2020-02-10 20:15:02,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174891982] [2020-02-10 20:15:02,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174891982] [2020-02-10 20:15:02,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:02,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358917499] [2020-02-10 20:15:02,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:02,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:02,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,402 INFO L87 Difference]: Start difference. First operand 393 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,479 INFO L93 Difference]: Finished difference Result 678 states and 2006 transitions. [2020-02-10 20:15:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:02,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,481 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:15:02,481 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:15:02,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:15:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 399. [2020-02-10 20:15:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1375 transitions. [2020-02-10 20:15:02,491 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1375 transitions. Word has length 22 [2020-02-10 20:15:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,491 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1375 transitions. [2020-02-10 20:15:02,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1375 transitions. [2020-02-10 20:15:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:02,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,492 INFO L415 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] [2020-02-10 20:15:02,492 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2077658184, now seen corresponding path program 440 times [2020-02-10 20:15:02,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167270492] [2020-02-10 20:15:02,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167270492] [2020-02-10 20:15:02,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:02,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190575761] [2020-02-10 20:15:02,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:02,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,770 INFO L87 Difference]: Start difference. First operand 399 states and 1375 transitions. Second operand 9 states. [2020-02-10 20:15:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,880 INFO L93 Difference]: Finished difference Result 672 states and 1992 transitions. [2020-02-10 20:15:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:02,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,882 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:15:02,882 INFO L226 Difference]: Without dead ends: 659 [2020-02-10 20:15:02,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-02-10 20:15:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 396. [2020-02-10 20:15:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1368 transitions. [2020-02-10 20:15:02,892 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,892 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1368 transitions. [2020-02-10 20:15:02,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1368 transitions. [2020-02-10 20:15:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:02,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,893 INFO L415 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] [2020-02-10 20:15:02,893 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1808715684, now seen corresponding path program 441 times [2020-02-10 20:15:02,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400476457] [2020-02-10 20:15:02,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400476457] [2020-02-10 20:15:03,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:03,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312646242] [2020-02-10 20:15:03,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:03,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,168 INFO L87 Difference]: Start difference. First operand 396 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,245 INFO L93 Difference]: Finished difference Result 684 states and 2018 transitions. [2020-02-10 20:15:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:03,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,247 INFO L225 Difference]: With dead ends: 684 [2020-02-10 20:15:03,247 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 20:15:03,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 20:15:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 402. [2020-02-10 20:15:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:15:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1378 transitions. [2020-02-10 20:15:03,256 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1378 transitions. Word has length 22 [2020-02-10 20:15:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,256 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1378 transitions. [2020-02-10 20:15:03,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1378 transitions. [2020-02-10 20:15:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:03,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,257 INFO L415 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] [2020-02-10 20:15:03,257 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1062284758, now seen corresponding path program 442 times [2020-02-10 20:15:03,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624489632] [2020-02-10 20:15:03,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624489632] [2020-02-10 20:15:03,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:03,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150529855] [2020-02-10 20:15:03,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:03,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:03,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,524 INFO L87 Difference]: Start difference. First operand 402 states and 1378 transitions. Second operand 9 states. [2020-02-10 20:15:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,629 INFO L93 Difference]: Finished difference Result 681 states and 2007 transitions. [2020-02-10 20:15:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:03,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,631 INFO L225 Difference]: With dead ends: 681 [2020-02-10 20:15:03,631 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:15:03,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:15:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 396. [2020-02-10 20:15:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1365 transitions. [2020-02-10 20:15:03,642 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1365 transitions. Word has length 22 [2020-02-10 20:15:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,642 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1365 transitions. [2020-02-10 20:15:03,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1365 transitions. [2020-02-10 20:15:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:03,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,643 INFO L415 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] [2020-02-10 20:15:03,643 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash 466717226, now seen corresponding path program 443 times [2020-02-10 20:15:03,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761078045] [2020-02-10 20:15:03,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761078045] [2020-02-10 20:15:03,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:03,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495524127] [2020-02-10 20:15:03,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:03,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:03,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,911 INFO L87 Difference]: Start difference. First operand 396 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:15:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,034 INFO L93 Difference]: Finished difference Result 668 states and 1982 transitions. [2020-02-10 20:15:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:04,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,036 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:15:04,036 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 20:15:04,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 20:15:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 398. [2020-02-10 20:15:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:15:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1368 transitions. [2020-02-10 20:15:04,046 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,046 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1368 transitions. [2020-02-10 20:15:04,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1368 transitions. [2020-02-10 20:15:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:04,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,047 INFO L415 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] [2020-02-10 20:15:04,047 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1038172032, now seen corresponding path program 444 times [2020-02-10 20:15:04,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850603495] [2020-02-10 20:15:04,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850603495] [2020-02-10 20:15:04,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:04,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350187156] [2020-02-10 20:15:04,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:04,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:04,323 INFO L87 Difference]: Start difference. First operand 398 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,429 INFO L93 Difference]: Finished difference Result 671 states and 1986 transitions. [2020-02-10 20:15:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:04,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,431 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:15:04,431 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:15:04,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:15:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 393. [2020-02-10 20:15:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1358 transitions. [2020-02-10 20:15:04,440 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,440 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1358 transitions. [2020-02-10 20:15:04,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1358 transitions. [2020-02-10 20:15:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:04,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,441 INFO L415 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] [2020-02-10 20:15:04,441 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1877500082, now seen corresponding path program 445 times [2020-02-10 20:15:04,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233147588] [2020-02-10 20:15:04,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233147588] [2020-02-10 20:15:04,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:04,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723140757] [2020-02-10 20:15:04,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:04,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:04,729 INFO L87 Difference]: Start difference. First operand 393 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,821 INFO L93 Difference]: Finished difference Result 704 states and 2069 transitions. [2020-02-10 20:15:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:04,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,823 INFO L225 Difference]: With dead ends: 704 [2020-02-10 20:15:04,823 INFO L226 Difference]: Without dead ends: 688 [2020-02-10 20:15:04,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-02-10 20:15:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 409. [2020-02-10 20:15:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-02-10 20:15:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1396 transitions. [2020-02-10 20:15:04,833 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1396 transitions. Word has length 22 [2020-02-10 20:15:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,833 INFO L479 AbstractCegarLoop]: Abstraction has 409 states and 1396 transitions. [2020-02-10 20:15:04,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1396 transitions. [2020-02-10 20:15:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:04,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,834 INFO L415 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] [2020-02-10 20:15:04,834 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1228054490, now seen corresponding path program 446 times [2020-02-10 20:15:04,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550177866] [2020-02-10 20:15:04,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550177866] [2020-02-10 20:15:05,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:05,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794262641] [2020-02-10 20:15:05,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:05,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,126 INFO L87 Difference]: Start difference. First operand 409 states and 1396 transitions. Second operand 9 states. [2020-02-10 20:15:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,228 INFO L93 Difference]: Finished difference Result 702 states and 2059 transitions. [2020-02-10 20:15:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:05,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,230 INFO L225 Difference]: With dead ends: 702 [2020-02-10 20:15:05,230 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 20:15:05,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 20:15:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 401. [2020-02-10 20:15:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:15:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1376 transitions. [2020-02-10 20:15:05,240 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1376 transitions. Word has length 22 [2020-02-10 20:15:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,240 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1376 transitions. [2020-02-10 20:15:05,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1376 transitions. [2020-02-10 20:15:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:05,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,241 INFO L415 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] [2020-02-10 20:15:05,241 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash 804414702, now seen corresponding path program 447 times [2020-02-10 20:15:05,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562506164] [2020-02-10 20:15:05,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562506164] [2020-02-10 20:15:05,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:05,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876723144] [2020-02-10 20:15:05,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:05,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:05,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,523 INFO L87 Difference]: Start difference. First operand 401 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:15:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,601 INFO L93 Difference]: Finished difference Result 701 states and 2056 transitions. [2020-02-10 20:15:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:05,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,603 INFO L225 Difference]: With dead ends: 701 [2020-02-10 20:15:05,604 INFO L226 Difference]: Without dead ends: 685 [2020-02-10 20:15:05,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-02-10 20:15:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 407. [2020-02-10 20:15:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 20:15:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1386 transitions. [2020-02-10 20:15:05,613 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1386 transitions. Word has length 22 [2020-02-10 20:15:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,614 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1386 transitions. [2020-02-10 20:15:05,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1386 transitions. [2020-02-10 20:15:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:05,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,614 INFO L415 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] [2020-02-10 20:15:05,615 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1550845628, now seen corresponding path program 448 times [2020-02-10 20:15:05,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375521302] [2020-02-10 20:15:05,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375521302] [2020-02-10 20:15:05,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:05,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359381681] [2020-02-10 20:15:05,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:05,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,891 INFO L87 Difference]: Start difference. First operand 407 states and 1386 transitions. Second operand 9 states. [2020-02-10 20:15:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,995 INFO L93 Difference]: Finished difference Result 698 states and 2045 transitions. [2020-02-10 20:15:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:05,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,997 INFO L225 Difference]: With dead ends: 698 [2020-02-10 20:15:05,997 INFO L226 Difference]: Without dead ends: 679 [2020-02-10 20:15:05,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2020-02-10 20:15:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 401. [2020-02-10 20:15:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:15:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1370 transitions. [2020-02-10 20:15:06,007 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1370 transitions. Word has length 22 [2020-02-10 20:15:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,007 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1370 transitions. [2020-02-10 20:15:06,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1370 transitions. [2020-02-10 20:15:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:06,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,008 INFO L415 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] [2020-02-10 20:15:06,008 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1377366140, now seen corresponding path program 449 times [2020-02-10 20:15:06,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683250879] [2020-02-10 20:15:06,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683250879] [2020-02-10 20:15:06,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:06,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253651611] [2020-02-10 20:15:06,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:06,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:06,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:06,296 INFO L87 Difference]: Start difference. First operand 401 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:15:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,398 INFO L93 Difference]: Finished difference Result 696 states and 2042 transitions. [2020-02-10 20:15:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:06,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,400 INFO L225 Difference]: With dead ends: 696 [2020-02-10 20:15:06,400 INFO L226 Difference]: Without dead ends: 682 [2020-02-10 20:15:06,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-02-10 20:15:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 406. [2020-02-10 20:15:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 20:15:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1379 transitions. [2020-02-10 20:15:06,409 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1379 transitions. Word has length 22 [2020-02-10 20:15:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,409 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1379 transitions. [2020-02-10 20:15:06,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1379 transitions. [2020-02-10 20:15:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:06,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,410 INFO L415 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] [2020-02-10 20:15:06,410 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1321954880, now seen corresponding path program 450 times [2020-02-10 20:15:06,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403028545] [2020-02-10 20:15:06,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403028545] [2020-02-10 20:15:06,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:06,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966661524] [2020-02-10 20:15:06,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:06,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:06,691 INFO L87 Difference]: Start difference. First operand 406 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:15:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,804 INFO L93 Difference]: Finished difference Result 695 states and 2035 transitions. [2020-02-10 20:15:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:06,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,806 INFO L225 Difference]: With dead ends: 695 [2020-02-10 20:15:06,806 INFO L226 Difference]: Without dead ends: 669 [2020-02-10 20:15:06,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-02-10 20:15:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 393. [2020-02-10 20:15:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-02-10 20:15:06,815 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-02-10 20:15:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,815 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-02-10 20:15:06,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-02-10 20:15:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:06,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,816 INFO L415 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] [2020-02-10 20:15:06,816 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2046148872, now seen corresponding path program 451 times [2020-02-10 20:15:06,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221759821] [2020-02-10 20:15:06,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221759821] [2020-02-10 20:15:07,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:07,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062769699] [2020-02-10 20:15:07,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:07,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,082 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:15:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,188 INFO L93 Difference]: Finished difference Result 664 states and 1972 transitions. [2020-02-10 20:15:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:07,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,190 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:15:07,190 INFO L226 Difference]: Without dead ends: 654 [2020-02-10 20:15:07,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-02-10 20:15:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 397. [2020-02-10 20:15:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1363 transitions. [2020-02-10 20:15:07,201 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,201 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1363 transitions. [2020-02-10 20:15:07,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1363 transitions. [2020-02-10 20:15:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:07,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,201 INFO L415 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] [2020-02-10 20:15:07,202 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1128198682, now seen corresponding path program 452 times [2020-02-10 20:15:07,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996999302] [2020-02-10 20:15:07,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996999302] [2020-02-10 20:15:07,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:07,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993105367] [2020-02-10 20:15:07,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:07,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,473 INFO L87 Difference]: Start difference. First operand 397 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,577 INFO L93 Difference]: Finished difference Result 668 states and 1978 transitions. [2020-02-10 20:15:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:07,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,579 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:15:07,579 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 20:15:07,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 20:15:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 395. [2020-02-10 20:15:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1358 transitions. [2020-02-10 20:15:07,589 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,590 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1358 transitions. [2020-02-10 20:15:07,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1358 transitions. [2020-02-10 20:15:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:07,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,590 INFO L415 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] [2020-02-10 20:15:07,590 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash 973063492, now seen corresponding path program 453 times [2020-02-10 20:15:07,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874958601] [2020-02-10 20:15:07,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874958601] [2020-02-10 20:15:07,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:07,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292365214] [2020-02-10 20:15:07,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:07,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:07,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,857 INFO L87 Difference]: Start difference. First operand 395 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,979 INFO L93 Difference]: Finished difference Result 663 states and 1968 transitions. [2020-02-10 20:15:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:07,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,981 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:15:07,981 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:15:07,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:15:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 397. [2020-02-10 20:15:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1361 transitions. [2020-02-10 20:15:07,991 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,992 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1361 transitions. [2020-02-10 20:15:07,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1361 transitions. [2020-02-10 20:15:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:07,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,992 INFO L415 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] [2020-02-10 20:15:07,993 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1544518298, now seen corresponding path program 454 times [2020-02-10 20:15:07,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319758671] [2020-02-10 20:15:07,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319758671] [2020-02-10 20:15:08,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:08,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749418944] [2020-02-10 20:15:08,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:08,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:08,257 INFO L87 Difference]: Start difference. First operand 397 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,364 INFO L93 Difference]: Finished difference Result 666 states and 1972 transitions. [2020-02-10 20:15:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:08,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,366 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:15:08,366 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 20:15:08,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 20:15:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 395. [2020-02-10 20:15:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1356 transitions. [2020-02-10 20:15:08,376 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,376 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1356 transitions. [2020-02-10 20:15:08,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1356 transitions. [2020-02-10 20:15:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:08,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,377 INFO L415 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] [2020-02-10 20:15:08,377 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1663428484, now seen corresponding path program 455 times [2020-02-10 20:15:08,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803439975] [2020-02-10 20:15:08,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803439975] [2020-02-10 20:15:08,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:08,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039992212] [2020-02-10 20:15:08,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:08,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:08,652 INFO L87 Difference]: Start difference. First operand 395 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,753 INFO L93 Difference]: Finished difference Result 674 states and 1991 transitions. [2020-02-10 20:15:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:08,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,755 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:15:08,755 INFO L226 Difference]: Without dead ends: 660 [2020-02-10 20:15:08,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-02-10 20:15:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 400. [2020-02-10 20:15:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:15:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1365 transitions. [2020-02-10 20:15:08,765 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1365 transitions. Word has length 22 [2020-02-10 20:15:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,765 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1365 transitions. [2020-02-10 20:15:08,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1365 transitions. [2020-02-10 20:15:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:08,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,766 INFO L415 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] [2020-02-10 20:15:08,766 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1142133816, now seen corresponding path program 456 times [2020-02-10 20:15:08,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972780797] [2020-02-10 20:15:08,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972780797] [2020-02-10 20:15:09,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:09,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209448101] [2020-02-10 20:15:09,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:09,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:09,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,034 INFO L87 Difference]: Start difference. First operand 400 states and 1365 transitions. Second operand 9 states. [2020-02-10 20:15:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,149 INFO L93 Difference]: Finished difference Result 673 states and 1984 transitions. [2020-02-10 20:15:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:09,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,151 INFO L225 Difference]: With dead ends: 673 [2020-02-10 20:15:09,151 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:15:09,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:15:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 388. [2020-02-10 20:15:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:15:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 20:15:09,161 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 20:15:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,161 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 20:15:09,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 20:15:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:09,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,162 INFO L415 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] [2020-02-10 20:15:09,162 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash -780259124, now seen corresponding path program 457 times [2020-02-10 20:15:09,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746120487] [2020-02-10 20:15:09,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746120487] [2020-02-10 20:15:09,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:09,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308206180] [2020-02-10 20:15:09,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:09,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,429 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:15:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,538 INFO L93 Difference]: Finished difference Result 633 states and 1903 transitions. [2020-02-10 20:15:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:09,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,540 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:15:09,540 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:15:09,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:15:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 394. [2020-02-10 20:15:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1361 transitions. [2020-02-10 20:15:09,549 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,550 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1361 transitions. [2020-02-10 20:15:09,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1361 transitions. [2020-02-10 20:15:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:09,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,550 INFO L415 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] [2020-02-10 20:15:09,550 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash 561673664, now seen corresponding path program 458 times [2020-02-10 20:15:09,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568185454] [2020-02-10 20:15:09,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568185454] [2020-02-10 20:15:09,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:09,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753657050] [2020-02-10 20:15:09,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:09,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,814 INFO L87 Difference]: Start difference. First operand 394 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,936 INFO L93 Difference]: Finished difference Result 632 states and 1899 transitions. [2020-02-10 20:15:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:09,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,938 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:15:09,938 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:15:09,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:15:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 392. [2020-02-10 20:15:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1356 transitions. [2020-02-10 20:15:09,948 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,948 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1356 transitions. [2020-02-10 20:15:09,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1356 transitions. [2020-02-10 20:15:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:09,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,949 INFO L415 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] [2020-02-10 20:15:09,949 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash 828056058, now seen corresponding path program 459 times [2020-02-10 20:15:09,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167857267] [2020-02-10 20:15:09,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167857267] [2020-02-10 20:15:10,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:10,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311075528] [2020-02-10 20:15:10,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:10,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:10,205 INFO L87 Difference]: Start difference. First operand 392 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,309 INFO L93 Difference]: Finished difference Result 638 states and 1912 transitions. [2020-02-10 20:15:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:10,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,311 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:15:10,311 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:15:10,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:15:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 395. [2020-02-10 20:15:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-02-10 20:15:10,320 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,321 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-02-10 20:15:10,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-02-10 20:15:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:10,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,321 INFO L415 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] [2020-02-10 20:15:10,321 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1694616042, now seen corresponding path program 460 times [2020-02-10 20:15:10,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223311536] [2020-02-10 20:15:10,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223311536] [2020-02-10 20:15:10,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:10,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605360279] [2020-02-10 20:15:10,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:10,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:10,660 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,769 INFO L93 Difference]: Finished difference Result 641 states and 1915 transitions. [2020-02-10 20:15:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:10,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,771 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:15:10,771 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:15:10,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:15:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 392. [2020-02-10 20:15:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 20:15:10,781 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,782 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 20:15:10,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 20:15:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:10,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,782 INFO L415 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] [2020-02-10 20:15:10,782 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1096903466, now seen corresponding path program 461 times [2020-02-10 20:15:10,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960227527] [2020-02-10 20:15:10,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960227527] [2020-02-10 20:15:11,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:11,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580432457] [2020-02-10 20:15:11,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:11,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:11,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,026 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,146 INFO L93 Difference]: Finished difference Result 635 states and 1903 transitions. [2020-02-10 20:15:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:11,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,147 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:15:11,148 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:15:11,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:15:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 394. [2020-02-10 20:15:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-02-10 20:15:11,157 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-02-10 20:15:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,157 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-02-10 20:15:11,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-02-10 20:15:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:11,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,158 INFO L415 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] [2020-02-10 20:15:11,158 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 178953276, now seen corresponding path program 462 times [2020-02-10 20:15:11,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156706443] [2020-02-10 20:15:11,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156706443] [2020-02-10 20:15:11,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:11,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346545424] [2020-02-10 20:15:11,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:11,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,404 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:15:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,517 INFO L93 Difference]: Finished difference Result 639 states and 1909 transitions. [2020-02-10 20:15:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:11,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,519 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:15:11,519 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:15:11,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:15:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 390. [2020-02-10 20:15:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 20:15:11,528 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 20:15:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,529 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 20:15:11,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 20:15:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:11,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,529 INFO L415 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] [2020-02-10 20:15:11,529 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 313832464, now seen corresponding path program 463 times [2020-02-10 20:15:11,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366716537] [2020-02-10 20:15:11,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366716537] [2020-02-10 20:15:11,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:11,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362293530] [2020-02-10 20:15:11,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:11,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:11,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,831 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:15:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,948 INFO L93 Difference]: Finished difference Result 632 states and 1899 transitions. [2020-02-10 20:15:11,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:11,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,950 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:15:11,950 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:15:11,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:15:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-02-10 20:15:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1359 transitions. [2020-02-10 20:15:11,961 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1359 transitions. Word has length 22 [2020-02-10 20:15:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,961 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1359 transitions. [2020-02-10 20:15:11,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1359 transitions. [2020-02-10 20:15:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:11,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,962 INFO L415 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] [2020-02-10 20:15:11,962 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1655765252, now seen corresponding path program 464 times [2020-02-10 20:15:11,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939277126] [2020-02-10 20:15:11,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939277126] [2020-02-10 20:15:12,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:12,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761047566] [2020-02-10 20:15:12,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:12,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:12,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,224 INFO L87 Difference]: Start difference. First operand 394 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:15:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,330 INFO L93 Difference]: Finished difference Result 631 states and 1895 transitions. [2020-02-10 20:15:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:12,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,331 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:15:12,332 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:15:12,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:15:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 392. [2020-02-10 20:15:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 20:15:12,341 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,341 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 20:15:12,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 20:15:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:12,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,342 INFO L415 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] [2020-02-10 20:15:12,342 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash 849062266, now seen corresponding path program 465 times [2020-02-10 20:15:12,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61735589] [2020-02-10 20:15:12,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61735589] [2020-02-10 20:15:12,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:12,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059950280] [2020-02-10 20:15:12,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:12,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,591 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,694 INFO L93 Difference]: Finished difference Result 636 states and 1906 transitions. [2020-02-10 20:15:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:12,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,696 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:15:12,696 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:15:12,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:15:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 20:15:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1359 transitions. [2020-02-10 20:15:12,706 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1359 transitions. Word has length 22 [2020-02-10 20:15:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,706 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1359 transitions. [2020-02-10 20:15:12,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1359 transitions. [2020-02-10 20:15:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:12,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,706 INFO L415 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] [2020-02-10 20:15:12,707 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 620673258, now seen corresponding path program 466 times [2020-02-10 20:15:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009299448] [2020-02-10 20:15:12,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009299448] [2020-02-10 20:15:12,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:12,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357527328] [2020-02-10 20:15:12,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:12,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:12,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,959 INFO L87 Difference]: Start difference. First operand 395 states and 1359 transitions. Second operand 9 states. [2020-02-10 20:15:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,066 INFO L93 Difference]: Finished difference Result 638 states and 1907 transitions. [2020-02-10 20:15:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:13,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,068 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:15:13,068 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:15:13,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:15:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 392. [2020-02-10 20:15:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1352 transitions. [2020-02-10 20:15:13,078 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,078 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1352 transitions. [2020-02-10 20:15:13,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1352 transitions. [2020-02-10 20:15:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:13,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,079 INFO L415 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] [2020-02-10 20:15:13,079 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1117909674, now seen corresponding path program 467 times [2020-02-10 20:15:13,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069785672] [2020-02-10 20:15:13,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069785672] [2020-02-10 20:15:13,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:13,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913994118] [2020-02-10 20:15:13,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:13,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:13,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:13,331 INFO L87 Difference]: Start difference. First operand 392 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,435 INFO L93 Difference]: Finished difference Result 633 states and 1897 transitions. [2020-02-10 20:15:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:13,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,436 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:15:13,437 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:15:13,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:15:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 394. [2020-02-10 20:15:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-02-10 20:15:13,446 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-02-10 20:15:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,446 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-02-10 20:15:13,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-02-10 20:15:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:13,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,446 INFO L415 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] [2020-02-10 20:15:13,447 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1689364480, now seen corresponding path program 468 times [2020-02-10 20:15:13,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822558797] [2020-02-10 20:15:13,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822558797] [2020-02-10 20:15:13,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:13,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869324295] [2020-02-10 20:15:13,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:13,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:13,710 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:15:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,817 INFO L93 Difference]: Finished difference Result 636 states and 1901 transitions. [2020-02-10 20:15:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:13,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,819 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:15:13,819 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:15:13,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:15:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 20:15:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-02-10 20:15:13,829 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-02-10 20:15:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,829 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-02-10 20:15:13,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-02-10 20:15:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:13,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,830 INFO L415 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] [2020-02-10 20:15:13,830 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash 240310736, now seen corresponding path program 469 times [2020-02-10 20:15:13,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962458786] [2020-02-10 20:15:13,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962458786] [2020-02-10 20:15:14,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:14,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765502046] [2020-02-10 20:15:14,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:14,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:14,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,084 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:15:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,186 INFO L93 Difference]: Finished difference Result 646 states and 1932 transitions. [2020-02-10 20:15:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:14,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,188 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:15:14,188 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:15:14,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:15:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 396. [2020-02-10 20:15:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-02-10 20:15:14,199 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,199 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-02-10 20:15:14,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-02-10 20:15:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:14,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,199 INFO L415 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] [2020-02-10 20:15:14,200 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1106870720, now seen corresponding path program 470 times [2020-02-10 20:15:14,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976443945] [2020-02-10 20:15:14,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976443945] [2020-02-10 20:15:14,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:14,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978448443] [2020-02-10 20:15:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:14,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,453 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,565 INFO L93 Difference]: Finished difference Result 649 states and 1935 transitions. [2020-02-10 20:15:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:14,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,567 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:15:14,567 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:15:14,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:15:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 393. [2020-02-10 20:15:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1355 transitions. [2020-02-10 20:15:14,576 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1355 transitions. Word has length 22 [2020-02-10 20:15:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,576 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1355 transitions. [2020-02-10 20:15:14,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1355 transitions. [2020-02-10 20:15:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:14,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,577 INFO L415 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] [2020-02-10 20:15:14,577 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -832774644, now seen corresponding path program 471 times [2020-02-10 20:15:14,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029331512] [2020-02-10 20:15:14,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029331512] [2020-02-10 20:15:14,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:14,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224241702] [2020-02-10 20:15:14,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:14,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,831 INFO L87 Difference]: Start difference. First operand 393 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:15:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,929 INFO L93 Difference]: Finished difference Result 645 states and 1927 transitions. [2020-02-10 20:15:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:14,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,931 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:15:14,931 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:15:14,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:15:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 396. [2020-02-10 20:15:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1360 transitions. [2020-02-10 20:15:14,941 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1360 transitions. Word has length 22 [2020-02-10 20:15:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,941 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1360 transitions. [2020-02-10 20:15:14,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1360 transitions. [2020-02-10 20:15:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:14,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,941 INFO L415 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] [2020-02-10 20:15:14,942 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1061163652, now seen corresponding path program 472 times [2020-02-10 20:15:14,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233497512] [2020-02-10 20:15:14,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233497512] [2020-02-10 20:15:15,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:15,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421194851] [2020-02-10 20:15:15,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:15,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,190 INFO L87 Difference]: Start difference. First operand 396 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:15:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,305 INFO L93 Difference]: Finished difference Result 647 states and 1928 transitions. [2020-02-10 20:15:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:15,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,307 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:15:15,307 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:15:15,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:15:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 393. [2020-02-10 20:15:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1352 transitions. [2020-02-10 20:15:15,324 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,324 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1352 transitions. [2020-02-10 20:15:15,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1352 transitions. [2020-02-10 20:15:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:15,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,325 INFO L415 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] [2020-02-10 20:15:15,325 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1678221232, now seen corresponding path program 473 times [2020-02-10 20:15:15,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599727199] [2020-02-10 20:15:15,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599727199] [2020-02-10 20:15:15,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:15,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097427581] [2020-02-10 20:15:15,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:15,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,585 INFO L87 Difference]: Start difference. First operand 393 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,684 INFO L93 Difference]: Finished difference Result 653 states and 1942 transitions. [2020-02-10 20:15:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:15,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,685 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:15:15,686 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:15:15,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:15:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 398. [2020-02-10 20:15:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:15:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1361 transitions. [2020-02-10 20:15:15,695 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,695 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1361 transitions. [2020-02-10 20:15:15,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1361 transitions. [2020-02-10 20:15:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:15,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,696 INFO L415 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] [2020-02-10 20:15:15,696 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash 32392076, now seen corresponding path program 474 times [2020-02-10 20:15:15,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515270053] [2020-02-10 20:15:15,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515270053] [2020-02-10 20:15:15,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:15,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650507977] [2020-02-10 20:15:15,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:15,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:15,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,953 INFO L87 Difference]: Start difference. First operand 398 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,055 INFO L93 Difference]: Finished difference Result 652 states and 1935 transitions. [2020-02-10 20:15:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:16,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,057 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:15:16,057 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:15:16,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:15:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 390. [2020-02-10 20:15:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 20:15:16,066 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 20:15:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,066 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 20:15:16,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 20:15:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:16,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,067 INFO L415 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] [2020-02-10 20:15:16,067 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1603249732, now seen corresponding path program 475 times [2020-02-10 20:15:16,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031159258] [2020-02-10 20:15:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031159258] [2020-02-10 20:15:16,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:16,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298030236] [2020-02-10 20:15:16,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:16,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:16,314 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:15:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,414 INFO L93 Difference]: Finished difference Result 639 states and 1911 transitions. [2020-02-10 20:15:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:16,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,416 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:15:16,416 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:15:16,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:15:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 394. [2020-02-10 20:15:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-02-10 20:15:16,426 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-02-10 20:15:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,426 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-02-10 20:15:16,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-02-10 20:15:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:16,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,427 INFO L415 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] [2020-02-10 20:15:16,427 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash 685299542, now seen corresponding path program 476 times [2020-02-10 20:15:16,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130524865] [2020-02-10 20:15:16,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130524865] [2020-02-10 20:15:16,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:16,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423869515] [2020-02-10 20:15:16,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:16,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:16,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:16,673 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:15:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,771 INFO L93 Difference]: Finished difference Result 643 states and 1917 transitions. [2020-02-10 20:15:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:16,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,773 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:15:16,773 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:15:16,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:15:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 392. [2020-02-10 20:15:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-02-10 20:15:16,783 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-02-10 20:15:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,783 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-02-10 20:15:16,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-02-10 20:15:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:16,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,784 INFO L415 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] [2020-02-10 20:15:16,784 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 530164352, now seen corresponding path program 477 times [2020-02-10 20:15:16,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960919787] [2020-02-10 20:15:16,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:17,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960919787] [2020-02-10 20:15:17,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:17,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985480018] [2020-02-10 20:15:17,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:17,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,042 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:15:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,150 INFO L93 Difference]: Finished difference Result 638 states and 1907 transitions. [2020-02-10 20:15:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:17,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,152 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:15:17,152 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:15:17,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:15:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-02-10 20:15:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1353 transitions. [2020-02-10 20:15:17,160 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1353 transitions. Word has length 22 [2020-02-10 20:15:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,160 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1353 transitions. [2020-02-10 20:15:17,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1353 transitions. [2020-02-10 20:15:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:17,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,161 INFO L415 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] [2020-02-10 20:15:17,161 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1101619158, now seen corresponding path program 478 times [2020-02-10 20:15:17,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103839852] [2020-02-10 20:15:17,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:17,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103839852] [2020-02-10 20:15:17,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:17,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622605588] [2020-02-10 20:15:17,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:17,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,414 INFO L87 Difference]: Start difference. First operand 394 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:15:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,517 INFO L93 Difference]: Finished difference Result 641 states and 1911 transitions. [2020-02-10 20:15:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:17,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,520 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:15:17,520 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:15:17,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:15:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 392. [2020-02-10 20:15:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1348 transitions. [2020-02-10 20:15:17,532 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1348 transitions. Word has length 22 [2020-02-10 20:15:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,532 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1348 transitions. [2020-02-10 20:15:17,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1348 transitions. [2020-02-10 20:15:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:17,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,533 INFO L415 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] [2020-02-10 20:15:17,533 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1220529344, now seen corresponding path program 479 times [2020-02-10 20:15:17,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163230130] [2020-02-10 20:15:17,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:17,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163230130] [2020-02-10 20:15:17,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:17,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098067815] [2020-02-10 20:15:17,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:17,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,793 INFO L87 Difference]: Start difference. First operand 392 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:15:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,904 INFO L93 Difference]: Finished difference Result 649 states and 1930 transitions. [2020-02-10 20:15:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:17,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,906 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:15:17,906 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:15:17,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:15:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 397. [2020-02-10 20:15:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1357 transitions. [2020-02-10 20:15:17,916 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1357 transitions. Word has length 22 [2020-02-10 20:15:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,916 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1357 transitions. [2020-02-10 20:15:17,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1357 transitions. [2020-02-10 20:15:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:17,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,917 INFO L415 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] [2020-02-10 20:15:17,917 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1585032956, now seen corresponding path program 480 times [2020-02-10 20:15:17,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410460069] [2020-02-10 20:15:17,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410460069] [2020-02-10 20:15:18,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:18,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671506768] [2020-02-10 20:15:18,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:18,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,175 INFO L87 Difference]: Start difference. First operand 397 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:15:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,282 INFO L93 Difference]: Finished difference Result 648 states and 1923 transitions. [2020-02-10 20:15:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:18,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,284 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:15:18,284 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:15:18,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:15:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 383. [2020-02-10 20:15:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:15:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1332 transitions. [2020-02-10 20:15:18,294 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1332 transitions. Word has length 22 [2020-02-10 20:15:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,295 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1332 transitions. [2020-02-10 20:15:18,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1332 transitions. [2020-02-10 20:15:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:18,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,295 INFO L415 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] [2020-02-10 20:15:18,295 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash -241342128, now seen corresponding path program 481 times [2020-02-10 20:15:18,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133905215] [2020-02-10 20:15:18,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133905215] [2020-02-10 20:15:18,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:18,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963409963] [2020-02-10 20:15:18,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:18,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,586 INFO L87 Difference]: Start difference. First operand 383 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:15:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,671 INFO L93 Difference]: Finished difference Result 620 states and 1827 transitions. [2020-02-10 20:15:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:18,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,673 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:15:18,673 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:15:18,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:15:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 394. [2020-02-10 20:15:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1368 transitions. [2020-02-10 20:15:18,683 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,683 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1368 transitions. [2020-02-10 20:15:18,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1368 transitions. [2020-02-10 20:15:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:18,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,683 INFO L415 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] [2020-02-10 20:15:18,684 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash 319726364, now seen corresponding path program 482 times [2020-02-10 20:15:18,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270076012] [2020-02-10 20:15:18,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270076012] [2020-02-10 20:15:18,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:18,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262964305] [2020-02-10 20:15:18,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:18,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,971 INFO L87 Difference]: Start difference. First operand 394 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,047 INFO L93 Difference]: Finished difference Result 613 states and 1812 transitions. [2020-02-10 20:15:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:19,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,049 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:15:19,049 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:15:19,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:15:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-02-10 20:15:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 20:15:19,059 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 20:15:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,059 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 20:15:19,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 20:15:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:19,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,060 INFO L415 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] [2020-02-10 20:15:19,060 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1841779982, now seen corresponding path program 483 times [2020-02-10 20:15:19,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627005010] [2020-02-10 20:15:19,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627005010] [2020-02-10 20:15:19,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:19,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904674812] [2020-02-10 20:15:19,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:19,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:19,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:19,363 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:15:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,438 INFO L93 Difference]: Finished difference Result 622 states and 1830 transitions. [2020-02-10 20:15:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:19,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,440 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:15:19,440 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:15:19,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:15:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-02-10 20:15:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-02-10 20:15:19,450 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,451 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-02-10 20:15:19,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-02-10 20:15:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:19,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,451 INFO L415 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] [2020-02-10 20:15:19,451 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1490983652, now seen corresponding path program 484 times [2020-02-10 20:15:19,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293278736] [2020-02-10 20:15:19,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293278736] [2020-02-10 20:15:19,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:19,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972669464] [2020-02-10 20:15:19,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:19,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:19,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:19,750 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,883 INFO L93 Difference]: Finished difference Result 616 states and 1816 transitions. [2020-02-10 20:15:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:19,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,885 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:15:19,885 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:15:19,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:15:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 392. [2020-02-10 20:15:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 20:15:19,897 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 20:15:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,897 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 20:15:19,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 20:15:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:19,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,898 INFO L415 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] [2020-02-10 20:15:19,898 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1787057756, now seen corresponding path program 485 times [2020-02-10 20:15:19,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541127480] [2020-02-10 20:15:19,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541127480] [2020-02-10 20:15:20,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:20,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530173047] [2020-02-10 20:15:20,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:20,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:20,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,206 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:15:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,282 INFO L93 Difference]: Finished difference Result 606 states and 1797 transitions. [2020-02-10 20:15:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:20,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,285 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:15:20,285 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:15:20,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:15:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 393. [2020-02-10 20:15:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1363 transitions. [2020-02-10 20:15:20,294 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,295 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1363 transitions. [2020-02-10 20:15:20,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1363 transitions. [2020-02-10 20:15:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:20,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,295 INFO L415 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] [2020-02-10 20:15:20,295 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,296 INFO L82 PathProgramCache]: Analyzing trace with hash -176116798, now seen corresponding path program 486 times [2020-02-10 20:15:20,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912670412] [2020-02-10 20:15:20,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912670412] [2020-02-10 20:15:20,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:20,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106748067] [2020-02-10 20:15:20,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:20,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,603 INFO L87 Difference]: Start difference. First operand 393 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,704 INFO L93 Difference]: Finished difference Result 607 states and 1798 transitions. [2020-02-10 20:15:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:20,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,705 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:15:20,706 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:15:20,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:15:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 390. [2020-02-10 20:15:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1358 transitions. [2020-02-10 20:15:20,714 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,714 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1358 transitions. [2020-02-10 20:15:20,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1358 transitions. [2020-02-10 20:15:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:20,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,715 INFO L415 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] [2020-02-10 20:15:20,715 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash -838678786, now seen corresponding path program 487 times [2020-02-10 20:15:20,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449233050] [2020-02-10 20:15:20,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449233050] [2020-02-10 20:15:20,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:20,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676961356] [2020-02-10 20:15:20,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:20,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,987 INFO L87 Difference]: Start difference. First operand 390 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,063 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-02-10 20:15:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:21,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,065 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:15:21,065 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:15:21,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:15:21,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 395. [2020-02-10 20:15:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-02-10 20:15:21,075 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,075 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-02-10 20:15:21,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-02-10 20:15:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:21,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,076 INFO L415 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] [2020-02-10 20:15:21,076 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -277610294, now seen corresponding path program 488 times [2020-02-10 20:15:21,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110728487] [2020-02-10 20:15:21,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110728487] [2020-02-10 20:15:21,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:21,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26279479] [2020-02-10 20:15:21,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:21,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:21,351 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,428 INFO L93 Difference]: Finished difference Result 623 states and 1833 transitions. [2020-02-10 20:15:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:21,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,429 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:15:21,430 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:15:21,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:15:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 20:15:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 20:15:21,439 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 20:15:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,439 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 20:15:21,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 20:15:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:21,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,440 INFO L415 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] [2020-02-10 20:15:21,440 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash 174013746, now seen corresponding path program 489 times [2020-02-10 20:15:21,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324060901] [2020-02-10 20:15:21,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324060901] [2020-02-10 20:15:21,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:21,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87713405] [2020-02-10 20:15:21,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:21,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:21,729 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:15:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,812 INFO L93 Difference]: Finished difference Result 641 states and 1872 transitions. [2020-02-10 20:15:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:21,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,813 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:15:21,814 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:15:21,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:15:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 401. [2020-02-10 20:15:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:15:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1377 transitions. [2020-02-10 20:15:21,823 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1377 transitions. Word has length 22 [2020-02-10 20:15:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,823 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1377 transitions. [2020-02-10 20:15:21,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1377 transitions. [2020-02-10 20:15:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:21,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,824 INFO L415 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] [2020-02-10 20:15:21,824 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash 44043300, now seen corresponding path program 490 times [2020-02-10 20:15:21,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039606342] [2020-02-10 20:15:21,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039606342] [2020-02-10 20:15:22,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:22,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660177799] [2020-02-10 20:15:22,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:22,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:22,124 INFO L87 Difference]: Start difference. First operand 401 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:15:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,221 INFO L93 Difference]: Finished difference Result 639 states and 1862 transitions. [2020-02-10 20:15:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:22,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,223 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:15:22,223 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:15:22,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:15:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2020-02-10 20:15:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1361 transitions. [2020-02-10 20:15:22,233 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,233 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1361 transitions. [2020-02-10 20:15:22,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1361 transitions. [2020-02-10 20:15:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:22,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,234 INFO L415 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] [2020-02-10 20:15:22,234 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 228735972, now seen corresponding path program 491 times [2020-02-10 20:15:22,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623104980] [2020-02-10 20:15:22,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623104980] [2020-02-10 20:15:22,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:22,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211583347] [2020-02-10 20:15:22,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:22,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:22,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:22,510 INFO L87 Difference]: Start difference. First operand 393 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,588 INFO L93 Difference]: Finished difference Result 620 states and 1825 transitions. [2020-02-10 20:15:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:22,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,589 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:15:22,590 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:15:22,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:15:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-02-10 20:15:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-02-10 20:15:22,599 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-02-10 20:15:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,599 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-02-10 20:15:22,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-02-10 20:15:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:22,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,600 INFO L415 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] [2020-02-10 20:15:22,600 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,600 INFO L82 PathProgramCache]: Analyzing trace with hash -846975184, now seen corresponding path program 492 times [2020-02-10 20:15:22,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793885679] [2020-02-10 20:15:22,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793885679] [2020-02-10 20:15:22,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:22,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716896611] [2020-02-10 20:15:22,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:22,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:22,861 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:15:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,968 INFO L93 Difference]: Finished difference Result 625 states and 1834 transitions. [2020-02-10 20:15:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:22,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,970 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:15:22,970 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:15:22,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:15:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 390. [2020-02-10 20:15:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 20:15:22,980 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 20:15:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,980 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 20:15:22,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 20:15:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:22,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,981 INFO L415 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] [2020-02-10 20:15:22,981 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -513082562, now seen corresponding path program 493 times [2020-02-10 20:15:22,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395529568] [2020-02-10 20:15:22,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395529568] [2020-02-10 20:15:23,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:23,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818431975] [2020-02-10 20:15:23,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:23,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:23,264 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:15:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,345 INFO L93 Difference]: Finished difference Result 636 states and 1862 transitions. [2020-02-10 20:15:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:23,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,346 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:15:23,347 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:15:23,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:15:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 397. [2020-02-10 20:15:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1371 transitions. [2020-02-10 20:15:23,356 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1371 transitions. Word has length 22 [2020-02-10 20:15:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,357 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1371 transitions. [2020-02-10 20:15:23,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1371 transitions. [2020-02-10 20:15:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:23,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,357 INFO L415 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] [2020-02-10 20:15:23,358 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1475286224, now seen corresponding path program 494 times [2020-02-10 20:15:23,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116014799] [2020-02-10 20:15:23,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116014799] [2020-02-10 20:15:23,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:23,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971206281] [2020-02-10 20:15:23,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:23,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:23,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:23,644 INFO L87 Difference]: Start difference. First operand 397 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:15:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,749 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-02-10 20:15:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:23,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,750 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:15:23,751 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:15:23,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:15:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-02-10 20:15:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1364 transitions. [2020-02-10 20:15:23,759 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1364 transitions. Word has length 22 [2020-02-10 20:15:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,759 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1364 transitions. [2020-02-10 20:15:23,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1364 transitions. [2020-02-10 20:15:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:23,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,760 INFO L415 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] [2020-02-10 20:15:23,760 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2100047824, now seen corresponding path program 495 times [2020-02-10 20:15:23,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404868073] [2020-02-10 20:15:23,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404868073] [2020-02-10 20:15:24,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:24,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946183624] [2020-02-10 20:15:24,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:24,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,057 INFO L87 Difference]: Start difference. First operand 394 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:15:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,154 INFO L93 Difference]: Finished difference Result 645 states and 1880 transitions. [2020-02-10 20:15:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:24,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,156 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:15:24,156 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:15:24,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:15:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 402. [2020-02-10 20:15:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:15:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1377 transitions. [2020-02-10 20:15:24,166 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1377 transitions. Word has length 22 [2020-02-10 20:15:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,166 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1377 transitions. [2020-02-10 20:15:24,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1377 transitions. [2020-02-10 20:15:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:24,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,167 INFO L415 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] [2020-02-10 20:15:24,167 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1970077378, now seen corresponding path program 496 times [2020-02-10 20:15:24,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487206369] [2020-02-10 20:15:24,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487206369] [2020-02-10 20:15:24,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:24,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080041388] [2020-02-10 20:15:24,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:24,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,449 INFO L87 Difference]: Start difference. First operand 402 states and 1377 transitions. Second operand 9 states. [2020-02-10 20:15:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,556 INFO L93 Difference]: Finished difference Result 643 states and 1870 transitions. [2020-02-10 20:15:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:24,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,558 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:15:24,558 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:15:24,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:15:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-02-10 20:15:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-02-10 20:15:24,567 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-02-10 20:15:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,567 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-02-10 20:15:24,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-02-10 20:15:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:24,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,568 INFO L415 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] [2020-02-10 20:15:24,568 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1205685836, now seen corresponding path program 497 times [2020-02-10 20:15:24,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098916464] [2020-02-10 20:15:24,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098916464] [2020-02-10 20:15:24,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:24,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075879540] [2020-02-10 20:15:24,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:24,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,836 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:15:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,941 INFO L93 Difference]: Finished difference Result 627 states and 1839 transitions. [2020-02-10 20:15:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:24,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,943 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:15:24,943 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:15:24,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:15:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 396. [2020-02-10 20:15:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-02-10 20:15:24,952 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,952 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-02-10 20:15:24,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-02-10 20:15:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:24,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,953 INFO L415 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] [2020-02-10 20:15:24,953 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 287735646, now seen corresponding path program 498 times [2020-02-10 20:15:24,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823957815] [2020-02-10 20:15:24,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823957815] [2020-02-10 20:15:25,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:25,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824837542] [2020-02-10 20:15:25,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:25,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:25,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:25,227 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,349 INFO L93 Difference]: Finished difference Result 631 states and 1845 transitions. [2020-02-10 20:15:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:25,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,351 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:15:25,351 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:15:25,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:15:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-02-10 20:15:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 20:15:25,361 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,361 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 20:15:25,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 20:15:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:25,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,362 INFO L415 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] [2020-02-10 20:15:25,362 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1024774602, now seen corresponding path program 499 times [2020-02-10 20:15:25,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215935666] [2020-02-10 20:15:25,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215935666] [2020-02-10 20:15:25,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:25,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671591527] [2020-02-10 20:15:25,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:25,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:25,647 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,730 INFO L93 Difference]: Finished difference Result 601 states and 1783 transitions. [2020-02-10 20:15:25,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:25,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,731 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:15:25,732 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:15:25,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:15:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-02-10 20:15:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1356 transitions. [2020-02-10 20:15:25,740 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,740 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1356 transitions. [2020-02-10 20:15:25,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1356 transitions. [2020-02-10 20:15:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:25,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,741 INFO L415 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] [2020-02-10 20:15:25,741 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1659251736, now seen corresponding path program 500 times [2020-02-10 20:15:25,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635130060] [2020-02-10 20:15:25,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635130060] [2020-02-10 20:15:26,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:26,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115701620] [2020-02-10 20:15:26,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:26,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:26,028 INFO L87 Difference]: Start difference. First operand 392 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,156 INFO L93 Difference]: Finished difference Result 602 states and 1784 transitions. [2020-02-10 20:15:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:26,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,157 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:15:26,158 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:15:26,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:15:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 391. [2020-02-10 20:15:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 20:15:26,167 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,167 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 20:15:26,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 20:15:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:26,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,168 INFO L415 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] [2020-02-10 20:15:26,168 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -657062308, now seen corresponding path program 501 times [2020-02-10 20:15:26,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35174229] [2020-02-10 20:15:26,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35174229] [2020-02-10 20:15:26,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:26,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212415734] [2020-02-10 20:15:26,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:26,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:26,443 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,528 INFO L93 Difference]: Finished difference Result 605 states and 1790 transitions. [2020-02-10 20:15:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:26,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,530 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:15:26,530 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:15:26,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:15:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2020-02-10 20:15:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-02-10 20:15:26,539 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-02-10 20:15:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,540 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-02-10 20:15:26,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-02-10 20:15:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:26,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,540 INFO L415 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] [2020-02-10 20:15:26,540 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1732773464, now seen corresponding path program 502 times [2020-02-10 20:15:26,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466205124] [2020-02-10 20:15:26,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466205124] [2020-02-10 20:15:26,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:26,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62046546] [2020-02-10 20:15:26,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:26,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:26,817 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:15:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,924 INFO L93 Difference]: Finished difference Result 610 states and 1799 transitions. [2020-02-10 20:15:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:26,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,926 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:15:26,926 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:15:26,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:15:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 391. [2020-02-10 20:15:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1353 transitions. [2020-02-10 20:15:26,936 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1353 transitions. Word has length 22 [2020-02-10 20:15:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,936 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1353 transitions. [2020-02-10 20:15:26,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1353 transitions. [2020-02-10 20:15:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:26,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,936 INFO L415 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] [2020-02-10 20:15:26,937 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash -646559204, now seen corresponding path program 503 times [2020-02-10 20:15:26,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482473408] [2020-02-10 20:15:26,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482473408] [2020-02-10 20:15:27,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:27,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656328597] [2020-02-10 20:15:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:27,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:27,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,203 INFO L87 Difference]: Start difference. First operand 391 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:15:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,306 INFO L93 Difference]: Finished difference Result 608 states and 1796 transitions. [2020-02-10 20:15:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:27,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,308 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:15:27,308 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:15:27,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:15:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-02-10 20:15:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-02-10 20:15:27,319 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,319 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-02-10 20:15:27,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-02-10 20:15:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:27,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,320 INFO L415 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] [2020-02-10 20:15:27,320 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash 961755978, now seen corresponding path program 504 times [2020-02-10 20:15:27,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728756134] [2020-02-10 20:15:27,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728756134] [2020-02-10 20:15:27,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:27,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194480237] [2020-02-10 20:15:27,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:27,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:27,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,588 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,695 INFO L93 Difference]: Finished difference Result 612 states and 1802 transitions. [2020-02-10 20:15:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:27,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,697 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:15:27,697 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:15:27,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:15:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 387. [2020-02-10 20:15:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:15:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1346 transitions. [2020-02-10 20:15:27,706 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1346 transitions. Word has length 22 [2020-02-10 20:15:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,706 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1346 transitions. [2020-02-10 20:15:27,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1346 transitions. [2020-02-10 20:15:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:27,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,707 INFO L415 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] [2020-02-10 20:15:27,707 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1086313580, now seen corresponding path program 505 times [2020-02-10 20:15:27,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508346428] [2020-02-10 20:15:27,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508346428] [2020-02-10 20:15:27,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:27,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413531380] [2020-02-10 20:15:27,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:27,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,999 INFO L87 Difference]: Start difference. First operand 387 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:15:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,083 INFO L93 Difference]: Finished difference Result 614 states and 1811 transitions. [2020-02-10 20:15:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:28,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,085 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:15:28,085 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:15:28,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:15:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-02-10 20:15:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 20:15:28,095 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 20:15:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,096 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 20:15:28,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 20:15:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:28,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,096 INFO L415 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] [2020-02-10 20:15:28,097 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash -525245088, now seen corresponding path program 506 times [2020-02-10 20:15:28,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189020272] [2020-02-10 20:15:28,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189020272] [2020-02-10 20:15:28,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:28,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331379778] [2020-02-10 20:15:28,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:28,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:28,378 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:15:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,469 INFO L93 Difference]: Finished difference Result 607 states and 1796 transitions. [2020-02-10 20:15:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:28,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,471 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:15:28,471 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:15:28,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:15:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-02-10 20:15:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 20:15:28,481 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,481 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 20:15:28,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 20:15:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:28,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,482 INFO L415 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] [2020-02-10 20:15:28,482 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1608215862, now seen corresponding path program 507 times [2020-02-10 20:15:28,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127164880] [2020-02-10 20:15:28,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127164880] [2020-02-10 20:15:28,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:28,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506510830] [2020-02-10 20:15:28,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:28,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:28,762 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,846 INFO L93 Difference]: Finished difference Result 616 states and 1814 transitions. [2020-02-10 20:15:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:28,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,848 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:15:28,848 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:15:28,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:15:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 394. [2020-02-10 20:15:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-02-10 20:15:28,857 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-02-10 20:15:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,857 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-02-10 20:15:28,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-02-10 20:15:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:28,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,858 INFO L415 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] [2020-02-10 20:15:28,858 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash 646012200, now seen corresponding path program 508 times [2020-02-10 20:15:28,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614941990] [2020-02-10 20:15:28,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614941990] [2020-02-10 20:15:29,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:29,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921945469] [2020-02-10 20:15:29,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:29,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:29,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,135 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:15:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,242 INFO L93 Difference]: Finished difference Result 610 states and 1800 transitions. [2020-02-10 20:15:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:29,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,244 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:15:29,244 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:15:29,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:15:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 391. [2020-02-10 20:15:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 20:15:29,254 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,254 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 20:15:29,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 20:15:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:29,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,255 INFO L415 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] [2020-02-10 20:15:29,255 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1662938088, now seen corresponding path program 509 times [2020-02-10 20:15:29,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175912093] [2020-02-10 20:15:29,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175912093] [2020-02-10 20:15:29,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:29,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691892882] [2020-02-10 20:15:29,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:29,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:29,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,546 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,634 INFO L93 Difference]: Finished difference Result 600 states and 1781 transitions. [2020-02-10 20:15:29,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:29,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,636 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:15:29,636 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:15:29,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:15:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 392. [2020-02-10 20:15:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-02-10 20:15:29,645 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-02-10 20:15:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,645 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-02-10 20:15:29,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-02-10 20:15:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:29,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,645 INFO L415 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] [2020-02-10 20:15:29,646 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1021088250, now seen corresponding path program 510 times [2020-02-10 20:15:29,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271754940] [2020-02-10 20:15:29,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271754940] [2020-02-10 20:15:29,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:29,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84406366] [2020-02-10 20:15:29,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:29,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,929 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:15:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,036 INFO L93 Difference]: Finished difference Result 601 states and 1782 transitions. [2020-02-10 20:15:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:30,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,038 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:15:30,038 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:15:30,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:15:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2020-02-10 20:15:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-02-10 20:15:30,048 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,048 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-02-10 20:15:30,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-02-10 20:15:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:30,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:30,049 INFO L415 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] [2020-02-10 20:15:30,049 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2126549378, now seen corresponding path program 511 times [2020-02-10 20:15:30,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:30,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858016249] [2020-02-10 20:15:30,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:30,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858016249] [2020-02-10 20:15:30,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:30,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:30,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328171608] [2020-02-10 20:15:30,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:30,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:30,334 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,417 INFO L93 Difference]: Finished difference Result 620 states and 1824 transitions. [2020-02-10 20:15:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:30,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,419 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:15:30,419 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:15:30,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:15:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 393. [2020-02-10 20:15:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-02-10 20:15:30,429 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-02-10 20:15:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,429 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-02-10 20:15:30,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-02-10 20:15:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:30,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:30,430 INFO L415 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] [2020-02-10 20:15:30,430 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1565480886, now seen corresponding path program 512 times [2020-02-10 20:15:30,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:30,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068870849] [2020-02-10 20:15:30,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:30,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068870849] [2020-02-10 20:15:30,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:30,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:30,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751220041] [2020-02-10 20:15:30,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:30,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:30,711 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:15:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,812 INFO L93 Difference]: Finished difference Result 613 states and 1809 transitions. [2020-02-10 20:15:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:30,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,814 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:15:30,814 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:15:30,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:15:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 391. [2020-02-10 20:15:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 20:15:30,824 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,824 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 20:15:30,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 20:15:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:30,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:30,825 INFO L415 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] [2020-02-10 20:15:30,825 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash -19765258, now seen corresponding path program 513 times [2020-02-10 20:15:30,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:30,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831857321] [2020-02-10 20:15:30,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:31,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831857321] [2020-02-10 20:15:31,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:31,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:31,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520734629] [2020-02-10 20:15:31,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:31,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:31,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:31,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:31,124 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:31,214 INFO L93 Difference]: Finished difference Result 628 states and 1842 transitions. [2020-02-10 20:15:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:31,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:31,216 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:15:31,216 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:15:31,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:15:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 397. [2020-02-10 20:15:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1366 transitions. [2020-02-10 20:15:31,226 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1366 transitions. Word has length 22 [2020-02-10 20:15:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:31,226 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1366 transitions. [2020-02-10 20:15:31,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1366 transitions. [2020-02-10 20:15:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:31,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:31,227 INFO L415 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] [2020-02-10 20:15:31,227 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 173055434, now seen corresponding path program 514 times [2020-02-10 20:15:31,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:31,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719190604] [2020-02-10 20:15:31,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:31,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719190604] [2020-02-10 20:15:31,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:31,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:31,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935793079] [2020-02-10 20:15:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:31,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:31,502 INFO L87 Difference]: Start difference. First operand 397 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:15:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:31,611 INFO L93 Difference]: Finished difference Result 625 states and 1831 transitions. [2020-02-10 20:15:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:31,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:31,613 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:15:31,613 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:15:31,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:15:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2020-02-10 20:15:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 20:15:31,623 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:31,623 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 20:15:31,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 20:15:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:31,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:31,623 INFO L415 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] [2020-02-10 20:15:31,624 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash 34956968, now seen corresponding path program 515 times [2020-02-10 20:15:31,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:31,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065398703] [2020-02-10 20:15:31,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:31,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065398703] [2020-02-10 20:15:31,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:31,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:31,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581862102] [2020-02-10 20:15:31,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:31,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:31,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:31,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:31,910 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:32,012 INFO L93 Difference]: Finished difference Result 609 states and 1800 transitions. [2020-02-10 20:15:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:32,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:32,014 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:15:32,014 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:15:32,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:15:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 392. [2020-02-10 20:15:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-02-10 20:15:32,024 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-02-10 20:15:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:32,024 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-02-10 20:15:32,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-02-10 20:15:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:32,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:32,025 INFO L415 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] [2020-02-10 20:15:32,025 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2113839568, now seen corresponding path program 516 times [2020-02-10 20:15:32,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:32,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14008140] [2020-02-10 20:15:32,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:32,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14008140] [2020-02-10 20:15:32,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:32,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:32,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536513680] [2020-02-10 20:15:32,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:32,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:32,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:32,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:32,301 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:15:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:32,406 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-02-10 20:15:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:32,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:32,408 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:15:32,408 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:15:32,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:15:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 389. [2020-02-10 20:15:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1350 transitions. [2020-02-10 20:15:32,417 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1350 transitions. Word has length 22 [2020-02-10 20:15:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:32,417 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1350 transitions. [2020-02-10 20:15:32,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1350 transitions. [2020-02-10 20:15:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:32,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:32,418 INFO L415 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] [2020-02-10 20:15:32,418 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1800953154, now seen corresponding path program 517 times [2020-02-10 20:15:32,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:32,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636424793] [2020-02-10 20:15:32,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:32,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636424793] [2020-02-10 20:15:32,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:32,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:32,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75479604] [2020-02-10 20:15:32,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:32,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:32,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:32,701 INFO L87 Difference]: Start difference. First operand 389 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:15:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:32,780 INFO L93 Difference]: Finished difference Result 626 states and 1839 transitions. [2020-02-10 20:15:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:32,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:32,782 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:15:32,782 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:15:32,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:15:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 395. [2020-02-10 20:15:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1364 transitions. [2020-02-10 20:15:32,792 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1364 transitions. Word has length 22 [2020-02-10 20:15:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:32,792 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1364 transitions. [2020-02-10 20:15:32,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1364 transitions. [2020-02-10 20:15:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:32,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:32,793 INFO L415 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] [2020-02-10 20:15:32,793 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:32,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1531810480, now seen corresponding path program 518 times [2020-02-10 20:15:32,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:32,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470613595] [2020-02-10 20:15:32,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:33,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470613595] [2020-02-10 20:15:33,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:33,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:33,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113336987] [2020-02-10 20:15:33,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:33,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:33,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:33,062 INFO L87 Difference]: Start difference. First operand 395 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:15:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:33,168 INFO L93 Difference]: Finished difference Result 620 states and 1825 transitions. [2020-02-10 20:15:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:33,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:33,170 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:15:33,170 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:15:33,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:15:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2020-02-10 20:15:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-02-10 20:15:33,180 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-02-10 20:15:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:33,180 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-02-10 20:15:33,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-02-10 20:15:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:33,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:33,181 INFO L415 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] [2020-02-10 20:15:33,181 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1906268820, now seen corresponding path program 519 times [2020-02-10 20:15:33,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:33,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869708625] [2020-02-10 20:15:33,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:33,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869708625] [2020-02-10 20:15:33,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:33,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:33,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107215334] [2020-02-10 20:15:33,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:33,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:33,460 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:15:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:33,557 INFO L93 Difference]: Finished difference Result 632 states and 1851 transitions. [2020-02-10 20:15:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:33,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:33,559 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:15:33,559 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:15:33,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:15:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 398. [2020-02-10 20:15:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:15:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1367 transitions. [2020-02-10 20:15:33,569 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1367 transitions. Word has length 22 [2020-02-10 20:15:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:33,569 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1367 transitions. [2020-02-10 20:15:33,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1367 transitions. [2020-02-10 20:15:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:33,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:33,570 INFO L415 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] [2020-02-10 20:15:33,570 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:33,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2099089512, now seen corresponding path program 520 times [2020-02-10 20:15:33,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:33,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253976756] [2020-02-10 20:15:33,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:33,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253976756] [2020-02-10 20:15:33,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:33,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:33,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012777303] [2020-02-10 20:15:33,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:33,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:33,867 INFO L87 Difference]: Start difference. First operand 398 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:15:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:34,015 INFO L93 Difference]: Finished difference Result 629 states and 1840 transitions. [2020-02-10 20:15:34,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:34,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:34,017 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:15:34,017 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:15:34,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:15:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-02-10 20:15:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 20:15:34,027 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:34,028 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 20:15:34,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 20:15:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:34,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:34,028 INFO L415 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] [2020-02-10 20:15:34,028 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash -61178548, now seen corresponding path program 521 times [2020-02-10 20:15:34,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:34,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709584166] [2020-02-10 20:15:34,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:34,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709584166] [2020-02-10 20:15:34,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:34,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:34,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249120139] [2020-02-10 20:15:34,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:34,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:34,300 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:34,427 INFO L93 Difference]: Finished difference Result 616 states and 1815 transitions. [2020-02-10 20:15:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:34,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:34,429 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:15:34,429 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:15:34,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:15:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2020-02-10 20:15:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-02-10 20:15:34,438 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-02-10 20:15:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:34,438 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-02-10 20:15:34,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-02-10 20:15:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:34,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:34,439 INFO L415 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] [2020-02-10 20:15:34,439 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash 510276258, now seen corresponding path program 522 times [2020-02-10 20:15:34,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:34,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473604377] [2020-02-10 20:15:34,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:34,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473604377] [2020-02-10 20:15:34,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:34,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:34,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439195045] [2020-02-10 20:15:34,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:34,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:34,709 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:15:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:34,813 INFO L93 Difference]: Finished difference Result 619 states and 1819 transitions. [2020-02-10 20:15:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:34,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:34,815 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:15:34,815 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:15:34,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:15:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 389. [2020-02-10 20:15:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1348 transitions. [2020-02-10 20:15:34,824 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1348 transitions. Word has length 22 [2020-02-10 20:15:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:34,825 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1348 transitions. [2020-02-10 20:15:34,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1348 transitions. [2020-02-10 20:15:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:34,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:34,825 INFO L415 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] [2020-02-10 20:15:34,825 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash -263095990, now seen corresponding path program 523 times [2020-02-10 20:15:34,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:34,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555986828] [2020-02-10 20:15:34,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:35,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555986828] [2020-02-10 20:15:35,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:35,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:35,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678532344] [2020-02-10 20:15:35,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:35,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:35,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:35,141 INFO L87 Difference]: Start difference. First operand 389 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:15:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:35,220 INFO L93 Difference]: Finished difference Result 594 states and 1767 transitions. [2020-02-10 20:15:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:35,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:35,222 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:15:35,222 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:15:35,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:15:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 391. [2020-02-10 20:15:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-02-10 20:15:35,234 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:35,234 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-02-10 20:15:35,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-02-10 20:15:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:35,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:35,235 INFO L415 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] [2020-02-10 20:15:35,236 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1347844968, now seen corresponding path program 524 times [2020-02-10 20:15:35,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:35,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786211021] [2020-02-10 20:15:35,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:35,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786211021] [2020-02-10 20:15:35,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:35,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:35,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984019259] [2020-02-10 20:15:35,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:35,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:35,531 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:35,659 INFO L93 Difference]: Finished difference Result 595 states and 1768 transitions. [2020-02-10 20:15:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:35,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:35,660 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:15:35,661 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:15:35,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:15:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 390. [2020-02-10 20:15:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1350 transitions. [2020-02-10 20:15:35,669 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1350 transitions. Word has length 22 [2020-02-10 20:15:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:35,669 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1350 transitions. [2020-02-10 20:15:35,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1350 transitions. [2020-02-10 20:15:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:35,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:35,670 INFO L415 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] [2020-02-10 20:15:35,670 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash -850841312, now seen corresponding path program 525 times [2020-02-10 20:15:35,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:35,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499991308] [2020-02-10 20:15:35,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:35,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499991308] [2020-02-10 20:15:35,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:35,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:35,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622224819] [2020-02-10 20:15:35,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:35,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:35,964 INFO L87 Difference]: Start difference. First operand 390 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:15:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:36,046 INFO L93 Difference]: Finished difference Result 597 states and 1772 transitions. [2020-02-10 20:15:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:36,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:36,048 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:15:36,048 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:15:36,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:15:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 391. [2020-02-10 20:15:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1351 transitions. [2020-02-10 20:15:36,056 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1351 transitions. Word has length 22 [2020-02-10 20:15:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:36,056 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1351 transitions. [2020-02-10 20:15:36,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1351 transitions. [2020-02-10 20:15:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:36,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:36,057 INFO L415 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] [2020-02-10 20:15:36,057 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1295329448, now seen corresponding path program 526 times [2020-02-10 20:15:36,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:36,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471392126] [2020-02-10 20:15:36,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:36,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471392126] [2020-02-10 20:15:36,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:36,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:36,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675823685] [2020-02-10 20:15:36,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:36,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:36,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:36,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:36,342 INFO L87 Difference]: Start difference. First operand 391 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:15:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:36,452 INFO L93 Difference]: Finished difference Result 601 states and 1779 transitions. [2020-02-10 20:15:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:36,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:36,454 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:15:36,454 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:15:36,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:15:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 390. [2020-02-10 20:15:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 20:15:36,462 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 20:15:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:36,462 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 20:15:36,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 20:15:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:36,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:36,463 INFO L415 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] [2020-02-10 20:15:36,463 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash -840338208, now seen corresponding path program 527 times [2020-02-10 20:15:36,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:36,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653302394] [2020-02-10 20:15:36,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:36,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653302394] [2020-02-10 20:15:36,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:36,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:36,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145969389] [2020-02-10 20:15:36,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:36,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:36,742 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:15:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:36,851 INFO L93 Difference]: Finished difference Result 600 states and 1778 transitions. [2020-02-10 20:15:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:36,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:36,853 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:15:36,853 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:15:36,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:15:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 392. [2020-02-10 20:15:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1352 transitions. [2020-02-10 20:15:36,862 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:36,863 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1352 transitions. [2020-02-10 20:15:36,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1352 transitions. [2020-02-10 20:15:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:36,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:36,863 INFO L415 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] [2020-02-10 20:15:36,863 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:36,864 INFO L82 PathProgramCache]: Analyzing trace with hash -305108406, now seen corresponding path program 528 times [2020-02-10 20:15:36,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:36,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119206157] [2020-02-10 20:15:36,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:37,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119206157] [2020-02-10 20:15:37,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:37,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:37,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047102486] [2020-02-10 20:15:37,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:37,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:37,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:37,148 INFO L87 Difference]: Start difference. First operand 392 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:37,257 INFO L93 Difference]: Finished difference Result 603 states and 1782 transitions. [2020-02-10 20:15:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:37,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:37,259 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:15:37,259 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:15:37,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:15:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 387. [2020-02-10 20:15:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:15:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1344 transitions. [2020-02-10 20:15:37,269 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1344 transitions. Word has length 22 [2020-02-10 20:15:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:37,269 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1344 transitions. [2020-02-10 20:15:37,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1344 transitions. [2020-02-10 20:15:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:37,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:37,269 INFO L415 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] [2020-02-10 20:15:37,269 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1273749844, now seen corresponding path program 529 times [2020-02-10 20:15:37,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:37,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550584740] [2020-02-10 20:15:37,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:37,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550584740] [2020-02-10 20:15:37,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:37,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:37,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484997219] [2020-02-10 20:15:37,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:37,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:37,551 INFO L87 Difference]: Start difference. First operand 387 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:15:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:37,633 INFO L93 Difference]: Finished difference Result 644 states and 1884 transitions. [2020-02-10 20:15:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:37,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:37,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:37,635 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:15:37,635 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:15:37,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:15:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 396. [2020-02-10 20:15:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-02-10 20:15:37,646 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-02-10 20:15:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:37,646 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-02-10 20:15:37,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-02-10 20:15:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:37,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:37,647 INFO L415 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] [2020-02-10 20:15:37,647 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1834818336, now seen corresponding path program 530 times [2020-02-10 20:15:37,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:37,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768651359] [2020-02-10 20:15:37,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:37,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768651359] [2020-02-10 20:15:37,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:37,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:37,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421105159] [2020-02-10 20:15:37,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:37,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:37,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:37,924 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:15:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:38,026 INFO L93 Difference]: Finished difference Result 637 states and 1869 transitions. [2020-02-10 20:15:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:38,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:38,028 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:15:38,028 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:15:38,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:15:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 394. [2020-02-10 20:15:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1363 transitions. [2020-02-10 20:15:38,042 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:38,042 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1363 transitions. [2020-02-10 20:15:38,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1363 transitions. [2020-02-10 20:15:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:38,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:38,043 INFO L415 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] [2020-02-10 20:15:38,043 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2008524920, now seen corresponding path program 531 times [2020-02-10 20:15:38,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:38,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977427481] [2020-02-10 20:15:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:38,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977427481] [2020-02-10 20:15:38,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:38,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:38,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340497039] [2020-02-10 20:15:38,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:38,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:38,331 INFO L87 Difference]: Start difference. First operand 394 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:38,412 INFO L93 Difference]: Finished difference Result 655 states and 1908 transitions. [2020-02-10 20:15:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:38,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:38,414 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:15:38,414 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:15:38,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:15:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 402. [2020-02-10 20:15:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 20:15:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1376 transitions. [2020-02-10 20:15:38,423 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1376 transitions. Word has length 22 [2020-02-10 20:15:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:38,423 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1376 transitions. [2020-02-10 20:15:38,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1376 transitions. [2020-02-10 20:15:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:38,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:38,424 INFO L415 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] [2020-02-10 20:15:38,424 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2138495366, now seen corresponding path program 532 times [2020-02-10 20:15:38,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:38,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247039013] [2020-02-10 20:15:38,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:38,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247039013] [2020-02-10 20:15:38,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:38,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:38,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157028823] [2020-02-10 20:15:38,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:38,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:38,706 INFO L87 Difference]: Start difference. First operand 402 states and 1376 transitions. Second operand 9 states. [2020-02-10 20:15:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:38,814 INFO L93 Difference]: Finished difference Result 653 states and 1898 transitions. [2020-02-10 20:15:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:38,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:38,816 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:15:38,816 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:15:38,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:15:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 394. [2020-02-10 20:15:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-02-10 20:15:38,825 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-02-10 20:15:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:38,825 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-02-10 20:15:38,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-02-10 20:15:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:38,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:38,826 INFO L415 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] [2020-02-10 20:15:38,826 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1953802694, now seen corresponding path program 533 times [2020-02-10 20:15:38,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:38,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104880260] [2020-02-10 20:15:38,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:39,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104880260] [2020-02-10 20:15:39,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:39,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:39,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367297424] [2020-02-10 20:15:39,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:39,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:39,099 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-02-10 20:15:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:39,182 INFO L93 Difference]: Finished difference Result 634 states and 1861 transitions. [2020-02-10 20:15:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:39,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:39,184 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:15:39,184 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:15:39,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:15:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 20:15:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-02-10 20:15:39,193 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:39,193 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-02-10 20:15:39,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-02-10 20:15:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:39,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:39,194 INFO L415 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] [2020-02-10 20:15:39,194 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:39,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1265453446, now seen corresponding path program 534 times [2020-02-10 20:15:39,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:39,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847167920] [2020-02-10 20:15:39,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847167920] [2020-02-10 20:15:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:39,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:39,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294479003] [2020-02-10 20:15:39,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:39,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:39,452 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:39,576 INFO L93 Difference]: Finished difference Result 639 states and 1870 transitions. [2020-02-10 20:15:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:39,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:39,578 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:15:39,578 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:15:39,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:15:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 391. [2020-02-10 20:15:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 20:15:39,588 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:39,588 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 20:15:39,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 20:15:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:39,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:39,589 INFO L415 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] [2020-02-10 20:15:39,589 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash 830850704, now seen corresponding path program 535 times [2020-02-10 20:15:39,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:39,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187551964] [2020-02-10 20:15:39,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:39,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187551964] [2020-02-10 20:15:39,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:39,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:39,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012878418] [2020-02-10 20:15:39,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:39,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:39,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:39,873 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:39,955 INFO L93 Difference]: Finished difference Result 640 states and 1873 transitions. [2020-02-10 20:15:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:39,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:39,957 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:15:39,957 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:15:39,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:39,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:15:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 395. [2020-02-10 20:15:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1362 transitions. [2020-02-10 20:15:39,967 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1362 transitions. Word has length 22 [2020-02-10 20:15:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:39,967 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1362 transitions. [2020-02-10 20:15:39,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1362 transitions. [2020-02-10 20:15:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:39,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:39,968 INFO L415 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] [2020-02-10 20:15:39,968 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1391919196, now seen corresponding path program 536 times [2020-02-10 20:15:39,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:39,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221146102] [2020-02-10 20:15:39,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:40,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221146102] [2020-02-10 20:15:40,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:40,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:40,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273723424] [2020-02-10 20:15:40,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:40,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:40,259 INFO L87 Difference]: Start difference. First operand 395 states and 1362 transitions. Second operand 9 states. [2020-02-10 20:15:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:40,342 INFO L93 Difference]: Finished difference Result 633 states and 1858 transitions. [2020-02-10 20:15:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:40,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:40,344 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:15:40,344 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:15:40,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:15:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 393. [2020-02-10 20:15:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1358 transitions. [2020-02-10 20:15:40,353 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:40,353 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1358 transitions. [2020-02-10 20:15:40,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1358 transitions. [2020-02-10 20:15:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:40,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:40,353 INFO L415 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] [2020-02-10 20:15:40,354 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1357332472, now seen corresponding path program 537 times [2020-02-10 20:15:40,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:40,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129183039] [2020-02-10 20:15:40,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:40,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129183039] [2020-02-10 20:15:40,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:40,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:40,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840835958] [2020-02-10 20:15:40,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:40,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:40,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:40,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:40,641 INFO L87 Difference]: Start difference. First operand 393 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:40,743 INFO L93 Difference]: Finished difference Result 648 states and 1891 transitions. [2020-02-10 20:15:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:40,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:40,745 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:15:40,745 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:15:40,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:15:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 399. [2020-02-10 20:15:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1368 transitions. [2020-02-10 20:15:40,754 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:40,754 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1368 transitions. [2020-02-10 20:15:40,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1368 transitions. [2020-02-10 20:15:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:40,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:40,755 INFO L415 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] [2020-02-10 20:15:40,755 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1164511780, now seen corresponding path program 538 times [2020-02-10 20:15:40,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:40,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448779798] [2020-02-10 20:15:40,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:41,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448779798] [2020-02-10 20:15:41,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:41,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:41,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724624396] [2020-02-10 20:15:41,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:41,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:41,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:41,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:41,035 INFO L87 Difference]: Start difference. First operand 399 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:41,138 INFO L93 Difference]: Finished difference Result 645 states and 1880 transitions. [2020-02-10 20:15:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:41,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:41,140 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:15:41,140 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:15:41,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:15:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2020-02-10 20:15:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-02-10 20:15:41,149 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,149 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-02-10 20:15:41,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-02-10 20:15:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:41,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,150 INFO L415 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] [2020-02-10 20:15:41,150 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1302610246, now seen corresponding path program 539 times [2020-02-10 20:15:41,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765535881] [2020-02-10 20:15:41,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:41,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765535881] [2020-02-10 20:15:41,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:41,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:41,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567801202] [2020-02-10 20:15:41,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:41,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:41,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:41,432 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:41,520 INFO L93 Difference]: Finished difference Result 629 states and 1849 transitions. [2020-02-10 20:15:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:41,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:41,522 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:15:41,522 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:15:41,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:15:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 394. [2020-02-10 20:15:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-02-10 20:15:41,531 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-02-10 20:15:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,531 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-02-10 20:15:41,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-02-10 20:15:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:41,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,532 INFO L415 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] [2020-02-10 20:15:41,532 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 843560514, now seen corresponding path program 540 times [2020-02-10 20:15:41,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763327113] [2020-02-10 20:15:41,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:41,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763327113] [2020-02-10 20:15:41,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:41,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:41,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488695258] [2020-02-10 20:15:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:41,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:41,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:41,809 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:15:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:41,906 INFO L93 Difference]: Finished difference Result 633 states and 1856 transitions. [2020-02-10 20:15:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:41,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:41,908 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:15:41,908 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:15:41,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:15:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 391. [2020-02-10 20:15:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-02-10 20:15:41,918 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,918 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-02-10 20:15:41,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-02-10 20:15:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:41,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,918 INFO L415 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] [2020-02-10 20:15:41,919 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1122726640, now seen corresponding path program 541 times [2020-02-10 20:15:41,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834500968] [2020-02-10 20:15:41,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:42,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834500968] [2020-02-10 20:15:42,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:42,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:42,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309853573] [2020-02-10 20:15:42,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:42,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:42,226 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:42,299 INFO L93 Difference]: Finished difference Result 672 states and 1954 transitions. [2020-02-10 20:15:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:42,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:42,300 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:15:42,301 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:15:42,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:15:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 407. [2020-02-10 20:15:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 20:15:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1390 transitions. [2020-02-10 20:15:42,309 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1390 transitions. Word has length 22 [2020-02-10 20:15:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:42,309 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1390 transitions. [2020-02-10 20:15:42,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1390 transitions. [2020-02-10 20:15:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:42,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:42,310 INFO L415 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] [2020-02-10 20:15:42,310 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:42,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1252697086, now seen corresponding path program 542 times [2020-02-10 20:15:42,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:42,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880432002] [2020-02-10 20:15:42,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:42,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880432002] [2020-02-10 20:15:42,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:42,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:42,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743497272] [2020-02-10 20:15:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:42,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:42,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:42,600 INFO L87 Difference]: Start difference. First operand 407 states and 1390 transitions. Second operand 9 states. [2020-02-10 20:15:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:42,693 INFO L93 Difference]: Finished difference Result 670 states and 1944 transitions. [2020-02-10 20:15:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:42,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:42,695 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:15:42,695 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:15:42,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:15:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 399. [2020-02-10 20:15:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1370 transitions. [2020-02-10 20:15:42,705 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1370 transitions. Word has length 22 [2020-02-10 20:15:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:42,705 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1370 transitions. [2020-02-10 20:15:42,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1370 transitions. [2020-02-10 20:15:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:42,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:42,706 INFO L415 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] [2020-02-10 20:15:42,706 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash -28635052, now seen corresponding path program 543 times [2020-02-10 20:15:42,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:42,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329976280] [2020-02-10 20:15:42,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:42,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329976280] [2020-02-10 20:15:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:42,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:42,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195530083] [2020-02-10 20:15:42,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:42,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:42,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:42,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:42,999 INFO L87 Difference]: Start difference. First operand 399 states and 1370 transitions. Second operand 9 states. [2020-02-10 20:15:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:43,070 INFO L93 Difference]: Finished difference Result 669 states and 1941 transitions. [2020-02-10 20:15:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:43,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:43,071 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:15:43,071 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:15:43,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:15:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 405. [2020-02-10 20:15:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 20:15:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1380 transitions. [2020-02-10 20:15:43,081 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1380 transitions. Word has length 22 [2020-02-10 20:15:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:43,081 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1380 transitions. [2020-02-10 20:15:43,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1380 transitions. [2020-02-10 20:15:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:43,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:43,082 INFO L415 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] [2020-02-10 20:15:43,082 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash 164185640, now seen corresponding path program 544 times [2020-02-10 20:15:43,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:43,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158181646] [2020-02-10 20:15:43,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:43,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158181646] [2020-02-10 20:15:43,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:43,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:43,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213875029] [2020-02-10 20:15:43,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:43,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:43,364 INFO L87 Difference]: Start difference. First operand 405 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:15:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:43,470 INFO L93 Difference]: Finished difference Result 666 states and 1930 transitions. [2020-02-10 20:15:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:43,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:43,472 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:15:43,472 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 20:15:43,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 20:15:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 399. [2020-02-10 20:15:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1364 transitions. [2020-02-10 20:15:43,482 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1364 transitions. Word has length 22 [2020-02-10 20:15:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:43,482 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1364 transitions. [2020-02-10 20:15:43,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1364 transitions. [2020-02-10 20:15:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:43,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:43,483 INFO L415 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] [2020-02-10 20:15:43,483 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash 454801510, now seen corresponding path program 545 times [2020-02-10 20:15:43,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:43,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745316872] [2020-02-10 20:15:43,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:43,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745316872] [2020-02-10 20:15:43,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:43,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:43,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854833134] [2020-02-10 20:15:43,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:43,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:43,772 INFO L87 Difference]: Start difference. First operand 399 states and 1364 transitions. Second operand 9 states. [2020-02-10 20:15:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:43,872 INFO L93 Difference]: Finished difference Result 664 states and 1927 transitions. [2020-02-10 20:15:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:43,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:43,874 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:15:43,874 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:15:43,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:15:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 404. [2020-02-10 20:15:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 20:15:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1373 transitions. [2020-02-10 20:15:43,883 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1373 transitions. Word has length 22 [2020-02-10 20:15:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:43,883 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1373 transitions. [2020-02-10 20:15:43,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1373 transitions. [2020-02-10 20:15:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:43,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:43,884 INFO L415 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] [2020-02-10 20:15:43,884 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash 510212770, now seen corresponding path program 546 times [2020-02-10 20:15:43,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:43,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682524535] [2020-02-10 20:15:43,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:44,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682524535] [2020-02-10 20:15:44,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:44,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:44,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317223480] [2020-02-10 20:15:44,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:44,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:44,171 INFO L87 Difference]: Start difference. First operand 404 states and 1373 transitions. Second operand 9 states. [2020-02-10 20:15:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:44,272 INFO L93 Difference]: Finished difference Result 663 states and 1920 transitions. [2020-02-10 20:15:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:44,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:44,274 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:15:44,274 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:15:44,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:15:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 20:15:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1348 transitions. [2020-02-10 20:15:44,283 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1348 transitions. Word has length 22 [2020-02-10 20:15:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:44,284 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1348 transitions. [2020-02-10 20:15:44,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1348 transitions. [2020-02-10 20:15:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:44,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:44,284 INFO L415 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] [2020-02-10 20:15:44,285 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash 415130524, now seen corresponding path program 547 times [2020-02-10 20:15:44,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:44,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987157732] [2020-02-10 20:15:44,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:44,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987157732] [2020-02-10 20:15:44,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:44,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:44,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627349975] [2020-02-10 20:15:44,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:44,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:44,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:44,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:44,557 INFO L87 Difference]: Start difference. First operand 391 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:15:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:44,631 INFO L93 Difference]: Finished difference Result 625 states and 1839 transitions. [2020-02-10 20:15:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:44,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:44,633 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:15:44,633 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:15:44,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:15:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 393. [2020-02-10 20:15:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1352 transitions. [2020-02-10 20:15:44,642 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1352 transitions. Word has length 22 [2020-02-10 20:15:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:44,642 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1352 transitions. [2020-02-10 20:15:44,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1352 transitions. [2020-02-10 20:15:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:44,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:44,643 INFO L415 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] [2020-02-10 20:15:44,643 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash -660580632, now seen corresponding path program 548 times [2020-02-10 20:15:44,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:44,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239337344] [2020-02-10 20:15:44,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:44,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239337344] [2020-02-10 20:15:44,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:44,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:44,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666143710] [2020-02-10 20:15:44,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:44,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:44,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:44,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:44,917 INFO L87 Difference]: Start difference. First operand 393 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:15:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:45,016 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-02-10 20:15:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:45,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:45,018 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:15:45,018 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:15:45,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:15:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 392. [2020-02-10 20:15:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-02-10 20:15:45,028 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-02-10 20:15:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,028 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-02-10 20:15:45,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-02-10 20:15:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:45,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,029 INFO L415 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] [2020-02-10 20:15:45,029 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1509222112, now seen corresponding path program 549 times [2020-02-10 20:15:45,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320267682] [2020-02-10 20:15:45,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:45,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320267682] [2020-02-10 20:15:45,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:45,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:45,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27182052] [2020-02-10 20:15:45,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:45,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:45,315 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:15:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:45,386 INFO L93 Difference]: Finished difference Result 624 states and 1836 transitions. [2020-02-10 20:15:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:45,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:45,388 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:15:45,388 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:15:45,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:15:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 393. [2020-02-10 20:15:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:15:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1351 transitions. [2020-02-10 20:15:45,398 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1351 transitions. Word has length 22 [2020-02-10 20:15:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,398 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1351 transitions. [2020-02-10 20:15:45,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1351 transitions. [2020-02-10 20:15:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:45,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,399 INFO L415 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] [2020-02-10 20:15:45,399 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash -639574424, now seen corresponding path program 550 times [2020-02-10 20:15:45,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347674339] [2020-02-10 20:15:45,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:45,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347674339] [2020-02-10 20:15:45,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:45,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:45,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053586502] [2020-02-10 20:15:45,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:45,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:45,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:45,684 INFO L87 Difference]: Start difference. First operand 393 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:15:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:45,789 INFO L93 Difference]: Finished difference Result 628 states and 1843 transitions. [2020-02-10 20:15:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:45,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:45,790 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:15:45,791 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:15:45,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:15:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 392. [2020-02-10 20:15:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1349 transitions. [2020-02-10 20:15:45,800 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1349 transitions. Word has length 22 [2020-02-10 20:15:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,800 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1349 transitions. [2020-02-10 20:15:45,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1349 transitions. [2020-02-10 20:15:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:45,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,801 INFO L415 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] [2020-02-10 20:15:45,801 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1446203488, now seen corresponding path program 551 times [2020-02-10 20:15:45,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356199354] [2020-02-10 20:15:45,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:46,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356199354] [2020-02-10 20:15:46,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:46,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:46,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110462131] [2020-02-10 20:15:46,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:46,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:46,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:46,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:46,087 INFO L87 Difference]: Start difference. First operand 392 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:15:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:46,186 INFO L93 Difference]: Finished difference Result 638 states and 1867 transitions. [2020-02-10 20:15:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:46,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:46,188 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:15:46,188 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:15:46,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:15:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 397. [2020-02-10 20:15:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1358 transitions. [2020-02-10 20:15:46,197 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:46,197 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1358 transitions. [2020-02-10 20:15:46,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1358 transitions. [2020-02-10 20:15:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:46,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:46,197 INFO L415 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] [2020-02-10 20:15:46,198 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:46,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:46,198 INFO L82 PathProgramCache]: Analyzing trace with hash 373118108, now seen corresponding path program 552 times [2020-02-10 20:15:46,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:46,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130235235] [2020-02-10 20:15:46,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:46,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130235235] [2020-02-10 20:15:46,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:46,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:46,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698027097] [2020-02-10 20:15:46,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:46,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:46,481 INFO L87 Difference]: Start difference. First operand 397 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:46,583 INFO L93 Difference]: Finished difference Result 637 states and 1860 transitions. [2020-02-10 20:15:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:46,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:46,584 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:15:46,585 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:15:46,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:15:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 387. [2020-02-10 20:15:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:15:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 20:15:46,594 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 20:15:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:46,594 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 20:15:46,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 20:15:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:46,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:46,595 INFO L415 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] [2020-02-10 20:15:46,595 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1176860342, now seen corresponding path program 553 times [2020-02-10 20:15:46,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:46,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767119971] [2020-02-10 20:15:46,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:46,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767119971] [2020-02-10 20:15:46,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:46,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:46,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721250986] [2020-02-10 20:15:46,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:46,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:46,883 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:15:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:46,960 INFO L93 Difference]: Finished difference Result 658 states and 1925 transitions. [2020-02-10 20:15:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:46,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:46,962 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:15:46,962 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:15:46,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:15:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 399. [2020-02-10 20:15:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1374 transitions. [2020-02-10 20:15:46,973 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1374 transitions. Word has length 22 [2020-02-10 20:15:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:46,973 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1374 transitions. [2020-02-10 20:15:46,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1374 transitions. [2020-02-10 20:15:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:46,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:46,973 INFO L415 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] [2020-02-10 20:15:46,974 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash 214656680, now seen corresponding path program 554 times [2020-02-10 20:15:46,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:46,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000853794] [2020-02-10 20:15:46,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:47,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000853794] [2020-02-10 20:15:47,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:47,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:47,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480791531] [2020-02-10 20:15:47,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:47,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:47,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:47,253 INFO L87 Difference]: Start difference. First operand 399 states and 1374 transitions. Second operand 9 states. [2020-02-10 20:15:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:47,358 INFO L93 Difference]: Finished difference Result 652 states and 1911 transitions. [2020-02-10 20:15:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:47,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:47,359 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:15:47,360 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:15:47,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:15:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 396. [2020-02-10 20:15:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-02-10 20:15:47,370 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-02-10 20:15:47,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:47,370 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-02-10 20:15:47,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-02-10 20:15:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:47,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:47,370 INFO L415 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] [2020-02-10 20:15:47,371 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash -504976568, now seen corresponding path program 555 times [2020-02-10 20:15:47,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:47,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584846422] [2020-02-10 20:15:47,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:47,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584846422] [2020-02-10 20:15:47,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:47,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:47,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001355517] [2020-02-10 20:15:47,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:47,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:47,659 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-02-10 20:15:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:47,744 INFO L93 Difference]: Finished difference Result 667 states and 1943 transitions. [2020-02-10 20:15:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:47,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:47,746 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:15:47,746 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 20:15:47,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 20:15:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 404. [2020-02-10 20:15:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 20:15:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1380 transitions. [2020-02-10 20:15:47,756 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1380 transitions. Word has length 22 [2020-02-10 20:15:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:47,757 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1380 transitions. [2020-02-10 20:15:47,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1380 transitions. [2020-02-10 20:15:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:47,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:47,757 INFO L415 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] [2020-02-10 20:15:47,757 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash -634947014, now seen corresponding path program 556 times [2020-02-10 20:15:47,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:47,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426683979] [2020-02-10 20:15:47,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:48,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426683979] [2020-02-10 20:15:48,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:48,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:48,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217951905] [2020-02-10 20:15:48,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:48,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:48,041 INFO L87 Difference]: Start difference. First operand 404 states and 1380 transitions. Second operand 9 states. [2020-02-10 20:15:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:48,144 INFO L93 Difference]: Finished difference Result 665 states and 1933 transitions. [2020-02-10 20:15:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:48,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:48,146 INFO L225 Difference]: With dead ends: 665 [2020-02-10 20:15:48,146 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 20:15:48,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 20:15:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 396. [2020-02-10 20:15:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-02-10 20:15:48,158 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:48,158 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-02-10 20:15:48,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-02-10 20:15:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:48,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:48,160 INFO L415 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] [2020-02-10 20:15:48,160 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:48,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1399338556, now seen corresponding path program 557 times [2020-02-10 20:15:48,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:48,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671557865] [2020-02-10 20:15:48,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:48,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671557865] [2020-02-10 20:15:48,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:48,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:48,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401380726] [2020-02-10 20:15:48,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:48,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:48,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:48,443 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:48,539 INFO L93 Difference]: Finished difference Result 649 states and 1902 transitions. [2020-02-10 20:15:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:48,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:48,541 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:15:48,541 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:15:48,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:15:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 398. [2020-02-10 20:15:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:15:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1366 transitions. [2020-02-10 20:15:48,551 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1366 transitions. Word has length 22 [2020-02-10 20:15:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:48,552 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1366 transitions. [2020-02-10 20:15:48,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1366 transitions. [2020-02-10 20:15:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:48,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:48,552 INFO L415 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] [2020-02-10 20:15:48,552 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1977678550, now seen corresponding path program 558 times [2020-02-10 20:15:48,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:48,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943902614] [2020-02-10 20:15:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:48,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943902614] [2020-02-10 20:15:48,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:48,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:48,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387773649] [2020-02-10 20:15:48,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:48,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:48,819 INFO L87 Difference]: Start difference. First operand 398 states and 1366 transitions. Second operand 9 states. [2020-02-10 20:15:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:48,922 INFO L93 Difference]: Finished difference Result 653 states and 1908 transitions. [2020-02-10 20:15:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:48,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:48,923 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:15:48,924 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:15:48,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:15:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 392. [2020-02-10 20:15:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 20:15:48,933 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:48,933 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 20:15:48,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 20:15:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:48,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:48,934 INFO L415 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] [2020-02-10 20:15:48,934 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash 733961202, now seen corresponding path program 559 times [2020-02-10 20:15:48,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:48,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502791646] [2020-02-10 20:15:48,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:49,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502791646] [2020-02-10 20:15:49,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:49,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:49,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288513447] [2020-02-10 20:15:49,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:49,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:49,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:49,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:49,210 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:49,289 INFO L93 Difference]: Finished difference Result 654 states and 1913 transitions. [2020-02-10 20:15:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:49,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:49,291 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:15:49,291 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:15:49,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:15:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 398. [2020-02-10 20:15:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:15:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1368 transitions. [2020-02-10 20:15:49,301 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1368 transitions. Word has length 22 [2020-02-10 20:15:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:49,301 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1368 transitions. [2020-02-10 20:15:49,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1368 transitions. [2020-02-10 20:15:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:49,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:49,302 INFO L415 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] [2020-02-10 20:15:49,302 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash -228242460, now seen corresponding path program 560 times [2020-02-10 20:15:49,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:49,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797985721] [2020-02-10 20:15:49,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:49,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797985721] [2020-02-10 20:15:49,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:49,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:49,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807221097] [2020-02-10 20:15:49,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:49,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:49,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:49,571 INFO L87 Difference]: Start difference. First operand 398 states and 1368 transitions. Second operand 9 states. [2020-02-10 20:15:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:49,670 INFO L93 Difference]: Finished difference Result 648 states and 1899 transitions. [2020-02-10 20:15:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:49,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:49,671 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:15:49,672 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:15:49,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:15:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 395. [2020-02-10 20:15:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-02-10 20:15:49,680 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:49,681 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-02-10 20:15:49,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-02-10 20:15:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:49,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:49,681 INFO L415 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] [2020-02-10 20:15:49,681 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:49,682 INFO L82 PathProgramCache]: Analyzing trace with hash 146215880, now seen corresponding path program 561 times [2020-02-10 20:15:49,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:49,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003162961] [2020-02-10 20:15:49,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:49,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003162961] [2020-02-10 20:15:49,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:49,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:49,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503014919] [2020-02-10 20:15:49,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:49,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:49,972 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:50,055 INFO L93 Difference]: Finished difference Result 660 states and 1925 transitions. [2020-02-10 20:15:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:50,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:50,057 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:15:50,057 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 20:15:50,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 20:15:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 401. [2020-02-10 20:15:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 20:15:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1371 transitions. [2020-02-10 20:15:50,067 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1371 transitions. Word has length 22 [2020-02-10 20:15:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:50,067 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1371 transitions. [2020-02-10 20:15:50,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1371 transitions. [2020-02-10 20:15:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:50,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:50,068 INFO L415 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] [2020-02-10 20:15:50,068 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 339036572, now seen corresponding path program 562 times [2020-02-10 20:15:50,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:50,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781934220] [2020-02-10 20:15:50,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:50,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781934220] [2020-02-10 20:15:50,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:50,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606188645] [2020-02-10 20:15:50,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:50,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:50,343 INFO L87 Difference]: Start difference. First operand 401 states and 1371 transitions. Second operand 9 states. [2020-02-10 20:15:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:50,448 INFO L93 Difference]: Finished difference Result 657 states and 1914 transitions. [2020-02-10 20:15:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:50,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:50,450 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:15:50,450 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:15:50,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:15:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 395. [2020-02-10 20:15:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:15:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1358 transitions. [2020-02-10 20:15:50,460 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:50,460 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1358 transitions. [2020-02-10 20:15:50,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1358 transitions. [2020-02-10 20:15:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:50,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:50,461 INFO L415 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] [2020-02-10 20:15:50,461 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1821231488, now seen corresponding path program 563 times [2020-02-10 20:15:50,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:50,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956354604] [2020-02-10 20:15:50,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:50,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956354604] [2020-02-10 20:15:50,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:50,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:50,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984908259] [2020-02-10 20:15:50,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:50,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:50,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:50,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:50,730 INFO L87 Difference]: Start difference. First operand 395 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:50,826 INFO L93 Difference]: Finished difference Result 644 states and 1889 transitions. [2020-02-10 20:15:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:50,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:50,828 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:15:50,828 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:15:50,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:15:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 397. [2020-02-10 20:15:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:15:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1361 transitions. [2020-02-10 20:15:50,838 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1361 transitions. Word has length 22 [2020-02-10 20:15:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:50,838 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1361 transitions. [2020-02-10 20:15:50,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1361 transitions. [2020-02-10 20:15:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:50,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:50,839 INFO L415 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] [2020-02-10 20:15:50,839 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1249776682, now seen corresponding path program 564 times [2020-02-10 20:15:50,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:50,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13580873] [2020-02-10 20:15:50,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:51,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13580873] [2020-02-10 20:15:51,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:51,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:51,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856972381] [2020-02-10 20:15:51,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:51,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:51,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:51,118 INFO L87 Difference]: Start difference. First operand 397 states and 1361 transitions. Second operand 9 states. [2020-02-10 20:15:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:51,224 INFO L93 Difference]: Finished difference Result 647 states and 1893 transitions. [2020-02-10 20:15:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:51,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:51,226 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:15:51,226 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:15:51,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:15:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 392. [2020-02-10 20:15:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1351 transitions. [2020-02-10 20:15:51,236 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1351 transitions. Word has length 22 [2020-02-10 20:15:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:51,237 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1351 transitions. [2020-02-10 20:15:51,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1351 transitions. [2020-02-10 20:15:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:51,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:51,237 INFO L415 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] [2020-02-10 20:15:51,238 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1545212366, now seen corresponding path program 565 times [2020-02-10 20:15:51,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:51,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737509212] [2020-02-10 20:15:51,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:51,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737509212] [2020-02-10 20:15:51,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:51,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:51,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987377971] [2020-02-10 20:15:51,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:51,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:51,537 INFO L87 Difference]: Start difference. First operand 392 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:15:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:51,614 INFO L93 Difference]: Finished difference Result 680 states and 1976 transitions. [2020-02-10 20:15:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:51,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:51,616 INFO L225 Difference]: With dead ends: 680 [2020-02-10 20:15:51,616 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 20:15:51,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 20:15:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 408. [2020-02-10 20:15:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-02-10 20:15:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1389 transitions. [2020-02-10 20:15:51,626 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1389 transitions. Word has length 22 [2020-02-10 20:15:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:51,626 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 1389 transitions. [2020-02-10 20:15:51,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1389 transitions. [2020-02-10 20:15:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:51,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:51,627 INFO L415 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] [2020-02-10 20:15:51,627 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1675182812, now seen corresponding path program 566 times [2020-02-10 20:15:51,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:51,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908587416] [2020-02-10 20:15:51,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:51,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908587416] [2020-02-10 20:15:51,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:51,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:51,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971804436] [2020-02-10 20:15:51,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:51,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:51,914 INFO L87 Difference]: Start difference. First operand 408 states and 1389 transitions. Second operand 9 states. [2020-02-10 20:15:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:52,018 INFO L93 Difference]: Finished difference Result 678 states and 1966 transitions. [2020-02-10 20:15:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:52,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:52,020 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:15:52,020 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:15:52,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:15:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 400. [2020-02-10 20:15:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:15:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1369 transitions. [2020-02-10 20:15:52,029 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1369 transitions. Word has length 22 [2020-02-10 20:15:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:52,030 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1369 transitions. [2020-02-10 20:15:52,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1369 transitions. [2020-02-10 20:15:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:52,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:52,030 INFO L415 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] [2020-02-10 20:15:52,030 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -451120778, now seen corresponding path program 567 times [2020-02-10 20:15:52,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:52,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079039051] [2020-02-10 20:15:52,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:52,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079039051] [2020-02-10 20:15:52,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:52,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:52,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012694638] [2020-02-10 20:15:52,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:52,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:52,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:52,332 INFO L87 Difference]: Start difference. First operand 400 states and 1369 transitions. Second operand 9 states. [2020-02-10 20:15:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:52,409 INFO L93 Difference]: Finished difference Result 677 states and 1963 transitions. [2020-02-10 20:15:52,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:52,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:52,411 INFO L225 Difference]: With dead ends: 677 [2020-02-10 20:15:52,411 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 20:15:52,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 20:15:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 406. [2020-02-10 20:15:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 20:15:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1379 transitions. [2020-02-10 20:15:52,422 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1379 transitions. Word has length 22 [2020-02-10 20:15:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:52,422 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1379 transitions. [2020-02-10 20:15:52,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1379 transitions. [2020-02-10 20:15:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:52,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:52,422 INFO L415 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] [2020-02-10 20:15:52,423 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash -258300086, now seen corresponding path program 568 times [2020-02-10 20:15:52,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:52,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456665715] [2020-02-10 20:15:52,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:52,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456665715] [2020-02-10 20:15:52,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:52,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:52,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340343952] [2020-02-10 20:15:52,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:52,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:52,705 INFO L87 Difference]: Start difference. First operand 406 states and 1379 transitions. Second operand 9 states. [2020-02-10 20:15:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:52,811 INFO L93 Difference]: Finished difference Result 674 states and 1952 transitions. [2020-02-10 20:15:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:52,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:52,813 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:15:52,813 INFO L226 Difference]: Without dead ends: 655 [2020-02-10 20:15:52,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-02-10 20:15:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 400. [2020-02-10 20:15:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 20:15:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1363 transitions. [2020-02-10 20:15:52,822 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1363 transitions. Word has length 22 [2020-02-10 20:15:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:52,822 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1363 transitions. [2020-02-10 20:15:52,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1363 transitions. [2020-02-10 20:15:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:52,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:52,823 INFO L415 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] [2020-02-10 20:15:52,823 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:52,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash 32315784, now seen corresponding path program 569 times [2020-02-10 20:15:52,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:52,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412801676] [2020-02-10 20:15:52,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412801676] [2020-02-10 20:15:53,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:53,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277003859] [2020-02-10 20:15:53,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:53,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:53,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:53,109 INFO L87 Difference]: Start difference. First operand 400 states and 1363 transitions. Second operand 9 states. [2020-02-10 20:15:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:53,208 INFO L93 Difference]: Finished difference Result 672 states and 1949 transitions. [2020-02-10 20:15:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:53,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:53,209 INFO L225 Difference]: With dead ends: 672 [2020-02-10 20:15:53,210 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 20:15:53,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 20:15:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 405. [2020-02-10 20:15:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 20:15:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1372 transitions. [2020-02-10 20:15:53,219 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1372 transitions. Word has length 22 [2020-02-10 20:15:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:53,219 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1372 transitions. [2020-02-10 20:15:53,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1372 transitions. [2020-02-10 20:15:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:53,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:53,220 INFO L415 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] [2020-02-10 20:15:53,220 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash 87727044, now seen corresponding path program 570 times [2020-02-10 20:15:53,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:53,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238051582] [2020-02-10 20:15:53,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238051582] [2020-02-10 20:15:53,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:53,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617771912] [2020-02-10 20:15:53,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:53,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:53,509 INFO L87 Difference]: Start difference. First operand 405 states and 1372 transitions. Second operand 9 states. [2020-02-10 20:15:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:53,624 INFO L93 Difference]: Finished difference Result 671 states and 1942 transitions. [2020-02-10 20:15:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:53,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:53,626 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:15:53,626 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:15:53,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:15:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 392. [2020-02-10 20:15:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:15:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1346 transitions. [2020-02-10 20:15:53,635 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1346 transitions. Word has length 22 [2020-02-10 20:15:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:53,636 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1346 transitions. [2020-02-10 20:15:53,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1346 transitions. [2020-02-10 20:15:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:53,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:53,636 INFO L415 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] [2020-02-10 20:15:53,637 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 757609128, now seen corresponding path program 571 times [2020-02-10 20:15:53,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:53,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315293438] [2020-02-10 20:15:53,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315293438] [2020-02-10 20:15:53,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:53,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416528707] [2020-02-10 20:15:53,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:53,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:53,906 INFO L87 Difference]: Start difference. First operand 392 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:15:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:54,004 INFO L93 Difference]: Finished difference Result 640 states and 1879 transitions. [2020-02-10 20:15:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:54,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:54,006 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:15:54,006 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:15:54,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:15:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 396. [2020-02-10 20:15:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1356 transitions. [2020-02-10 20:15:54,015 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1356 transitions. Word has length 22 [2020-02-10 20:15:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:54,015 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1356 transitions. [2020-02-10 20:15:54,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1356 transitions. [2020-02-10 20:15:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:54,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:54,016 INFO L415 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] [2020-02-10 20:15:54,016 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash -160341062, now seen corresponding path program 572 times [2020-02-10 20:15:54,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:54,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17176004] [2020-02-10 20:15:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:54,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17176004] [2020-02-10 20:15:54,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:54,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:54,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662920296] [2020-02-10 20:15:54,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:54,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:54,287 INFO L87 Difference]: Start difference. First operand 396 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:15:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:54,396 INFO L93 Difference]: Finished difference Result 644 states and 1885 transitions. [2020-02-10 20:15:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:54,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:54,398 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:15:54,398 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:15:54,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:15:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-02-10 20:15:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1351 transitions. [2020-02-10 20:15:54,407 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1351 transitions. Word has length 22 [2020-02-10 20:15:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:54,407 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1351 transitions. [2020-02-10 20:15:54,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1351 transitions. [2020-02-10 20:15:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:54,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:54,408 INFO L415 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] [2020-02-10 20:15:54,408 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash -315476252, now seen corresponding path program 573 times [2020-02-10 20:15:54,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:54,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931964383] [2020-02-10 20:15:54,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:54,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931964383] [2020-02-10 20:15:54,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:54,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:54,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210044050] [2020-02-10 20:15:54,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:54,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:54,681 INFO L87 Difference]: Start difference. First operand 394 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:15:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:54,796 INFO L93 Difference]: Finished difference Result 639 states and 1875 transitions. [2020-02-10 20:15:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:54,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:54,798 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:15:54,798 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:15:54,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:15:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 396. [2020-02-10 20:15:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:15:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1354 transitions. [2020-02-10 20:15:54,807 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1354 transitions. Word has length 22 [2020-02-10 20:15:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:54,807 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1354 transitions. [2020-02-10 20:15:54,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1354 transitions. [2020-02-10 20:15:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:54,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:54,807 INFO L415 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] [2020-02-10 20:15:54,808 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash 255978554, now seen corresponding path program 574 times [2020-02-10 20:15:54,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:54,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023876227] [2020-02-10 20:15:54,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:55,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023876227] [2020-02-10 20:15:55,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:55,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:55,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401055952] [2020-02-10 20:15:55,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:55,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:55,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:55,077 INFO L87 Difference]: Start difference. First operand 396 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:15:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:55,183 INFO L93 Difference]: Finished difference Result 642 states and 1879 transitions. [2020-02-10 20:15:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:55,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:55,185 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:15:55,185 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:15:55,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:15:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 394. [2020-02-10 20:15:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:15:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1349 transitions. [2020-02-10 20:15:55,195 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1349 transitions. Word has length 22 [2020-02-10 20:15:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:55,195 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1349 transitions. [2020-02-10 20:15:55,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1349 transitions. [2020-02-10 20:15:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:55,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:55,196 INFO L415 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] [2020-02-10 20:15:55,196 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 374888740, now seen corresponding path program 575 times [2020-02-10 20:15:55,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:55,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106693476] [2020-02-10 20:15:55,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:55,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106693476] [2020-02-10 20:15:55,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:55,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:55,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696852806] [2020-02-10 20:15:55,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:55,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:55,469 INFO L87 Difference]: Start difference. First operand 394 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:15:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:55,569 INFO L93 Difference]: Finished difference Result 650 states and 1898 transitions. [2020-02-10 20:15:55,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:55,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:55,571 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:15:55,571 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 20:15:55,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 20:15:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 399. [2020-02-10 20:15:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:15:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1358 transitions. [2020-02-10 20:15:55,581 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1358 transitions. Word has length 22 [2020-02-10 20:15:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:55,581 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1358 transitions. [2020-02-10 20:15:55,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1358 transitions. [2020-02-10 20:15:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:55,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:55,582 INFO L415 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] [2020-02-10 20:15:55,582 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1864293736, now seen corresponding path program 576 times [2020-02-10 20:15:55,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:55,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786960706] [2020-02-10 20:15:55,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:55,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786960706] [2020-02-10 20:15:55,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:55,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:55,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062141319] [2020-02-10 20:15:55,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:55,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:55,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:55,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:55,863 INFO L87 Difference]: Start difference. First operand 399 states and 1358 transitions. Second operand 9 states. [2020-02-10 20:15:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:55,972 INFO L93 Difference]: Finished difference Result 649 states and 1891 transitions. [2020-02-10 20:15:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:55,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:55,974 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:15:55,974 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:15:55,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:15:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 387. [2020-02-10 20:15:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:15:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:15:55,984 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:15:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:55,984 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:15:55,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:15:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:55,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:55,985 INFO L415 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] [2020-02-10 20:15:55,985 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:55,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1447260328, now seen corresponding path program 577 times [2020-02-10 20:15:55,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:55,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237298638] [2020-02-10 20:15:55,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:56,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237298638] [2020-02-10 20:15:56,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:56,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:56,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239081167] [2020-02-10 20:15:56,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:56,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:56,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:56,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:56,272 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:15:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:56,362 INFO L93 Difference]: Finished difference Result 586 states and 1743 transitions. [2020-02-10 20:15:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:56,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:56,364 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:15:56,364 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:15:56,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:15:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2020-02-10 20:15:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-02-10 20:15:56,373 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-02-10 20:15:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:56,373 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-02-10 20:15:56,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-02-10 20:15:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:56,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:56,374 INFO L415 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] [2020-02-10 20:15:56,374 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1236766010, now seen corresponding path program 578 times [2020-02-10 20:15:56,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:56,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561118752] [2020-02-10 20:15:56,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:56,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561118752] [2020-02-10 20:15:56,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:56,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:56,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306107147] [2020-02-10 20:15:56,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:56,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:56,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:56,657 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:15:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:56,769 INFO L93 Difference]: Finished difference Result 587 states and 1744 transitions. [2020-02-10 20:15:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:56,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:56,771 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:15:56,771 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:15:56,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:15:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2020-02-10 20:15:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 20:15:56,780 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 20:15:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:56,780 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 20:15:56,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 20:15:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:56,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:56,781 INFO L415 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] [2020-02-10 20:15:56,781 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:56,781 INFO L82 PathProgramCache]: Analyzing trace with hash -234576582, now seen corresponding path program 579 times [2020-02-10 20:15:56,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:56,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302011461] [2020-02-10 20:15:56,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302011461] [2020-02-10 20:15:57,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:57,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60973248] [2020-02-10 20:15:57,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:57,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:57,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:57,052 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:15:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,139 INFO L93 Difference]: Finished difference Result 590 states and 1750 transitions. [2020-02-10 20:15:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:57,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,141 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:15:57,141 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:15:57,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:15:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 390. [2020-02-10 20:15:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 20:15:57,149 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 20:15:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:57,149 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 20:15:57,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 20:15:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:57,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:57,150 INFO L415 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] [2020-02-10 20:15:57,150 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1310287738, now seen corresponding path program 580 times [2020-02-10 20:15:57,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:57,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196278220] [2020-02-10 20:15:57,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196278220] [2020-02-10 20:15:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:57,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008800714] [2020-02-10 20:15:57,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:57,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:57,421 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:15:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,528 INFO L93 Difference]: Finished difference Result 595 states and 1759 transitions. [2020-02-10 20:15:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:57,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,530 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:15:57,530 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:15:57,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:15:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-02-10 20:15:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 20:15:57,539 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 20:15:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:57,539 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 20:15:57,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 20:15:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:57,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:57,540 INFO L415 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] [2020-02-10 20:15:57,540 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -224073478, now seen corresponding path program 581 times [2020-02-10 20:15:57,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:57,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481602270] [2020-02-10 20:15:57,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481602270] [2020-02-10 20:15:57,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:57,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225284472] [2020-02-10 20:15:57,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:57,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:57,806 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:15:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,910 INFO L93 Difference]: Finished difference Result 593 states and 1756 transitions. [2020-02-10 20:15:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:57,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,912 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:15:57,912 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:15:57,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:15:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 391. [2020-02-10 20:15:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:15:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1344 transitions. [2020-02-10 20:15:57,921 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1344 transitions. Word has length 22 [2020-02-10 20:15:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:57,921 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1344 transitions. [2020-02-10 20:15:57,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1344 transitions. [2020-02-10 20:15:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:57,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:57,922 INFO L415 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] [2020-02-10 20:15:57,922 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1384241704, now seen corresponding path program 582 times [2020-02-10 20:15:57,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:57,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366526209] [2020-02-10 20:15:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:58,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366526209] [2020-02-10 20:15:58,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:58,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:58,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335994208] [2020-02-10 20:15:58,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:58,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:58,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:58,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:58,195 INFO L87 Difference]: Start difference. First operand 391 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:15:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:58,296 INFO L93 Difference]: Finished difference Result 597 states and 1762 transitions. [2020-02-10 20:15:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:58,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:58,298 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:15:58,298 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:15:58,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:15:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 388. [2020-02-10 20:15:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:15:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1339 transitions. [2020-02-10 20:15:58,308 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1339 transitions. Word has length 22 [2020-02-10 20:15:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:58,308 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1339 transitions. [2020-02-10 20:15:58,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1339 transitions. [2020-02-10 20:15:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:58,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:58,309 INFO L415 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] [2020-02-10 20:15:58,309 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1004361188, now seen corresponding path program 583 times [2020-02-10 20:15:58,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:58,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777659349] [2020-02-10 20:15:58,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:58,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777659349] [2020-02-10 20:15:58,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:58,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:58,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005509183] [2020-02-10 20:15:58,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:58,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:58,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:58,606 INFO L87 Difference]: Start difference. First operand 388 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:15:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:58,721 INFO L93 Difference]: Finished difference Result 585 states and 1740 transitions. [2020-02-10 20:15:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:58,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:58,723 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:15:58,723 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:15:58,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:15:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 390. [2020-02-10 20:15:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 20:15:58,732 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 20:15:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:58,732 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 20:15:58,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 20:15:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:58,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:58,733 INFO L415 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] [2020-02-10 20:15:58,733 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:58,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:58,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1679665150, now seen corresponding path program 584 times [2020-02-10 20:15:58,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:58,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122714949] [2020-02-10 20:15:58,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:59,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122714949] [2020-02-10 20:15:59,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:59,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:59,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869480504] [2020-02-10 20:15:59,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:59,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:59,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:59,033 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:15:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:59,145 INFO L93 Difference]: Finished difference Result 586 states and 1741 transitions. [2020-02-10 20:15:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:59,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:59,146 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:15:59,147 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:15:59,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:15:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-02-10 20:15:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 20:15:59,155 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 20:15:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:59,155 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 20:15:59,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 20:15:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:59,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:59,156 INFO L415 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] [2020-02-10 20:15:59,156 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:59,156 INFO L82 PathProgramCache]: Analyzing trace with hash 416615866, now seen corresponding path program 585 times [2020-02-10 20:15:59,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:59,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638928763] [2020-02-10 20:15:59,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:59,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638928763] [2020-02-10 20:15:59,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:59,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:59,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646558332] [2020-02-10 20:15:59,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:59,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:59,440 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:15:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:59,527 INFO L93 Difference]: Finished difference Result 588 states and 1745 transitions. [2020-02-10 20:15:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:59,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:59,528 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:15:59,529 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:15:59,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:15:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 390. [2020-02-10 20:15:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:15:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-02-10 20:15:59,537 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-02-10 20:15:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:59,537 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-02-10 20:15:59,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-02-10 20:15:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:59,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:59,538 INFO L415 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] [2020-02-10 20:15:59,538 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1732180670, now seen corresponding path program 586 times [2020-02-10 20:15:59,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:59,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218649031] [2020-02-10 20:15:59,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:59,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218649031] [2020-02-10 20:15:59,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:59,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:15:59,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437131714] [2020-02-10 20:15:59,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:15:59,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:15:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:59,823 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:15:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:59,940 INFO L93 Difference]: Finished difference Result 592 states and 1752 transitions. [2020-02-10 20:15:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:15:59,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:15:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:59,942 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:15:59,942 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:15:59,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:15:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 389. [2020-02-10 20:15:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:15:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 20:15:59,952 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 20:15:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:59,952 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 20:15:59,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:15:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 20:15:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:15:59,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:59,953 INFO L415 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] [2020-02-10 20:15:59,953 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 427118970, now seen corresponding path program 587 times [2020-02-10 20:15:59,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:59,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325424558] [2020-02-10 20:15:59,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:00,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325424558] [2020-02-10 20:16:00,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:00,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:00,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216315270] [2020-02-10 20:16:00,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:00,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:00,241 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:00,351 INFO L93 Difference]: Finished difference Result 591 states and 1751 transitions. [2020-02-10 20:16:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:00,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:00,353 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:16:00,353 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:16:00,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:16:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 391. [2020-02-10 20:16:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1343 transitions. [2020-02-10 20:16:00,362 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1343 transitions. Word has length 22 [2020-02-10 20:16:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:00,362 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1343 transitions. [2020-02-10 20:16:00,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1343 transitions. [2020-02-10 20:16:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:00,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:00,363 INFO L415 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] [2020-02-10 20:16:00,363 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash 962348772, now seen corresponding path program 588 times [2020-02-10 20:16:00,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:00,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381878465] [2020-02-10 20:16:00,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:00,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381878465] [2020-02-10 20:16:00,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:00,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:00,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960966195] [2020-02-10 20:16:00,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:00,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:00,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:00,643 INFO L87 Difference]: Start difference. First operand 391 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:16:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:00,755 INFO L93 Difference]: Finished difference Result 594 states and 1755 transitions. [2020-02-10 20:16:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:00,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:00,756 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:16:00,757 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:16:00,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:16:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 388. [2020-02-10 20:16:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:16:00,766 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:00,766 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:16:00,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:16:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:00,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:00,767 INFO L415 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] [2020-02-10 20:16:00,767 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1274812380, now seen corresponding path program 589 times [2020-02-10 20:16:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:00,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787985704] [2020-02-10 20:16:00,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:01,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787985704] [2020-02-10 20:16:01,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:01,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:01,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091585019] [2020-02-10 20:16:01,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:01,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:01,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:01,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:01,039 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,131 INFO L93 Difference]: Finished difference Result 596 states and 1764 transitions. [2020-02-10 20:16:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:01,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,133 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:16:01,133 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:16:01,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:16:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 390. [2020-02-10 20:16:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-02-10 20:16:01,141 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,141 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-02-10 20:16:01,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-02-10 20:16:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:01,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,142 INFO L415 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] [2020-02-10 20:16:01,142 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443760, now seen corresponding path program 590 times [2020-02-10 20:16:01,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665883138] [2020-02-10 20:16:01,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:01,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665883138] [2020-02-10 20:16:01,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:01,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:01,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490094495] [2020-02-10 20:16:01,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:01,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:01,410 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,528 INFO L93 Difference]: Finished difference Result 601 states and 1773 transitions. [2020-02-10 20:16:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:01,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,530 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:16:01,530 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:16:01,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:16:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 389. [2020-02-10 20:16:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 20:16:01,539 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,539 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 20:16:01,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 20:16:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:01,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,539 INFO L415 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] [2020-02-10 20:16:01,540 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash -180720792, now seen corresponding path program 591 times [2020-02-10 20:16:01,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452404456] [2020-02-10 20:16:01,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:01,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452404456] [2020-02-10 20:16:01,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:01,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:01,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420371294] [2020-02-10 20:16:01,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:01,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:01,819 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,923 INFO L93 Difference]: Finished difference Result 595 states and 1761 transitions. [2020-02-10 20:16:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:01,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,924 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:16:01,925 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:16:01,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:16:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 390. [2020-02-10 20:16:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1341 transitions. [2020-02-10 20:16:01,934 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,934 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1341 transitions. [2020-02-10 20:16:01,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1341 transitions. [2020-02-10 20:16:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:01,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,935 INFO L415 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] [2020-02-10 20:16:01,935 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1965449968, now seen corresponding path program 592 times [2020-02-10 20:16:01,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70992217] [2020-02-10 20:16:01,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:02,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70992217] [2020-02-10 20:16:02,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:02,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:02,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356677144] [2020-02-10 20:16:02,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:02,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:02,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:02,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:02,208 INFO L87 Difference]: Start difference. First operand 390 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:02,320 INFO L93 Difference]: Finished difference Result 599 states and 1768 transitions. [2020-02-10 20:16:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:02,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:02,321 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:16:02,321 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:16:02,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:16:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 389. [2020-02-10 20:16:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1339 transitions. [2020-02-10 20:16:02,334 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1339 transitions. Word has length 22 [2020-02-10 20:16:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:02,334 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1339 transitions. [2020-02-10 20:16:02,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1339 transitions. [2020-02-10 20:16:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:02,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:02,335 INFO L415 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] [2020-02-10 20:16:02,335 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash -243739416, now seen corresponding path program 593 times [2020-02-10 20:16:02,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:02,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486983298] [2020-02-10 20:16:02,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:02,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486983298] [2020-02-10 20:16:02,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:02,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:02,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645668047] [2020-02-10 20:16:02,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:02,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:02,640 INFO L87 Difference]: Start difference. First operand 389 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:16:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:02,750 INFO L93 Difference]: Finished difference Result 609 states and 1792 transitions. [2020-02-10 20:16:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:02,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:02,752 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:16:02,752 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:16:02,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:16:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 394. [2020-02-10 20:16:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:16:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1348 transitions. [2020-02-10 20:16:02,762 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1348 transitions. Word has length 22 [2020-02-10 20:16:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:02,762 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1348 transitions. [2020-02-10 20:16:02,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1348 transitions. [2020-02-10 20:16:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:02,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:02,763 INFO L415 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] [2020-02-10 20:16:02,763 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1316824796, now seen corresponding path program 594 times [2020-02-10 20:16:02,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:02,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764517987] [2020-02-10 20:16:02,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:03,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764517987] [2020-02-10 20:16:03,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:03,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:03,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351364921] [2020-02-10 20:16:03,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:03,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:03,063 INFO L87 Difference]: Start difference. First operand 394 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:16:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:03,182 INFO L93 Difference]: Finished difference Result 608 states and 1785 transitions. [2020-02-10 20:16:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:03,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:03,184 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:16:03,184 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:16:03,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:16:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 388. [2020-02-10 20:16:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 20:16:03,193 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:03,193 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 20:16:03,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 20:16:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:03,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:03,194 INFO L415 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] [2020-02-10 20:16:03,194 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 661724802, now seen corresponding path program 595 times [2020-02-10 20:16:03,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:03,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412430341] [2020-02-10 20:16:03,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:03,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412430341] [2020-02-10 20:16:03,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:03,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:03,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110813811] [2020-02-10 20:16:03,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:03,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:03,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:03,460 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:03,574 INFO L93 Difference]: Finished difference Result 603 states and 1782 transitions. [2020-02-10 20:16:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:03,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:03,576 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:16:03,576 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:16:03,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:16:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 392. [2020-02-10 20:16:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:16:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1347 transitions. [2020-02-10 20:16:03,585 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1347 transitions. Word has length 22 [2020-02-10 20:16:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:03,585 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1347 transitions. [2020-02-10 20:16:03,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1347 transitions. [2020-02-10 20:16:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:03,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:03,586 INFO L415 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] [2020-02-10 20:16:03,586 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2024927312, now seen corresponding path program 596 times [2020-02-10 20:16:03,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:03,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486048250] [2020-02-10 20:16:03,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:03,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486048250] [2020-02-10 20:16:03,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:03,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:03,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665153944] [2020-02-10 20:16:03,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:03,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:03,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:03,884 INFO L87 Difference]: Start difference. First operand 392 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:16:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:03,996 INFO L93 Difference]: Finished difference Result 607 states and 1788 transitions. [2020-02-10 20:16:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:03,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:03,998 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:16:03,998 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:16:03,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:16:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-02-10 20:16:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-02-10 20:16:04,007 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:04,007 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-02-10 20:16:04,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-02-10 20:16:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:04,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:04,008 INFO L415 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] [2020-02-10 20:16:04,008 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1755816390, now seen corresponding path program 597 times [2020-02-10 20:16:04,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:04,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247040083] [2020-02-10 20:16:04,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:04,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247040083] [2020-02-10 20:16:04,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:04,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:04,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627380958] [2020-02-10 20:16:04,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:04,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:04,280 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:04,397 INFO L93 Difference]: Finished difference Result 602 states and 1778 transitions. [2020-02-10 20:16:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:04,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:04,398 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:16:04,398 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:16:04,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:16:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-02-10 20:16:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:16:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1345 transitions. [2020-02-10 20:16:04,408 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1345 transitions. Word has length 22 [2020-02-10 20:16:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:04,408 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1345 transitions. [2020-02-10 20:16:04,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1345 transitions. [2020-02-10 20:16:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:04,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:04,408 INFO L415 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] [2020-02-10 20:16:04,409 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:04,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2003921104, now seen corresponding path program 598 times [2020-02-10 20:16:04,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:04,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186323973] [2020-02-10 20:16:04,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:04,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186323973] [2020-02-10 20:16:04,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:04,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:04,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968962393] [2020-02-10 20:16:04,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:04,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:04,681 INFO L87 Difference]: Start difference. First operand 392 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:16:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:04,802 INFO L93 Difference]: Finished difference Result 605 states and 1782 transitions. [2020-02-10 20:16:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:04,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:04,804 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:16:04,804 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:16:04,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:16:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 390. [2020-02-10 20:16:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1340 transitions. [2020-02-10 20:16:04,814 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:04,814 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1340 transitions. [2020-02-10 20:16:04,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1340 transitions. [2020-02-10 20:16:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:04,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:04,815 INFO L415 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] [2020-02-10 20:16:04,815 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:04,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1682294662, now seen corresponding path program 599 times [2020-02-10 20:16:04,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:04,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297112219] [2020-02-10 20:16:04,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:05,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297112219] [2020-02-10 20:16:05,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:05,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:05,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984316792] [2020-02-10 20:16:05,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:05,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:05,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:05,095 INFO L87 Difference]: Start difference. First operand 390 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:05,197 INFO L93 Difference]: Finished difference Result 613 states and 1801 transitions. [2020-02-10 20:16:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:05,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:05,199 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:16:05,199 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:16:05,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:16:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 395. [2020-02-10 20:16:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:16:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1349 transitions. [2020-02-10 20:16:05,209 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1349 transitions. Word has length 22 [2020-02-10 20:16:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:05,209 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1349 transitions. [2020-02-10 20:16:05,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1349 transitions. [2020-02-10 20:16:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:05,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:05,210 INFO L415 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] [2020-02-10 20:16:05,210 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash 609209282, now seen corresponding path program 600 times [2020-02-10 20:16:05,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:05,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865935080] [2020-02-10 20:16:05,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:05,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865935080] [2020-02-10 20:16:05,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:05,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236762595] [2020-02-10 20:16:05,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:05,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:05,487 INFO L87 Difference]: Start difference. First operand 395 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:16:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:05,623 INFO L93 Difference]: Finished difference Result 612 states and 1794 transitions. [2020-02-10 20:16:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:05,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:05,625 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:16:05,625 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:16:05,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:16:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 383. [2020-02-10 20:16:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:16:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-02-10 20:16:05,633 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-02-10 20:16:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:05,634 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-02-10 20:16:05,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-02-10 20:16:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:05,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:05,634 INFO L415 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] [2020-02-10 20:16:05,634 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1147153134, now seen corresponding path program 601 times [2020-02-10 20:16:05,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:05,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540410605] [2020-02-10 20:16:05,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:05,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540410605] [2020-02-10 20:16:05,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:05,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:05,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344118227] [2020-02-10 20:16:05,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:05,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:05,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:05,916 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:16:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:06,033 INFO L93 Difference]: Finished difference Result 543 states and 1635 transitions. [2020-02-10 20:16:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:06,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:06,034 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:16:06,035 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:16:06,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:16:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 387. [2020-02-10 20:16:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1341 transitions. [2020-02-10 20:16:06,044 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:06,044 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1341 transitions. [2020-02-10 20:16:06,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1341 transitions. [2020-02-10 20:16:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:06,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:06,045 INFO L415 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] [2020-02-10 20:16:06,045 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash -298363876, now seen corresponding path program 602 times [2020-02-10 20:16:06,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:06,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207668320] [2020-02-10 20:16:06,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:06,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207668320] [2020-02-10 20:16:06,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:06,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:06,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195899406] [2020-02-10 20:16:06,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:06,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:06,331 INFO L87 Difference]: Start difference. First operand 387 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:06,436 INFO L93 Difference]: Finished difference Result 541 states and 1630 transitions. [2020-02-10 20:16:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:06,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:06,437 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:16:06,438 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:16:06,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:16:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-02-10 20:16:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1339 transitions. [2020-02-10 20:16:06,447 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1339 transitions. Word has length 22 [2020-02-10 20:16:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:06,447 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1339 transitions. [2020-02-10 20:16:06,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1339 transitions. [2020-02-10 20:16:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:06,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:06,448 INFO L415 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] [2020-02-10 20:16:06,448 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:06,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash -453284720, now seen corresponding path program 603 times [2020-02-10 20:16:06,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:06,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684972974] [2020-02-10 20:16:06,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:06,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684972974] [2020-02-10 20:16:06,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:06,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:06,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007156711] [2020-02-10 20:16:06,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:06,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:06,726 INFO L87 Difference]: Start difference. First operand 386 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:16:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:06,828 INFO L93 Difference]: Finished difference Result 545 states and 1639 transitions. [2020-02-10 20:16:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:06,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:06,830 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:16:06,830 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:16:06,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:16:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 388. [2020-02-10 20:16:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 20:16:06,838 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:06,838 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 20:16:06,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 20:16:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:06,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:06,839 INFO L415 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] [2020-02-10 20:16:06,839 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:06,839 INFO L82 PathProgramCache]: Analyzing trace with hash -200191968, now seen corresponding path program 604 times [2020-02-10 20:16:06,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:06,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309374518] [2020-02-10 20:16:06,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:07,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309374518] [2020-02-10 20:16:07,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:07,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:07,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477529551] [2020-02-10 20:16:07,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:07,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:07,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:07,122 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:07,243 INFO L93 Difference]: Finished difference Result 544 states and 1635 transitions. [2020-02-10 20:16:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:07,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:07,245 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:16:07,245 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:16:07,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:16:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 386. [2020-02-10 20:16:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 20:16:07,254 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:07,255 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 20:16:07,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 20:16:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:07,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:07,255 INFO L415 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] [2020-02-10 20:16:07,255 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash 795727712, now seen corresponding path program 605 times [2020-02-10 20:16:07,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:07,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868748455] [2020-02-10 20:16:07,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:07,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868748455] [2020-02-10 20:16:07,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:07,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:07,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444878555] [2020-02-10 20:16:07,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:07,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:07,544 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:07,647 INFO L93 Difference]: Finished difference Result 540 states and 1627 transitions. [2020-02-10 20:16:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:07,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:07,649 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:16:07,649 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:16:07,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:16:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 387. [2020-02-10 20:16:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 20:16:07,658 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 20:16:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:07,658 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 20:16:07,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 20:16:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:07,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:07,659 INFO L415 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] [2020-02-10 20:16:07,659 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1888298626, now seen corresponding path program 606 times [2020-02-10 20:16:07,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:07,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403632939] [2020-02-10 20:16:07,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:07,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403632939] [2020-02-10 20:16:07,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:07,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:07,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485748373] [2020-02-10 20:16:07,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:07,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:07,944 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:16:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:08,053 INFO L93 Difference]: Finished difference Result 541 states and 1628 transitions. [2020-02-10 20:16:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:08,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:08,054 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:16:08,054 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:16:08,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:16:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 385. [2020-02-10 20:16:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1336 transitions. [2020-02-10 20:16:08,064 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:08,064 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1336 transitions. [2020-02-10 20:16:08,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1336 transitions. [2020-02-10 20:16:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:08,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:08,064 INFO L415 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] [2020-02-10 20:16:08,065 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash 549816476, now seen corresponding path program 607 times [2020-02-10 20:16:08,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:08,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797783333] [2020-02-10 20:16:08,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:08,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797783333] [2020-02-10 20:16:08,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:08,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:08,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669993962] [2020-02-10 20:16:08,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:08,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:08,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:08,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:08,337 INFO L87 Difference]: Start difference. First operand 385 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:08,454 INFO L93 Difference]: Finished difference Result 548 states and 1645 transitions. [2020-02-10 20:16:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:08,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:08,456 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:16:08,456 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:16:08,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:16:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-02-10 20:16:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 20:16:08,465 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:08,466 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 20:16:08,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 20:16:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:08,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:08,466 INFO L415 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] [2020-02-10 20:16:08,467 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash -895700534, now seen corresponding path program 608 times [2020-02-10 20:16:08,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:08,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46083380] [2020-02-10 20:16:08,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:08,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46083380] [2020-02-10 20:16:08,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:08,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:08,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640931489] [2020-02-10 20:16:08,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:08,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:08,741 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:08,830 INFO L93 Difference]: Finished difference Result 546 states and 1640 transitions. [2020-02-10 20:16:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:08,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:08,831 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:16:08,831 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:16:08,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:16:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 386. [2020-02-10 20:16:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 20:16:08,838 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:08,838 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 20:16:08,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 20:16:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:08,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:08,839 INFO L415 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] [2020-02-10 20:16:08,839 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1562509008, now seen corresponding path program 609 times [2020-02-10 20:16:08,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:08,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227795721] [2020-02-10 20:16:08,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:09,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227795721] [2020-02-10 20:16:09,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:09,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:09,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986584560] [2020-02-10 20:16:09,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:09,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:09,109 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,209 INFO L93 Difference]: Finished difference Result 555 states and 1660 transitions. [2020-02-10 20:16:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:09,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,210 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:16:09,210 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:16:09,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:16:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 389. [2020-02-10 20:16:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 20:16:09,220 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 20:16:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:09,220 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 20:16:09,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 20:16:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:09,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:09,221 INFO L415 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] [2020-02-10 20:16:09,221 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1346423158, now seen corresponding path program 610 times [2020-02-10 20:16:09,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:09,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493660630] [2020-02-10 20:16:09,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:09,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493660630] [2020-02-10 20:16:09,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:09,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:09,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706653658] [2020-02-10 20:16:09,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:09,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:09,484 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:16:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,594 INFO L93 Difference]: Finished difference Result 558 states and 1663 transitions. [2020-02-10 20:16:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:09,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:09,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,595 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:16:09,595 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:16:09,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:16:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2020-02-10 20:16:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 20:16:09,604 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:09,605 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 20:16:09,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 20:16:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:09,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:09,605 INFO L415 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] [2020-02-10 20:16:09,606 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1483445856, now seen corresponding path program 611 times [2020-02-10 20:16:09,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:09,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821044880] [2020-02-10 20:16:09,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:09,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821044880] [2020-02-10 20:16:09,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:09,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:09,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969426574] [2020-02-10 20:16:09,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:09,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:09,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:09,870 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,956 INFO L93 Difference]: Finished difference Result 549 states and 1645 transitions. [2020-02-10 20:16:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:09,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,958 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:16:09,958 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:16:09,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:16:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 387. [2020-02-10 20:16:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 20:16:09,967 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:09,967 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 20:16:09,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 20:16:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:09,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:09,968 INFO L415 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] [2020-02-10 20:16:09,968 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1735810284, now seen corresponding path program 612 times [2020-02-10 20:16:09,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:09,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436618724] [2020-02-10 20:16:09,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:10,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436618724] [2020-02-10 20:16:10,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:10,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:10,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050052963] [2020-02-10 20:16:10,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:10,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:10,227 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:10,355 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-02-10 20:16:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:10,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:10,356 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:16:10,357 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:16:10,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:16:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 385. [2020-02-10 20:16:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1335 transitions. [2020-02-10 20:16:10,365 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:10,365 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1335 transitions. [2020-02-10 20:16:10,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1335 transitions. [2020-02-10 20:16:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:10,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:10,366 INFO L415 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] [2020-02-10 20:16:10,366 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 875412700, now seen corresponding path program 613 times [2020-02-10 20:16:10,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:10,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482288628] [2020-02-10 20:16:10,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:10,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482288628] [2020-02-10 20:16:10,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:10,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:10,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982871521] [2020-02-10 20:16:10,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:10,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:10,638 INFO L87 Difference]: Start difference. First operand 385 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:10,755 INFO L93 Difference]: Finished difference Result 554 states and 1661 transitions. [2020-02-10 20:16:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:10,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:10,757 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:16:10,757 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:16:10,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:16:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2020-02-10 20:16:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1345 transitions. [2020-02-10 20:16:10,766 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1345 transitions. Word has length 22 [2020-02-10 20:16:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:10,767 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1345 transitions. [2020-02-10 20:16:10,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1345 transitions. [2020-02-10 20:16:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:10,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:10,767 INFO L415 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] [2020-02-10 20:16:10,767 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1128505452, now seen corresponding path program 614 times [2020-02-10 20:16:10,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:10,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230261189] [2020-02-10 20:16:10,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:11,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230261189] [2020-02-10 20:16:11,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:11,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:11,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160265829] [2020-02-10 20:16:11,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:11,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:11,044 INFO L87 Difference]: Start difference. First operand 389 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:16:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:11,151 INFO L93 Difference]: Finished difference Result 553 states and 1657 transitions. [2020-02-10 20:16:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:11,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:11,152 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:16:11,152 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:16:11,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:16:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 387. [2020-02-10 20:16:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 20:16:11,161 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:11,161 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 20:16:11,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 20:16:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:11,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:11,162 INFO L415 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] [2020-02-10 20:16:11,162 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash -806424210, now seen corresponding path program 615 times [2020-02-10 20:16:11,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:11,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89905581] [2020-02-10 20:16:11,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:11,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89905581] [2020-02-10 20:16:11,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:11,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:11,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646166277] [2020-02-10 20:16:11,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:11,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:11,420 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:11,544 INFO L93 Difference]: Finished difference Result 559 states and 1670 transitions. [2020-02-10 20:16:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:11,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:11,546 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:16:11,546 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:16:11,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:16:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 390. [2020-02-10 20:16:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 20:16:11,555 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 20:16:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:11,555 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 20:16:11,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 20:16:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:11,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:11,556 INFO L415 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] [2020-02-10 20:16:11,556 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 579610920, now seen corresponding path program 616 times [2020-02-10 20:16:11,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:11,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267719616] [2020-02-10 20:16:11,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:11,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267719616] [2020-02-10 20:16:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:11,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157224641] [2020-02-10 20:16:11,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:11,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:11,815 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:16:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:11,928 INFO L93 Difference]: Finished difference Result 562 states and 1673 transitions. [2020-02-10 20:16:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:11,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:11,929 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:16:11,929 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:16:11,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:16:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 387. [2020-02-10 20:16:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 20:16:11,938 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:11,938 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 20:16:11,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 20:16:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:11,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:11,939 INFO L415 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] [2020-02-10 20:16:11,939 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 587595596, now seen corresponding path program 617 times [2020-02-10 20:16:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:11,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979866677] [2020-02-10 20:16:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:12,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979866677] [2020-02-10 20:16:12,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:12,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:12,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466477100] [2020-02-10 20:16:12,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:12,195 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:12,308 INFO L93 Difference]: Finished difference Result 556 states and 1661 transitions. [2020-02-10 20:16:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:12,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:12,309 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:16:12,310 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:16:12,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:16:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 389. [2020-02-10 20:16:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 20:16:12,319 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:12,319 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 20:16:12,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 20:16:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:12,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:12,320 INFO L415 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] [2020-02-10 20:16:12,320 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash -330354594, now seen corresponding path program 618 times [2020-02-10 20:16:12,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:12,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724222941] [2020-02-10 20:16:12,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:12,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724222941] [2020-02-10 20:16:12,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:12,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:12,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485327146] [2020-02-10 20:16:12,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:12,581 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:12,694 INFO L93 Difference]: Finished difference Result 560 states and 1667 transitions. [2020-02-10 20:16:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:12,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:12,696 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:16:12,696 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:16:12,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:16:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 385. [2020-02-10 20:16:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 20:16:12,705 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:12,705 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 20:16:12,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 20:16:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:12,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:12,706 INFO L415 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] [2020-02-10 20:16:12,706 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash -244508086, now seen corresponding path program 619 times [2020-02-10 20:16:12,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:12,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907251874] [2020-02-10 20:16:12,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:12,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907251874] [2020-02-10 20:16:12,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:12,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:12,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425868366] [2020-02-10 20:16:12,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:12,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:12,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:12,985 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:13,078 INFO L93 Difference]: Finished difference Result 543 states and 1632 transitions. [2020-02-10 20:16:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:13,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:13,080 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:16:13,080 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:16:13,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:16:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 387. [2020-02-10 20:16:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 20:16:13,089 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:13,089 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 20:16:13,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 20:16:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:13,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:13,090 INFO L415 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] [2020-02-10 20:16:13,090 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1366432872, now seen corresponding path program 620 times [2020-02-10 20:16:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953410280] [2020-02-10 20:16:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:13,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953410280] [2020-02-10 20:16:13,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:13,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:13,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163986490] [2020-02-10 20:16:13,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:13,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:13,368 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:13,484 INFO L93 Difference]: Finished difference Result 544 states and 1633 transitions. [2020-02-10 20:16:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:13,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:13,485 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:16:13,485 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:16:13,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:16:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 386. [2020-02-10 20:16:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 20:16:13,494 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:13,494 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 20:16:13,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 20:16:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:13,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:13,495 INFO L415 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] [2020-02-10 20:16:13,495 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1926344996, now seen corresponding path program 621 times [2020-02-10 20:16:13,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:13,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672335864] [2020-02-10 20:16:13,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:13,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672335864] [2020-02-10 20:16:13,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:13,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:13,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867805980] [2020-02-10 20:16:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:13,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:13,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:13,753 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:13,842 INFO L93 Difference]: Finished difference Result 547 states and 1639 transitions. [2020-02-10 20:16:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:13,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:13,844 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:16:13,844 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:16:13,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:16:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 387. [2020-02-10 20:16:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:13,853 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:13,854 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:13,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:13,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:13,854 INFO L415 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] [2020-02-10 20:16:13,854 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1292911144, now seen corresponding path program 622 times [2020-02-10 20:16:13,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:13,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775295219] [2020-02-10 20:16:13,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:14,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775295219] [2020-02-10 20:16:14,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:14,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:14,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114644240] [2020-02-10 20:16:14,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:14,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:14,107 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,213 INFO L93 Difference]: Finished difference Result 552 states and 1648 transitions. [2020-02-10 20:16:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:14,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,215 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:16:14,215 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:16:14,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:16:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2020-02-10 20:16:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:16:14,224 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,224 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:16:14,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:16:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:14,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,225 INFO L415 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] [2020-02-10 20:16:14,225 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1915841892, now seen corresponding path program 623 times [2020-02-10 20:16:14,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381304603] [2020-02-10 20:16:14,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:14,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381304603] [2020-02-10 20:16:14,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:14,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:14,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420353068] [2020-02-10 20:16:14,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:14,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:14,480 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,593 INFO L93 Difference]: Finished difference Result 550 states and 1645 transitions. [2020-02-10 20:16:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:14,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,595 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:16:14,595 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:16:14,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:16:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 388. [2020-02-10 20:16:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:16:14,605 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,605 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:16:14,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:16:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:14,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,606 INFO L415 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] [2020-02-10 20:16:14,606 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash -307526710, now seen corresponding path program 624 times [2020-02-10 20:16:14,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209049524] [2020-02-10 20:16:14,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:14,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209049524] [2020-02-10 20:16:14,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:14,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:14,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148969025] [2020-02-10 20:16:14,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:14,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:14,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:14,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:14,862 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,974 INFO L93 Difference]: Finished difference Result 554 states and 1651 transitions. [2020-02-10 20:16:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:14,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,975 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:16:14,976 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:16:14,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:16:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 384. [2020-02-10 20:16:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1332 transitions. [2020-02-10 20:16:14,984 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,984 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1332 transitions. [2020-02-10 20:16:14,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1332 transitions. [2020-02-10 20:16:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:14,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,985 INFO L415 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] [2020-02-10 20:16:14,985 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 302181682, now seen corresponding path program 625 times [2020-02-10 20:16:14,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929189014] [2020-02-10 20:16:14,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:15,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929189014] [2020-02-10 20:16:15,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:15,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:15,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616071933] [2020-02-10 20:16:15,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:15,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:15,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:15,275 INFO L87 Difference]: Start difference. First operand 384 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:15,386 INFO L93 Difference]: Finished difference Result 542 states and 1632 transitions. [2020-02-10 20:16:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:15,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:15,388 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:16:15,388 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:16:15,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:16:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 387. [2020-02-10 20:16:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 20:16:15,397 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:15,398 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 20:16:15,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 20:16:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:15,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:15,398 INFO L415 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] [2020-02-10 20:16:15,398 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1143335328, now seen corresponding path program 626 times [2020-02-10 20:16:15,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:15,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618505473] [2020-02-10 20:16:15,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:15,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618505473] [2020-02-10 20:16:15,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:15,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:15,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064491688] [2020-02-10 20:16:15,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:15,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:15,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:15,679 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:15,759 INFO L93 Difference]: Finished difference Result 540 states and 1627 transitions. [2020-02-10 20:16:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:15,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:15,761 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:16:15,761 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:16:15,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:16:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 386. [2020-02-10 20:16:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 20:16:15,771 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:15,771 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 20:16:15,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 20:16:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:15,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:15,772 INFO L415 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] [2020-02-10 20:16:15,772 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1298256172, now seen corresponding path program 627 times [2020-02-10 20:16:15,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:15,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241059014] [2020-02-10 20:16:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:16,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241059014] [2020-02-10 20:16:16,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:16,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:16,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390139939] [2020-02-10 20:16:16,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:16,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:16,058 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:16,172 INFO L93 Difference]: Finished difference Result 544 states and 1636 transitions. [2020-02-10 20:16:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:16,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:16,174 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:16:16,174 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:16:16,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:16:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 388. [2020-02-10 20:16:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-02-10 20:16:16,183 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:16,183 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-02-10 20:16:16,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-02-10 20:16:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:16,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:16,184 INFO L415 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] [2020-02-10 20:16:16,184 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1045163420, now seen corresponding path program 628 times [2020-02-10 20:16:16,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:16,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972174037] [2020-02-10 20:16:16,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:16,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972174037] [2020-02-10 20:16:16,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:16,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:16,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095471442] [2020-02-10 20:16:16,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:16,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:16,468 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:16,571 INFO L93 Difference]: Finished difference Result 543 states and 1632 transitions. [2020-02-10 20:16:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:16,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:16,573 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:16:16,573 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:16:16,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:16:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-02-10 20:16:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 20:16:16,582 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:16,582 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 20:16:16,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 20:16:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:16,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:16,583 INFO L415 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] [2020-02-10 20:16:16,583 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash -49243740, now seen corresponding path program 629 times [2020-02-10 20:16:16,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:16,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628433622] [2020-02-10 20:16:16,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:16,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628433622] [2020-02-10 20:16:16,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:16,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:16,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903126005] [2020-02-10 20:16:16,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:16,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:16,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:16,870 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:16,954 INFO L93 Difference]: Finished difference Result 539 states and 1624 transitions. [2020-02-10 20:16:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:16,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:16,956 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:16:16,956 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:16:16,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:16:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 387. [2020-02-10 20:16:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 20:16:16,965 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:16,965 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 20:16:16,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 20:16:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:16,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:16,965 INFO L415 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] [2020-02-10 20:16:16,966 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1561697218, now seen corresponding path program 630 times [2020-02-10 20:16:16,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:16,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118122711] [2020-02-10 20:16:16,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:17,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118122711] [2020-02-10 20:16:17,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:17,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:17,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650774822] [2020-02-10 20:16:17,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:17,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:17,247 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:17,357 INFO L93 Difference]: Finished difference Result 540 states and 1625 transitions. [2020-02-10 20:16:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:17,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:17,359 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:16:17,359 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:16:17,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:16:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 385. [2020-02-10 20:16:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1335 transitions. [2020-02-10 20:16:17,368 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:17,368 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1335 transitions. [2020-02-10 20:16:17,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1335 transitions. [2020-02-10 20:16:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:17,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:17,369 INFO L415 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] [2020-02-10 20:16:17,369 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash -738054116, now seen corresponding path program 631 times [2020-02-10 20:16:17,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:17,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349796669] [2020-02-10 20:16:17,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:17,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349796669] [2020-02-10 20:16:17,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:17,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:17,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394062415] [2020-02-10 20:16:17,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:17,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:17,649 INFO L87 Difference]: Start difference. First operand 385 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:17,761 INFO L93 Difference]: Finished difference Result 546 states and 1640 transitions. [2020-02-10 20:16:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:17,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:17,763 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:16:17,763 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:16:17,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:16:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 387. [2020-02-10 20:16:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 20:16:17,771 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 20:16:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:17,771 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 20:16:17,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 20:16:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:17,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:17,772 INFO L415 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] [2020-02-10 20:16:17,772 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2111396170, now seen corresponding path program 632 times [2020-02-10 20:16:17,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:17,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598024976] [2020-02-10 20:16:17,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:18,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598024976] [2020-02-10 20:16:18,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:18,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:18,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658033131] [2020-02-10 20:16:18,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:18,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:18,046 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:16:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,136 INFO L93 Difference]: Finished difference Result 544 states and 1635 transitions. [2020-02-10 20:16:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:18,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,138 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:16:18,138 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:16:18,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:16:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-02-10 20:16:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 20:16:18,148 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,148 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 20:16:18,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 20:16:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:18,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,148 INFO L415 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] [2020-02-10 20:16:18,149 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1368730004, now seen corresponding path program 633 times [2020-02-10 20:16:18,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641776868] [2020-02-10 20:16:18,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:18,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641776868] [2020-02-10 20:16:18,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:18,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:18,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075364807] [2020-02-10 20:16:18,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:18,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:18,425 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,545 INFO L93 Difference]: Finished difference Result 552 states and 1653 transitions. [2020-02-10 20:16:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:18,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,547 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:16:18,547 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:16:18,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:16:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2020-02-10 20:16:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 20:16:18,556 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,556 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 20:16:18,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 20:16:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:18,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,557 INFO L415 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] [2020-02-10 20:16:18,557 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash 586730762, now seen corresponding path program 634 times [2020-02-10 20:16:18,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680141957] [2020-02-10 20:16:18,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:18,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680141957] [2020-02-10 20:16:18,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:18,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:18,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630938641] [2020-02-10 20:16:18,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:18,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:18,823 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,933 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-02-10 20:16:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:18,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,935 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:16:18,935 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:16:18,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:16:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 386. [2020-02-10 20:16:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 20:16:18,945 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,945 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 20:16:18,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 20:16:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:18,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,946 INFO L415 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] [2020-02-10 20:16:18,946 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1677224860, now seen corresponding path program 635 times [2020-02-10 20:16:18,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963048719] [2020-02-10 20:16:18,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:19,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963048719] [2020-02-10 20:16:19,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:19,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:19,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304329453] [2020-02-10 20:16:19,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:19,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:19,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:19,220 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:19,316 INFO L93 Difference]: Finished difference Result 546 states and 1638 transitions. [2020-02-10 20:16:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:19,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:19,318 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:16:19,318 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:16:19,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:16:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-02-10 20:16:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:19,327 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:19,327 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:19,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:19,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:19,328 INFO L415 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] [2020-02-10 20:16:19,328 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 468945900, now seen corresponding path program 636 times [2020-02-10 20:16:19,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:19,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994276774] [2020-02-10 20:16:19,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:19,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994276774] [2020-02-10 20:16:19,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:19,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:19,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582847529] [2020-02-10 20:16:19,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:19,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:19,590 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:19,703 INFO L93 Difference]: Finished difference Result 550 states and 1645 transitions. [2020-02-10 20:16:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:19,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:19,704 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:16:19,704 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:16:19,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:16:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 385. [2020-02-10 20:16:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 20:16:19,713 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:19,713 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 20:16:19,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 20:16:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:19,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:19,714 INFO L415 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] [2020-02-10 20:16:19,714 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash -412457892, now seen corresponding path program 637 times [2020-02-10 20:16:19,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:19,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857425642] [2020-02-10 20:16:19,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:19,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857425642] [2020-02-10 20:16:19,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:19,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:19,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982228179] [2020-02-10 20:16:19,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:19,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:19,984 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:20,082 INFO L93 Difference]: Finished difference Result 552 states and 1656 transitions. [2020-02-10 20:16:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:20,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:20,084 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:16:20,084 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:16:20,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:16:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2020-02-10 20:16:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1344 transitions. [2020-02-10 20:16:20,093 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1344 transitions. Word has length 22 [2020-02-10 20:16:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:20,094 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1344 transitions. [2020-02-10 20:16:20,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1344 transitions. [2020-02-10 20:16:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:20,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:20,094 INFO L415 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] [2020-02-10 20:16:20,094 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash -159365140, now seen corresponding path program 638 times [2020-02-10 20:16:20,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:20,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174045997] [2020-02-10 20:16:20,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:20,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174045997] [2020-02-10 20:16:20,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:20,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:20,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44587624] [2020-02-10 20:16:20,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:20,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:20,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:20,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:20,366 INFO L87 Difference]: Start difference. First operand 389 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:16:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:20,478 INFO L93 Difference]: Finished difference Result 551 states and 1652 transitions. [2020-02-10 20:16:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:20,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:20,479 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:16:20,480 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:16:20,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:16:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 387. [2020-02-10 20:16:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 20:16:20,488 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 20:16:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:20,488 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 20:16:20,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 20:16:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:20,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:20,489 INFO L415 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] [2020-02-10 20:16:20,489 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1000203214, now seen corresponding path program 639 times [2020-02-10 20:16:20,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:20,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774215493] [2020-02-10 20:16:20,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:20,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774215493] [2020-02-10 20:16:20,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:20,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:20,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156590699] [2020-02-10 20:16:20,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:20,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:20,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:20,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:20,754 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:16:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:20,865 INFO L93 Difference]: Finished difference Result 556 states and 1663 transitions. [2020-02-10 20:16:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:20,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:20,866 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:16:20,866 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:16:20,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:16:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 390. [2020-02-10 20:16:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-02-10 20:16:20,875 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-02-10 20:16:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:20,875 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-02-10 20:16:20,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-02-10 20:16:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:20,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:20,876 INFO L415 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] [2020-02-10 20:16:20,876 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1782202456, now seen corresponding path program 640 times [2020-02-10 20:16:20,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:20,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710997269] [2020-02-10 20:16:20,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:21,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710997269] [2020-02-10 20:16:21,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:21,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:21,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380379797] [2020-02-10 20:16:21,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:21,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:21,164 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:16:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:21,285 INFO L93 Difference]: Finished difference Result 558 states and 1664 transitions. [2020-02-10 20:16:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:21,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:21,287 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:16:21,287 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:16:21,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:16:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 387. [2020-02-10 20:16:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:21,296 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:21,297 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:21,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:21,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:21,297 INFO L415 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] [2020-02-10 20:16:21,297 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash -679268788, now seen corresponding path program 641 times [2020-02-10 20:16:21,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:21,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472138855] [2020-02-10 20:16:21,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:21,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472138855] [2020-02-10 20:16:21,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:21,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:21,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909189855] [2020-02-10 20:16:21,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:21,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:21,558 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:21,666 INFO L93 Difference]: Finished difference Result 553 states and 1654 transitions. [2020-02-10 20:16:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:21,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:21,668 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:16:21,668 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:16:21,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:16:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2020-02-10 20:16:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 20:16:21,677 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:21,677 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 20:16:21,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 20:16:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:21,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:21,678 INFO L415 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] [2020-02-10 20:16:21,678 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash -107813982, now seen corresponding path program 642 times [2020-02-10 20:16:21,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:21,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066544493] [2020-02-10 20:16:21,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:21,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066544493] [2020-02-10 20:16:21,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:21,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:21,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592860900] [2020-02-10 20:16:21,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:21,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:21,943 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,054 INFO L93 Difference]: Finished difference Result 556 states and 1658 transitions. [2020-02-10 20:16:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:22,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,056 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:16:22,056 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:16:22,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:16:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2020-02-10 20:16:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1333 transitions. [2020-02-10 20:16:22,066 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,066 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1333 transitions. [2020-02-10 20:16:22,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1333 transitions. [2020-02-10 20:16:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:22,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,066 INFO L415 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] [2020-02-10 20:16:22,067 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1532378678, now seen corresponding path program 643 times [2020-02-10 20:16:22,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570601881] [2020-02-10 20:16:22,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:22,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570601881] [2020-02-10 20:16:22,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:22,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:22,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118078779] [2020-02-10 20:16:22,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:22,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:22,353 INFO L87 Difference]: Start difference. First operand 385 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,430 INFO L93 Difference]: Finished difference Result 541 states and 1627 transitions. [2020-02-10 20:16:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:22,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,432 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:16:22,432 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:16:22,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:16:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 387. [2020-02-10 20:16:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:22,440 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,440 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:22,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:22,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,441 INFO L415 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] [2020-02-10 20:16:22,441 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 78562280, now seen corresponding path program 644 times [2020-02-10 20:16:22,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668278065] [2020-02-10 20:16:22,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:22,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668278065] [2020-02-10 20:16:22,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:22,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:22,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568887852] [2020-02-10 20:16:22,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:22,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:22,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:22,719 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,833 INFO L93 Difference]: Finished difference Result 542 states and 1628 transitions. [2020-02-10 20:16:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:22,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,835 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:16:22,835 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:16:22,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:16:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-02-10 20:16:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:16:22,844 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,845 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:16:22,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:16:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:22,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,845 INFO L415 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] [2020-02-10 20:16:22,846 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2120124000, now seen corresponding path program 645 times [2020-02-10 20:16:22,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472944095] [2020-02-10 20:16:22,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:23,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472944095] [2020-02-10 20:16:23,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:23,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:23,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027299628] [2020-02-10 20:16:23,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:23,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:23,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:23,131 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:23,213 INFO L93 Difference]: Finished difference Result 544 states and 1632 transitions. [2020-02-10 20:16:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:23,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:23,215 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:16:23,215 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:16:23,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:16:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 387. [2020-02-10 20:16:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:16:23,225 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:23,225 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:16:23,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:16:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:23,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:23,226 INFO L415 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] [2020-02-10 20:16:23,226 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 26046760, now seen corresponding path program 646 times [2020-02-10 20:16:23,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:23,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699720475] [2020-02-10 20:16:23,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:23,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699720475] [2020-02-10 20:16:23,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:23,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:23,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666575762] [2020-02-10 20:16:23,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:23,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:23,500 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:23,619 INFO L93 Difference]: Finished difference Result 548 states and 1639 transitions. [2020-02-10 20:16:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:23,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:23,621 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:16:23,621 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:16:23,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:16:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-02-10 20:16:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 20:16:23,630 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:23,630 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 20:16:23,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 20:16:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:23,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:23,631 INFO L415 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] [2020-02-10 20:16:23,631 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2109620896, now seen corresponding path program 647 times [2020-02-10 20:16:23,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:23,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023897482] [2020-02-10 20:16:23,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:23,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023897482] [2020-02-10 20:16:23,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:23,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:23,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602320227] [2020-02-10 20:16:23,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:23,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:23,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:23,906 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:24,013 INFO L93 Difference]: Finished difference Result 547 states and 1638 transitions. [2020-02-10 20:16:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:24,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:24,015 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:16:24,015 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:16:24,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:16:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 388. [2020-02-10 20:16:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 20:16:24,024 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:24,024 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 20:16:24,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 20:16:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:24,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:24,025 INFO L415 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] [2020-02-10 20:16:24,025 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1574391094, now seen corresponding path program 648 times [2020-02-10 20:16:24,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:24,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667174946] [2020-02-10 20:16:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:24,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667174946] [2020-02-10 20:16:24,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:24,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:24,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656454114] [2020-02-10 20:16:24,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:24,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:24,299 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:24,411 INFO L93 Difference]: Finished difference Result 550 states and 1642 transitions. [2020-02-10 20:16:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:24,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:24,412 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:16:24,412 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:16:24,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:16:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 384. [2020-02-10 20:16:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 20:16:24,421 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 20:16:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:24,421 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 20:16:24,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 20:16:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:24,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:24,422 INFO L415 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] [2020-02-10 20:16:24,422 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1632722190, now seen corresponding path program 649 times [2020-02-10 20:16:24,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:24,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82756627] [2020-02-10 20:16:24,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:24,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82756627] [2020-02-10 20:16:24,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:24,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:24,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404241475] [2020-02-10 20:16:24,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:24,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:24,680 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:16:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:24,798 INFO L93 Difference]: Finished difference Result 556 states and 1666 transitions. [2020-02-10 20:16:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:24,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:24,800 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:16:24,800 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:16:24,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:16:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 387. [2020-02-10 20:16:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 20:16:24,809 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 20:16:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:24,809 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 20:16:24,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 20:16:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:24,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:24,810 INFO L415 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] [2020-02-10 20:16:24,810 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1216728096, now seen corresponding path program 650 times [2020-02-10 20:16:24,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:24,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775908007] [2020-02-10 20:16:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:25,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775908007] [2020-02-10 20:16:25,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:25,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:25,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651336686] [2020-02-10 20:16:25,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:25,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:25,070 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:16:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:25,149 INFO L93 Difference]: Finished difference Result 554 states and 1661 transitions. [2020-02-10 20:16:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:25,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:25,150 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:16:25,151 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:16:25,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:16:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 386. [2020-02-10 20:16:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 20:16:25,159 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:25,159 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 20:16:25,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 20:16:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:25,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:25,160 INFO L415 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] [2020-02-10 20:16:25,160 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -620029658, now seen corresponding path program 651 times [2020-02-10 20:16:25,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:25,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541644143] [2020-02-10 20:16:25,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:25,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541644143] [2020-02-10 20:16:25,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:25,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:25,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472569298] [2020-02-10 20:16:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:25,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:25,414 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:25,535 INFO L93 Difference]: Finished difference Result 563 states and 1681 transitions. [2020-02-10 20:16:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:25,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:25,537 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:16:25,537 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:16:25,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:16:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 389. [2020-02-10 20:16:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 20:16:25,547 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:25,547 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 20:16:25,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 20:16:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:25,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:25,548 INFO L415 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] [2020-02-10 20:16:25,548 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 766005472, now seen corresponding path program 652 times [2020-02-10 20:16:25,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:25,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572438665] [2020-02-10 20:16:25,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:25,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572438665] [2020-02-10 20:16:25,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:25,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:25,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050641092] [2020-02-10 20:16:25,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:25,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:25,799 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:25,910 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-02-10 20:16:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:25,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:25,912 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:16:25,912 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:16:25,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:16:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 386. [2020-02-10 20:16:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 20:16:25,920 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:25,920 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 20:16:25,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 20:16:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:25,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:25,921 INFO L415 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] [2020-02-10 20:16:25,921 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash 628982774, now seen corresponding path program 653 times [2020-02-10 20:16:25,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:25,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768473820] [2020-02-10 20:16:25,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:26,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768473820] [2020-02-10 20:16:26,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:26,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311961019] [2020-02-10 20:16:26,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:26,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:26,170 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:26,253 INFO L93 Difference]: Finished difference Result 557 states and 1666 transitions. [2020-02-10 20:16:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:26,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:26,255 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:16:26,255 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:16:26,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:16:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 20:16:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:26,264 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:26,265 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:26,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:26,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:26,265 INFO L415 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] [2020-02-10 20:16:26,265 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -446728382, now seen corresponding path program 654 times [2020-02-10 20:16:26,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:26,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606124837] [2020-02-10 20:16:26,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:26,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606124837] [2020-02-10 20:16:26,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:26,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600953874] [2020-02-10 20:16:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:26,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:26,505 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:26,619 INFO L93 Difference]: Finished difference Result 562 states and 1675 transitions. [2020-02-10 20:16:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:26,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:26,621 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:16:26,621 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:16:26,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:16:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2020-02-10 20:16:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 20:16:26,631 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:26,631 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 20:16:26,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 20:16:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:26,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:26,632 INFO L415 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] [2020-02-10 20:16:26,632 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2075621330, now seen corresponding path program 655 times [2020-02-10 20:16:26,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:26,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127882749] [2020-02-10 20:16:26,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:26,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127882749] [2020-02-10 20:16:26,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:26,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208694120] [2020-02-10 20:16:26,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:26,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:26,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:26,886 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:27,001 INFO L93 Difference]: Finished difference Result 555 states and 1663 transitions. [2020-02-10 20:16:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:27,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:27,003 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:16:27,003 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:16:27,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:16:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 387. [2020-02-10 20:16:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 20:16:27,012 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:27,012 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 20:16:27,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 20:16:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:27,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:27,013 INFO L415 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] [2020-02-10 20:16:27,013 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 773828956, now seen corresponding path program 656 times [2020-02-10 20:16:27,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:27,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556382867] [2020-02-10 20:16:27,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:27,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556382867] [2020-02-10 20:16:27,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:27,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:27,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626846259] [2020-02-10 20:16:27,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:27,286 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:27,364 INFO L93 Difference]: Finished difference Result 553 states and 1658 transitions. [2020-02-10 20:16:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:27,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:27,366 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:16:27,366 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:16:27,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:16:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 386. [2020-02-10 20:16:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 20:16:27,375 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:27,376 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 20:16:27,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 20:16:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:27,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:27,376 INFO L415 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] [2020-02-10 20:16:27,376 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:27,377 INFO L82 PathProgramCache]: Analyzing trace with hash 31162790, now seen corresponding path program 657 times [2020-02-10 20:16:27,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:27,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487641953] [2020-02-10 20:16:27,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:27,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487641953] [2020-02-10 20:16:27,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:27,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:27,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903593852] [2020-02-10 20:16:27,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:27,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:27,627 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:27,751 INFO L93 Difference]: Finished difference Result 561 states and 1676 transitions. [2020-02-10 20:16:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:27,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:27,752 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:16:27,753 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:16:27,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:16:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 389. [2020-02-10 20:16:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 20:16:27,761 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:27,761 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 20:16:27,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 20:16:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:27,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:27,762 INFO L415 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] [2020-02-10 20:16:27,762 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash -750836452, now seen corresponding path program 658 times [2020-02-10 20:16:27,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:27,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643722541] [2020-02-10 20:16:27,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:28,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643722541] [2020-02-10 20:16:28,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:28,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:28,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972652850] [2020-02-10 20:16:28,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:28,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:28,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:28,009 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:28,114 INFO L93 Difference]: Finished difference Result 563 states and 1677 transitions. [2020-02-10 20:16:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:28,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:28,115 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:16:28,116 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:16:28,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:16:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-02-10 20:16:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:16:28,124 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,124 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:16:28,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:16:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:28,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,125 INFO L415 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] [2020-02-10 20:16:28,125 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1280175222, now seen corresponding path program 659 times [2020-02-10 20:16:28,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97749479] [2020-02-10 20:16:28,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:28,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97749479] [2020-02-10 20:16:28,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:28,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:28,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006089] [2020-02-10 20:16:28,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:28,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:28,381 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:28,459 INFO L93 Difference]: Finished difference Result 555 states and 1661 transitions. [2020-02-10 20:16:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:28,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:28,461 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:16:28,461 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:16:28,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:16:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 387. [2020-02-10 20:16:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:16:28,469 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,469 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:16:28,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:16:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:28,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,470 INFO L415 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] [2020-02-10 20:16:28,470 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash -868621314, now seen corresponding path program 660 times [2020-02-10 20:16:28,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166178057] [2020-02-10 20:16:28,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:28,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166178057] [2020-02-10 20:16:28,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:28,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:28,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717053590] [2020-02-10 20:16:28,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:28,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:28,728 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:28,848 INFO L93 Difference]: Finished difference Result 559 states and 1668 transitions. [2020-02-10 20:16:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:28,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:28,850 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:16:28,850 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:16:28,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:16:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 385. [2020-02-10 20:16:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1333 transitions. [2020-02-10 20:16:28,859 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,859 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1333 transitions. [2020-02-10 20:16:28,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1333 transitions. [2020-02-10 20:16:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:28,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,860 INFO L415 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] [2020-02-10 20:16:28,860 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,860 INFO L82 PathProgramCache]: Analyzing trace with hash 265768622, now seen corresponding path program 661 times [2020-02-10 20:16:28,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595343437] [2020-02-10 20:16:28,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:29,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595343437] [2020-02-10 20:16:29,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:29,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:29,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828523617] [2020-02-10 20:16:29,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:29,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:29,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:29,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:29,111 INFO L87 Difference]: Start difference. First operand 385 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:29,228 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-02-10 20:16:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:29,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:29,230 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:16:29,230 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:16:29,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:16:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2020-02-10 20:16:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-02-10 20:16:29,240 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-02-10 20:16:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:29,240 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-02-10 20:16:29,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-02-10 20:16:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:29,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:29,241 INFO L415 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] [2020-02-10 20:16:29,241 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1651803752, now seen corresponding path program 662 times [2020-02-10 20:16:29,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:29,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450948104] [2020-02-10 20:16:29,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:29,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450948104] [2020-02-10 20:16:29,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:29,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:29,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846952391] [2020-02-10 20:16:29,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:29,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:29,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:29,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:29,493 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:16:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:29,594 INFO L93 Difference]: Finished difference Result 578 states and 1717 transitions. [2020-02-10 20:16:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:29,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:29,595 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:16:29,595 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:16:29,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:16:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 388. [2020-02-10 20:16:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-02-10 20:16:29,604 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:29,604 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-02-10 20:16:29,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-02-10 20:16:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:29,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:29,605 INFO L415 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] [2020-02-10 20:16:29,605 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1359860210, now seen corresponding path program 663 times [2020-02-10 20:16:29,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:29,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355128124] [2020-02-10 20:16:29,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:29,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355128124] [2020-02-10 20:16:29,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:29,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:29,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205220033] [2020-02-10 20:16:29,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:29,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:29,862 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:29,970 INFO L93 Difference]: Finished difference Result 574 states and 1709 transitions. [2020-02-10 20:16:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:29,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:29,971 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:16:29,971 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:16:29,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:16:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 391. [2020-02-10 20:16:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1346 transitions. [2020-02-10 20:16:29,981 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1346 transitions. Word has length 22 [2020-02-10 20:16:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:29,981 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1346 transitions. [2020-02-10 20:16:29,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1346 transitions. [2020-02-10 20:16:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:29,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:29,982 INFO L415 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] [2020-02-10 20:16:29,982 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 577860968, now seen corresponding path program 664 times [2020-02-10 20:16:29,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:29,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581855664] [2020-02-10 20:16:29,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581855664] [2020-02-10 20:16:30,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:30,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:30,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833776229] [2020-02-10 20:16:30,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:30,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:30,229 INFO L87 Difference]: Start difference. First operand 391 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:16:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:30,350 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-02-10 20:16:30,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:30,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:30,351 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:16:30,352 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:16:30,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:16:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 388. [2020-02-10 20:16:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:16:30,361 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:30,361 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:16:30,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:16:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:30,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:30,362 INFO L415 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] [2020-02-10 20:16:30,362 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1115336270, now seen corresponding path program 665 times [2020-02-10 20:16:30,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:30,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311313240] [2020-02-10 20:16:30,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:30,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311313240] [2020-02-10 20:16:30,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:30,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:30,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742683464] [2020-02-10 20:16:30,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:30,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:30,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:30,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:30,616 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:30,714 INFO L93 Difference]: Finished difference Result 582 states and 1724 transitions. [2020-02-10 20:16:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:30,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:30,715 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:16:30,715 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:16:30,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:16:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 393. [2020-02-10 20:16:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:16:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1347 transitions. [2020-02-10 20:16:30,725 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1347 transitions. Word has length 22 [2020-02-10 20:16:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:30,725 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1347 transitions. [2020-02-10 20:16:30,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1347 transitions. [2020-02-10 20:16:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:30,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:30,726 INFO L415 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] [2020-02-10 20:16:30,726 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 595277038, now seen corresponding path program 666 times [2020-02-10 20:16:30,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:30,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913986893] [2020-02-10 20:16:30,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:31,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913986893] [2020-02-10 20:16:31,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:31,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:31,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414145203] [2020-02-10 20:16:31,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:31,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:31,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:31,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:31,006 INFO L87 Difference]: Start difference. First operand 393 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:16:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:31,123 INFO L93 Difference]: Finished difference Result 581 states and 1717 transitions. [2020-02-10 20:16:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:31,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:31,125 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:16:31,125 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:16:31,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:16:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 385. [2020-02-10 20:16:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 20:16:31,135 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:31,135 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 20:16:31,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 20:16:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:31,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:31,136 INFO L415 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] [2020-02-10 20:16:31,136 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash -854152164, now seen corresponding path program 667 times [2020-02-10 20:16:31,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:31,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812358188] [2020-02-10 20:16:31,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:31,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812358188] [2020-02-10 20:16:31,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:31,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:31,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504807579] [2020-02-10 20:16:31,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:31,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:31,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:31,379 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:31,473 INFO L93 Difference]: Finished difference Result 561 states and 1675 transitions. [2020-02-10 20:16:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:31,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:31,475 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:16:31,475 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:16:31,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:16:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 387. [2020-02-10 20:16:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:16:31,484 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:31,484 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:16:31,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:16:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:31,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:31,485 INFO L415 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] [2020-02-10 20:16:31,485 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1929863320, now seen corresponding path program 668 times [2020-02-10 20:16:31,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:31,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953450841] [2020-02-10 20:16:31,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:31,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953450841] [2020-02-10 20:16:31,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:31,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:31,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561940320] [2020-02-10 20:16:31,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:31,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:31,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:31,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:31,729 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:31,842 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-02-10 20:16:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:31,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:31,843 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:16:31,844 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:16:31,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:16:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 386. [2020-02-10 20:16:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 20:16:31,853 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:31,853 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 20:16:31,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 20:16:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:31,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:31,854 INFO L415 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] [2020-02-10 20:16:31,854 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash 239939424, now seen corresponding path program 669 times [2020-02-10 20:16:31,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:31,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228565447] [2020-02-10 20:16:31,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:32,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228565447] [2020-02-10 20:16:32,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:32,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:32,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777479145] [2020-02-10 20:16:32,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:32,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:32,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:32,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:32,126 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,210 INFO L93 Difference]: Finished difference Result 560 states and 1672 transitions. [2020-02-10 20:16:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:32,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,212 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:16:32,212 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:16:32,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:16:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 20:16:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 20:16:32,222 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:32,222 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 20:16:32,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 20:16:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:32,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:32,223 INFO L415 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] [2020-02-10 20:16:32,223 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1908857112, now seen corresponding path program 670 times [2020-02-10 20:16:32,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:32,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473526670] [2020-02-10 20:16:32,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:32,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473526670] [2020-02-10 20:16:32,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:32,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:32,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492791913] [2020-02-10 20:16:32,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:32,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:32,472 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,589 INFO L93 Difference]: Finished difference Result 564 states and 1679 transitions. [2020-02-10 20:16:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:32,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,591 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:16:32,591 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:16:32,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:16:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2020-02-10 20:16:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 20:16:32,600 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:32,601 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 20:16:32,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 20:16:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:32,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:32,601 INFO L415 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] [2020-02-10 20:16:32,601 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash 176920800, now seen corresponding path program 671 times [2020-02-10 20:16:32,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:32,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353166325] [2020-02-10 20:16:32,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:32,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353166325] [2020-02-10 20:16:32,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:32,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816512947] [2020-02-10 20:16:32,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:32,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:32,863 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,961 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-02-10 20:16:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:32,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,962 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:16:32,962 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:16:32,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:16:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 391. [2020-02-10 20:16:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1342 transitions. [2020-02-10 20:16:32,977 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:32,978 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1342 transitions. [2020-02-10 20:16:32,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1342 transitions. [2020-02-10 20:16:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:32,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:32,978 INFO L415 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] [2020-02-10 20:16:32,978 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash -896164580, now seen corresponding path program 672 times [2020-02-10 20:16:32,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:32,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597515040] [2020-02-10 20:16:32,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:33,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597515040] [2020-02-10 20:16:33,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:33,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628969818] [2020-02-10 20:16:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:33,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:33,233 INFO L87 Difference]: Start difference. First operand 391 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:33,353 INFO L93 Difference]: Finished difference Result 573 states and 1696 transitions. [2020-02-10 20:16:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:33,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:33,355 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:16:33,355 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:16:33,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:16:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 384. [2020-02-10 20:16:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-02-10 20:16:33,364 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-02-10 20:16:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:33,364 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-02-10 20:16:33,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-02-10 20:16:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:33,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:33,365 INFO L415 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] [2020-02-10 20:16:33,365 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1729611692, now seen corresponding path program 673 times [2020-02-10 20:16:33,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633930690] [2020-02-10 20:16:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:33,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633930690] [2020-02-10 20:16:33,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:33,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:33,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431428933] [2020-02-10 20:16:33,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:33,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:33,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:33,620 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:16:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:33,717 INFO L93 Difference]: Finished difference Result 570 states and 1710 transitions. [2020-02-10 20:16:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:33,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:33,719 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:16:33,719 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:16:33,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:16:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 390. [2020-02-10 20:16:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 20:16:33,729 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 20:16:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:33,729 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 20:16:33,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 20:16:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:33,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:33,729 INFO L415 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] [2020-02-10 20:16:33,730 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:33,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1476518940, now seen corresponding path program 674 times [2020-02-10 20:16:33,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:33,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757144849] [2020-02-10 20:16:33,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:33,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757144849] [2020-02-10 20:16:33,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:33,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:33,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348615998] [2020-02-10 20:16:33,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:33,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:33,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:34,000 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:16:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:34,097 INFO L93 Difference]: Finished difference Result 569 states and 1706 transitions. [2020-02-10 20:16:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:34,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:34,099 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:16:34,099 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:16:34,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:16:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 388. [2020-02-10 20:16:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1344 transitions. [2020-02-10 20:16:34,109 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1344 transitions. Word has length 22 [2020-02-10 20:16:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:34,109 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1344 transitions. [2020-02-10 20:16:34,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1344 transitions. [2020-02-10 20:16:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:34,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:34,109 INFO L415 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] [2020-02-10 20:16:34,110 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:34,110 INFO L82 PathProgramCache]: Analyzing trace with hash 883518694, now seen corresponding path program 675 times [2020-02-10 20:16:34,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:34,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843743181] [2020-02-10 20:16:34,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:34,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843743181] [2020-02-10 20:16:34,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:34,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:34,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9646969] [2020-02-10 20:16:34,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:34,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:34,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:34,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:34,360 INFO L87 Difference]: Start difference. First operand 388 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:16:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:34,467 INFO L93 Difference]: Finished difference Result 575 states and 1719 transitions. [2020-02-10 20:16:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:34,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:34,468 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:16:34,469 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:16:34,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:16:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2020-02-10 20:16:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-02-10 20:16:34,478 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-02-10 20:16:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:34,478 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-02-10 20:16:34,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-02-10 20:16:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:34,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:34,479 INFO L415 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] [2020-02-10 20:16:34,479 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:34,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2025413472, now seen corresponding path program 676 times [2020-02-10 20:16:34,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:34,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698717024] [2020-02-10 20:16:34,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:34,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698717024] [2020-02-10 20:16:34,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:34,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:34,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421047949] [2020-02-10 20:16:34,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:34,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:34,727 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:16:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:34,832 INFO L93 Difference]: Finished difference Result 578 states and 1722 transitions. [2020-02-10 20:16:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:34,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:34,834 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:16:34,834 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:16:34,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:16:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 388. [2020-02-10 20:16:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 20:16:34,844 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:34,844 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 20:16:34,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 20:16:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:34,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:34,844 INFO L415 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] [2020-02-10 20:16:34,845 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2017428796, now seen corresponding path program 677 times [2020-02-10 20:16:34,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:34,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815881867] [2020-02-10 20:16:34,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815881867] [2020-02-10 20:16:35,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:35,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964314611] [2020-02-10 20:16:35,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:35,097 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:35,221 INFO L93 Difference]: Finished difference Result 572 states and 1710 transitions. [2020-02-10 20:16:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:35,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:35,223 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:16:35,223 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:16:35,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:16:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 390. [2020-02-10 20:16:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 20:16:35,232 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 20:16:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:35,232 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 20:16:35,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 20:16:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:35,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:35,233 INFO L415 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] [2020-02-10 20:16:35,233 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:35,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1359588310, now seen corresponding path program 678 times [2020-02-10 20:16:35,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:35,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204288988] [2020-02-10 20:16:35,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204288988] [2020-02-10 20:16:35,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:35,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805367115] [2020-02-10 20:16:35,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:35,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:35,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:35,489 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:16:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:35,598 INFO L93 Difference]: Finished difference Result 576 states and 1716 transitions. [2020-02-10 20:16:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:35,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:35,600 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:16:35,600 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:16:35,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:16:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 386. [2020-02-10 20:16:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 20:16:35,609 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:35,609 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 20:16:35,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 20:16:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:35,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:35,610 INFO L415 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] [2020-02-10 20:16:35,610 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:35,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:35,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2122456464, now seen corresponding path program 679 times [2020-02-10 20:16:35,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:35,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519335979] [2020-02-10 20:16:35,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519335979] [2020-02-10 20:16:35,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:35,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038907112] [2020-02-10 20:16:35,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:35,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:35,862 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:35,980 INFO L93 Difference]: Finished difference Result 569 states and 1706 transitions. [2020-02-10 20:16:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:35,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:35,982 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:16:35,982 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:16:35,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:16:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-02-10 20:16:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-02-10 20:16:35,992 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-02-10 20:16:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:35,992 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-02-10 20:16:35,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-02-10 20:16:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:35,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:35,993 INFO L415 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] [2020-02-10 20:16:35,993 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1919418080, now seen corresponding path program 680 times [2020-02-10 20:16:35,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:35,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547974334] [2020-02-10 20:16:35,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547974334] [2020-02-10 20:16:36,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892144723] [2020-02-10 20:16:36,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:36,249 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:16:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:36,365 INFO L93 Difference]: Finished difference Result 568 states and 1702 transitions. [2020-02-10 20:16:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:36,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:36,367 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:16:36,367 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:16:36,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:16:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 388. [2020-02-10 20:16:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 20:16:36,376 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:36,376 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 20:16:36,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 20:16:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:36,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:36,377 INFO L415 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] [2020-02-10 20:16:36,377 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1534711142, now seen corresponding path program 681 times [2020-02-10 20:16:36,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:36,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037530794] [2020-02-10 20:16:36,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:36,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037530794] [2020-02-10 20:16:36,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:36,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:36,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127172227] [2020-02-10 20:16:36,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:36,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:36,627 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:36,752 INFO L93 Difference]: Finished difference Result 573 states and 1713 transitions. [2020-02-10 20:16:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:36,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:36,754 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:16:36,754 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:16:36,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:16:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 391. [2020-02-10 20:16:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1347 transitions. [2020-02-10 20:16:36,763 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1347 transitions. Word has length 22 [2020-02-10 20:16:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:36,763 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1347 transitions. [2020-02-10 20:16:36,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1347 transitions. [2020-02-10 20:16:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:36,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:36,764 INFO L415 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] [2020-02-10 20:16:36,764 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash 752711900, now seen corresponding path program 682 times [2020-02-10 20:16:36,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:36,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949535495] [2020-02-10 20:16:36,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:37,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949535495] [2020-02-10 20:16:37,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:37,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:37,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417157356] [2020-02-10 20:16:37,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:37,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:37,018 INFO L87 Difference]: Start difference. First operand 391 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:16:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:37,149 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-02-10 20:16:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:37,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:37,150 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:16:37,151 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:16:37,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:16:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-02-10 20:16:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1340 transitions. [2020-02-10 20:16:37,159 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:37,159 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1340 transitions. [2020-02-10 20:16:37,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1340 transitions. [2020-02-10 20:16:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:37,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:37,160 INFO L415 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] [2020-02-10 20:16:37,160 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1855645568, now seen corresponding path program 683 times [2020-02-10 20:16:37,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:37,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449102545] [2020-02-10 20:16:37,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:37,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449102545] [2020-02-10 20:16:37,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:37,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:37,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198472090] [2020-02-10 20:16:37,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:37,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:37,402 INFO L87 Difference]: Start difference. First operand 388 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:37,528 INFO L93 Difference]: Finished difference Result 570 states and 1704 transitions. [2020-02-10 20:16:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:37,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:37,530 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:16:37,530 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:16:37,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:16:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-02-10 20:16:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 20:16:37,539 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 20:16:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:37,539 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 20:16:37,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 20:16:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:37,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:37,540 INFO L415 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] [2020-02-10 20:16:37,540 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1867866922, now seen corresponding path program 684 times [2020-02-10 20:16:37,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:37,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707649166] [2020-02-10 20:16:37,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:37,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707649166] [2020-02-10 20:16:37,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:37,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:37,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592566650] [2020-02-10 20:16:37,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:37,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:37,798 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:16:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:37,912 INFO L93 Difference]: Finished difference Result 573 states and 1708 transitions. [2020-02-10 20:16:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:37,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:37,914 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:16:37,914 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:16:37,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:16:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2020-02-10 20:16:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:16:37,923 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:37,923 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:16:37,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:16:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:37,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:37,924 INFO L415 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] [2020-02-10 20:16:37,924 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -156717104, now seen corresponding path program 685 times [2020-02-10 20:16:37,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:37,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115310690] [2020-02-10 20:16:37,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:38,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115310690] [2020-02-10 20:16:38,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:38,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:38,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564907654] [2020-02-10 20:16:38,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:38,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:38,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:38,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:38,175 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:38,301 INFO L93 Difference]: Finished difference Result 583 states and 1739 transitions. [2020-02-10 20:16:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:38,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:38,303 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:16:38,303 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:16:38,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:16:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 392. [2020-02-10 20:16:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:16:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1351 transitions. [2020-02-10 20:16:38,313 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1351 transitions. Word has length 22 [2020-02-10 20:16:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:38,313 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1351 transitions. [2020-02-10 20:16:38,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1351 transitions. [2020-02-10 20:16:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:38,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:38,314 INFO L415 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] [2020-02-10 20:16:38,314 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1229318026, now seen corresponding path program 686 times [2020-02-10 20:16:38,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:38,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264018866] [2020-02-10 20:16:38,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:38,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264018866] [2020-02-10 20:16:38,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:38,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:38,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429654067] [2020-02-10 20:16:38,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:38,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:38,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:38,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:38,571 INFO L87 Difference]: Start difference. First operand 392 states and 1351 transitions. Second operand 9 states. [2020-02-10 20:16:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:38,699 INFO L93 Difference]: Finished difference Result 586 states and 1742 transitions. [2020-02-10 20:16:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:38,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:38,701 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:16:38,701 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:16:38,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:16:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 389. [2020-02-10 20:16:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 20:16:38,711 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 20:16:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:38,711 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 20:16:38,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 20:16:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:38,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:38,712 INFO L415 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] [2020-02-10 20:16:38,712 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash 937374484, now seen corresponding path program 687 times [2020-02-10 20:16:38,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:38,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048292533] [2020-02-10 20:16:38,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:38,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048292533] [2020-02-10 20:16:38,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:38,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:38,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438465411] [2020-02-10 20:16:38,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:38,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:38,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:38,966 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:16:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:39,106 INFO L93 Difference]: Finished difference Result 582 states and 1734 transitions. [2020-02-10 20:16:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:39,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:39,107 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:16:39,107 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:16:39,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:16:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 392. [2020-02-10 20:16:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:16:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1348 transitions. [2020-02-10 20:16:39,115 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1348 transitions. Word has length 22 [2020-02-10 20:16:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:39,115 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1348 transitions. [2020-02-10 20:16:39,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1348 transitions. [2020-02-10 20:16:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:39,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:39,116 INFO L415 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] [2020-02-10 20:16:39,116 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 155375242, now seen corresponding path program 688 times [2020-02-10 20:16:39,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:39,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468442401] [2020-02-10 20:16:39,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:39,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468442401] [2020-02-10 20:16:39,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:39,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:39,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464051697] [2020-02-10 20:16:39,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:39,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:39,367 INFO L87 Difference]: Start difference. First operand 392 states and 1348 transitions. Second operand 9 states. [2020-02-10 20:16:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:39,505 INFO L93 Difference]: Finished difference Result 584 states and 1735 transitions. [2020-02-10 20:16:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:39,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:39,506 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:16:39,506 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:16:39,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:16:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-02-10 20:16:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 20:16:39,516 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:39,516 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 20:16:39,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 20:16:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:39,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:39,517 INFO L415 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] [2020-02-10 20:16:39,517 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:39,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:39,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1537821996, now seen corresponding path program 689 times [2020-02-10 20:16:39,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:39,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662681342] [2020-02-10 20:16:39,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:39,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662681342] [2020-02-10 20:16:39,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:39,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:39,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621159710] [2020-02-10 20:16:39,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:39,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:39,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:39,770 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:39,901 INFO L93 Difference]: Finished difference Result 590 states and 1749 transitions. [2020-02-10 20:16:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:39,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:39,903 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:16:39,903 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:16:39,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:16:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 394. [2020-02-10 20:16:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:16:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1349 transitions. [2020-02-10 20:16:39,913 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1349 transitions. Word has length 22 [2020-02-10 20:16:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:39,913 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1349 transitions. [2020-02-10 20:16:39,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1349 transitions. [2020-02-10 20:16:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:39,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:39,914 INFO L415 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] [2020-02-10 20:16:39,914 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 172791312, now seen corresponding path program 690 times [2020-02-10 20:16:39,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:39,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421015352] [2020-02-10 20:16:39,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:40,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421015352] [2020-02-10 20:16:40,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:40,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:40,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107481266] [2020-02-10 20:16:40,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:40,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:40,176 INFO L87 Difference]: Start difference. First operand 394 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:16:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:40,311 INFO L93 Difference]: Finished difference Result 589 states and 1742 transitions. [2020-02-10 20:16:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:40,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:40,312 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:16:40,313 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:16:40,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:16:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 386. [2020-02-10 20:16:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 20:16:40,322 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:40,322 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 20:16:40,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 20:16:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:40,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:40,323 INFO L415 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] [2020-02-10 20:16:40,323 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash -954572700, now seen corresponding path program 691 times [2020-02-10 20:16:40,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:40,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737999608] [2020-02-10 20:16:40,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:40,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737999608] [2020-02-10 20:16:40,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:40,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:40,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960052045] [2020-02-10 20:16:40,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:40,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:40,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:40,569 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:40,686 INFO L93 Difference]: Finished difference Result 576 states and 1718 transitions. [2020-02-10 20:16:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:40,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:40,688 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:16:40,688 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:16:40,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:16:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 390. [2020-02-10 20:16:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 20:16:40,696 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 20:16:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:40,696 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 20:16:40,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 20:16:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:40,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:40,697 INFO L415 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] [2020-02-10 20:16:40,697 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:40,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1872522890, now seen corresponding path program 692 times [2020-02-10 20:16:40,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:40,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564895319] [2020-02-10 20:16:40,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:40,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564895319] [2020-02-10 20:16:40,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:40,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:40,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450523552] [2020-02-10 20:16:40,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:40,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:40,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:40,938 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:16:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:41,065 INFO L93 Difference]: Finished difference Result 580 states and 1724 transitions. [2020-02-10 20:16:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:41,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:41,067 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:16:41,067 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:16:41,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:16:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-02-10 20:16:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:16:41,076 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:41,076 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:16:41,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:16:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:41,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:41,076 INFO L415 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] [2020-02-10 20:16:41,076 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2027658080, now seen corresponding path program 693 times [2020-02-10 20:16:41,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:41,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397692824] [2020-02-10 20:16:41,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:41,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397692824] [2020-02-10 20:16:41,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:41,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:41,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314373958] [2020-02-10 20:16:41,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:41,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:41,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:41,334 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:41,438 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-02-10 20:16:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:41,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:41,439 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:16:41,440 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:16:41,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:16:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2020-02-10 20:16:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:16:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1341 transitions. [2020-02-10 20:16:41,449 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:41,449 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1341 transitions. [2020-02-10 20:16:41,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1341 transitions. [2020-02-10 20:16:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:41,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:41,450 INFO L415 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] [2020-02-10 20:16:41,450 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1456203274, now seen corresponding path program 694 times [2020-02-10 20:16:41,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:41,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242158803] [2020-02-10 20:16:41,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:41,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242158803] [2020-02-10 20:16:41,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:41,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:41,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340269352] [2020-02-10 20:16:41,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:41,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:41,697 INFO L87 Difference]: Start difference. First operand 390 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:41,829 INFO L93 Difference]: Finished difference Result 578 states and 1718 transitions. [2020-02-10 20:16:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:41,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:41,830 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:16:41,830 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:16:41,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:16:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 388. [2020-02-10 20:16:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 20:16:41,840 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:41,840 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 20:16:41,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 20:16:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:41,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:41,841 INFO L415 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] [2020-02-10 20:16:41,841 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1337293088, now seen corresponding path program 695 times [2020-02-10 20:16:41,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:41,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705812378] [2020-02-10 20:16:41,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705812378] [2020-02-10 20:16:42,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:42,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179216584] [2020-02-10 20:16:42,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:42,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:42,097 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:42,234 INFO L93 Difference]: Finished difference Result 586 states and 1737 transitions. [2020-02-10 20:16:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:42,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:42,235 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:16:42,236 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:16:42,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:16:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 393. [2020-02-10 20:16:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:16:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1345 transitions. [2020-02-10 20:16:42,244 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1345 transitions. Word has length 22 [2020-02-10 20:16:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:42,244 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1345 transitions. [2020-02-10 20:16:42,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1345 transitions. [2020-02-10 20:16:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:42,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:42,244 INFO L415 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] [2020-02-10 20:16:42,245 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 152111908, now seen corresponding path program 696 times [2020-02-10 20:16:42,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:42,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870174825] [2020-02-10 20:16:42,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870174825] [2020-02-10 20:16:42,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:42,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844425244] [2020-02-10 20:16:42,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:42,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:42,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:42,494 INFO L87 Difference]: Start difference. First operand 393 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:16:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:42,622 INFO L93 Difference]: Finished difference Result 585 states and 1730 transitions. [2020-02-10 20:16:42,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:42,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:42,624 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:16:42,624 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:16:42,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:16:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 20:16:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1329 transitions. [2020-02-10 20:16:42,633 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1329 transitions. Word has length 22 [2020-02-10 20:16:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:42,633 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1329 transitions. [2020-02-10 20:16:42,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1329 transitions. [2020-02-10 20:16:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:42,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:42,634 INFO L415 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] [2020-02-10 20:16:42,634 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1022949092, now seen corresponding path program 697 times [2020-02-10 20:16:42,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:42,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130983304] [2020-02-10 20:16:42,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130983304] [2020-02-10 20:16:42,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:42,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640632799] [2020-02-10 20:16:42,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:42,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:42,911 INFO L87 Difference]: Start difference. First operand 384 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:16:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,017 INFO L93 Difference]: Finished difference Result 547 states and 1641 transitions. [2020-02-10 20:16:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:43,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,019 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:16:43,019 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:16:43,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:16:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 387. [2020-02-10 20:16:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:43,027 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,027 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:43,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:43,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,028 INFO L415 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] [2020-02-10 20:16:43,028 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1661077246, now seen corresponding path program 698 times [2020-02-10 20:16:43,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672113818] [2020-02-10 20:16:43,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:43,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672113818] [2020-02-10 20:16:43,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:43,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:43,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859150872] [2020-02-10 20:16:43,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:43,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:43,301 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,428 INFO L93 Difference]: Finished difference Result 548 states and 1642 transitions. [2020-02-10 20:16:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:43,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,430 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:16:43,430 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:16:43,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:16:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2020-02-10 20:16:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:16:43,440 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,440 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:16:43,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:16:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:43,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,441 INFO L415 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] [2020-02-10 20:16:43,441 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash -658887818, now seen corresponding path program 699 times [2020-02-10 20:16:43,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156898528] [2020-02-10 20:16:43,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:43,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156898528] [2020-02-10 20:16:43,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:43,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:43,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958410258] [2020-02-10 20:16:43,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:43,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:43,699 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,801 INFO L93 Difference]: Finished difference Result 551 states and 1648 transitions. [2020-02-10 20:16:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:43,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,802 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:16:43,802 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:16:43,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:16:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 387. [2020-02-10 20:16:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:16:43,811 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,812 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:16:43,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:16:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:43,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,812 INFO L415 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] [2020-02-10 20:16:43,812 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1734598974, now seen corresponding path program 700 times [2020-02-10 20:16:43,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027309778] [2020-02-10 20:16:43,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:44,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027309778] [2020-02-10 20:16:44,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:44,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:44,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482145407] [2020-02-10 20:16:44,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:44,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:44,228 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:44,352 INFO L93 Difference]: Finished difference Result 556 states and 1657 transitions. [2020-02-10 20:16:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:44,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:44,354 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:16:44,354 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:16:44,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:16:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2020-02-10 20:16:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 20:16:44,363 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:44,363 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 20:16:44,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 20:16:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:44,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:44,364 INFO L415 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] [2020-02-10 20:16:44,364 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -648384714, now seen corresponding path program 701 times [2020-02-10 20:16:44,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:44,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631154480] [2020-02-10 20:16:44,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:44,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631154480] [2020-02-10 20:16:44,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:44,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:44,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877405239] [2020-02-10 20:16:44,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:44,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:44,618 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:44,718 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-02-10 20:16:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:44,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:44,720 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:16:44,720 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:16:44,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:16:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 388. [2020-02-10 20:16:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 20:16:44,729 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:44,729 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 20:16:44,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 20:16:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:44,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:44,730 INFO L415 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] [2020-02-10 20:16:44,730 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash 959930468, now seen corresponding path program 702 times [2020-02-10 20:16:44,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:44,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316915873] [2020-02-10 20:16:44,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:44,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316915873] [2020-02-10 20:16:44,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:44,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:44,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512120785] [2020-02-10 20:16:44,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:44,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:44,995 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:45,122 INFO L93 Difference]: Finished difference Result 558 states and 1660 transitions. [2020-02-10 20:16:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:45,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:45,124 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:16:45,124 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:16:45,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:16:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 385. [2020-02-10 20:16:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 20:16:45,132 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:45,133 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 20:16:45,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 20:16:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:45,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:45,133 INFO L415 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] [2020-02-10 20:16:45,133 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:45,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:45,134 INFO L82 PathProgramCache]: Analyzing trace with hash 580049952, now seen corresponding path program 703 times [2020-02-10 20:16:45,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:45,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536576229] [2020-02-10 20:16:45,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:45,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536576229] [2020-02-10 20:16:45,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:45,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:45,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399430321] [2020-02-10 20:16:45,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:45,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:45,416 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:45,520 INFO L93 Difference]: Finished difference Result 546 states and 1638 transitions. [2020-02-10 20:16:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:45,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:45,522 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:16:45,522 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:16:45,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:16:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-02-10 20:16:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:16:45,531 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:45,532 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:16:45,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:16:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:45,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:45,532 INFO L415 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] [2020-02-10 20:16:45,532 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2103976386, now seen corresponding path program 704 times [2020-02-10 20:16:45,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:45,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601167913] [2020-02-10 20:16:45,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:45,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601167913] [2020-02-10 20:16:45,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:45,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:45,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537431584] [2020-02-10 20:16:45,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:45,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:45,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:45,810 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:45,939 INFO L93 Difference]: Finished difference Result 547 states and 1639 transitions. [2020-02-10 20:16:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:45,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:45,941 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:16:45,941 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:16:45,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:16:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 386. [2020-02-10 20:16:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 20:16:45,951 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:45,951 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 20:16:45,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 20:16:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:45,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:45,951 INFO L415 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] [2020-02-10 20:16:45,951 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -7695370, now seen corresponding path program 705 times [2020-02-10 20:16:45,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:45,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567831828] [2020-02-10 20:16:45,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:46,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567831828] [2020-02-10 20:16:46,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:46,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:46,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936951639] [2020-02-10 20:16:46,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:46,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:46,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:46,226 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:46,329 INFO L93 Difference]: Finished difference Result 549 states and 1643 transitions. [2020-02-10 20:16:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:46,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:46,331 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:16:46,331 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:16:46,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:16:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 387. [2020-02-10 20:16:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 20:16:46,340 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:46,340 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 20:16:46,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 20:16:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:46,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:46,341 INFO L415 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] [2020-02-10 20:16:46,341 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2138475390, now seen corresponding path program 706 times [2020-02-10 20:16:46,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:46,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771102449] [2020-02-10 20:16:46,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:46,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771102449] [2020-02-10 20:16:46,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:46,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:46,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463669380] [2020-02-10 20:16:46,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:46,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:46,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:46,604 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:46,731 INFO L93 Difference]: Finished difference Result 553 states and 1650 transitions. [2020-02-10 20:16:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:46,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:46,733 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:16:46,733 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:16:46,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:16:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 386. [2020-02-10 20:16:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 20:16:46,742 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:46,742 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 20:16:46,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 20:16:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:46,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:46,743 INFO L415 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] [2020-02-10 20:16:46,743 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2807734, now seen corresponding path program 707 times [2020-02-10 20:16:46,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:46,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016534351] [2020-02-10 20:16:46,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:47,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016534351] [2020-02-10 20:16:47,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:47,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:47,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730335606] [2020-02-10 20:16:47,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:47,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:47,020 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:47,145 INFO L93 Difference]: Finished difference Result 552 states and 1649 transitions. [2020-02-10 20:16:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:47,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:47,146 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:16:47,147 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:16:47,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:16:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 388. [2020-02-10 20:16:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 20:16:47,157 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 20:16:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,157 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 20:16:47,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 20:16:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:47,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:47,158 INFO L415 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] [2020-02-10 20:16:47,158 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash 538037536, now seen corresponding path program 708 times [2020-02-10 20:16:47,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332005747] [2020-02-10 20:16:47,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:47,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332005747] [2020-02-10 20:16:47,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:47,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:47,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398131985] [2020-02-10 20:16:47,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:47,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:47,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:47,424 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:16:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:47,552 INFO L93 Difference]: Finished difference Result 555 states and 1653 transitions. [2020-02-10 20:16:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:47,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:47,554 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:16:47,554 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:16:47,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:16:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2020-02-10 20:16:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1331 transitions. [2020-02-10 20:16:47,564 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1331 transitions. Word has length 22 [2020-02-10 20:16:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,564 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1331 transitions. [2020-02-10 20:16:47,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1331 transitions. [2020-02-10 20:16:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:47,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:47,564 INFO L415 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] [2020-02-10 20:16:47,565 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1699123616, now seen corresponding path program 709 times [2020-02-10 20:16:47,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890957729] [2020-02-10 20:16:47,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:47,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890957729] [2020-02-10 20:16:47,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:47,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:47,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781451214] [2020-02-10 20:16:47,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:47,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:47,831 INFO L87 Difference]: Start difference. First operand 385 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:16:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:47,921 INFO L93 Difference]: Finished difference Result 557 states and 1662 transitions. [2020-02-10 20:16:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:47,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:47,923 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:16:47,923 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:16:47,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:16:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 20:16:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 20:16:47,933 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,933 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 20:16:47,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 20:16:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:47,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:47,934 INFO L415 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] [2020-02-10 20:16:47,934 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1520132524, now seen corresponding path program 710 times [2020-02-10 20:16:47,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835437214] [2020-02-10 20:16:47,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:48,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835437214] [2020-02-10 20:16:48,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:48,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:48,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490947990] [2020-02-10 20:16:48,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:48,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:48,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:48,194 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:48,321 INFO L93 Difference]: Finished difference Result 562 states and 1671 transitions. [2020-02-10 20:16:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:48,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:48,322 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:16:48,322 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:16:48,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:16:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-02-10 20:16:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 20:16:48,331 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:48,331 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 20:16:48,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 20:16:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:48,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:48,332 INFO L415 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] [2020-02-10 20:16:48,332 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash -605032028, now seen corresponding path program 711 times [2020-02-10 20:16:48,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:48,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956870771] [2020-02-10 20:16:48,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:48,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956870771] [2020-02-10 20:16:48,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:48,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:48,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498775033] [2020-02-10 20:16:48,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:48,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:48,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:48,600 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:48,704 INFO L93 Difference]: Finished difference Result 556 states and 1659 transitions. [2020-02-10 20:16:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:48,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:48,706 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:16:48,706 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:16:48,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:16:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 387. [2020-02-10 20:16:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 20:16:48,716 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:48,716 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 20:16:48,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 20:16:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:48,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:48,717 INFO L415 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] [2020-02-10 20:16:48,717 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:48,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1541138732, now seen corresponding path program 712 times [2020-02-10 20:16:48,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:48,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788305535] [2020-02-10 20:16:48,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:48,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788305535] [2020-02-10 20:16:48,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:48,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:48,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043391806] [2020-02-10 20:16:48,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:48,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:48,992 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:49,121 INFO L93 Difference]: Finished difference Result 560 states and 1666 transitions. [2020-02-10 20:16:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:49,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:49,123 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:16:49,123 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:16:49,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:16:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 386. [2020-02-10 20:16:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-02-10 20:16:49,132 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:49,132 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-02-10 20:16:49,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-02-10 20:16:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:49,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:49,133 INFO L415 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] [2020-02-10 20:16:49,133 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash -668050652, now seen corresponding path program 713 times [2020-02-10 20:16:49,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:49,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901610299] [2020-02-10 20:16:49,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:49,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901610299] [2020-02-10 20:16:49,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:49,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:49,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142178632] [2020-02-10 20:16:49,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:49,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:49,403 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:49,530 INFO L93 Difference]: Finished difference Result 570 states and 1690 transitions. [2020-02-10 20:16:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:49,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:49,532 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:16:49,532 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:16:49,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:16:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 391. [2020-02-10 20:16:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:16:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1341 transitions. [2020-02-10 20:16:49,541 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1341 transitions. Word has length 22 [2020-02-10 20:16:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:49,542 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1341 transitions. [2020-02-10 20:16:49,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1341 transitions. [2020-02-10 20:16:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:49,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:49,542 INFO L415 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] [2020-02-10 20:16:49,542 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1741136032, now seen corresponding path program 714 times [2020-02-10 20:16:49,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:49,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130790776] [2020-02-10 20:16:49,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:49,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130790776] [2020-02-10 20:16:49,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:49,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:49,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647382727] [2020-02-10 20:16:49,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:49,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:49,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:49,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:49,808 INFO L87 Difference]: Start difference. First operand 391 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:16:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:49,940 INFO L93 Difference]: Finished difference Result 569 states and 1683 transitions. [2020-02-10 20:16:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:49,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:49,942 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:16:49,942 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:16:49,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:16:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 385. [2020-02-10 20:16:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1330 transitions. [2020-02-10 20:16:49,952 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1330 transitions. Word has length 22 [2020-02-10 20:16:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:49,952 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1330 transitions. [2020-02-10 20:16:49,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1330 transitions. [2020-02-10 20:16:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:49,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:49,953 INFO L415 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] [2020-02-10 20:16:49,953 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:49,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 237413566, now seen corresponding path program 715 times [2020-02-10 20:16:49,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:49,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731916720] [2020-02-10 20:16:49,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:50,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731916720] [2020-02-10 20:16:50,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:50,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:50,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482366829] [2020-02-10 20:16:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:50,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:50,215 INFO L87 Difference]: Start difference. First operand 385 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:16:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:50,333 INFO L93 Difference]: Finished difference Result 564 states and 1680 transitions. [2020-02-10 20:16:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:50,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:50,335 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:16:50,335 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:16:50,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:16:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 389. [2020-02-10 20:16:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 20:16:50,345 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:50,345 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 20:16:50,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 20:16:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:50,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:50,346 INFO L415 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] [2020-02-10 20:16:50,346 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1845728748, now seen corresponding path program 716 times [2020-02-10 20:16:50,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:50,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443091518] [2020-02-10 20:16:50,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:50,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443091518] [2020-02-10 20:16:50,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:50,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:50,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146497872] [2020-02-10 20:16:50,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:50,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:50,606 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:50,734 INFO L93 Difference]: Finished difference Result 568 states and 1686 transitions. [2020-02-10 20:16:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:50,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:50,735 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:16:50,736 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:16:50,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:16:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 387. [2020-02-10 20:16:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 20:16:50,744 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 20:16:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:50,744 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 20:16:50,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 20:16:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:50,745 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:50,745 INFO L415 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] [2020-02-10 20:16:50,745 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1331505154, now seen corresponding path program 717 times [2020-02-10 20:16:50,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:50,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916575557] [2020-02-10 20:16:50,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:51,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916575557] [2020-02-10 20:16:51,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:51,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:51,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545970174] [2020-02-10 20:16:51,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:51,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:51,008 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:16:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:51,138 INFO L93 Difference]: Finished difference Result 563 states and 1676 transitions. [2020-02-10 20:16:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:51,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:51,140 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:16:51,140 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:16:51,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:16:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 389. [2020-02-10 20:16:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:16:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 20:16:51,150 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 20:16:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:51,150 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 20:16:51,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 20:16:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:51,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:51,151 INFO L415 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] [2020-02-10 20:16:51,151 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1866734956, now seen corresponding path program 718 times [2020-02-10 20:16:51,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:51,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246389287] [2020-02-10 20:16:51,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:51,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246389287] [2020-02-10 20:16:51,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:51,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:51,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225919027] [2020-02-10 20:16:51,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:51,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:51,413 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:16:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:51,543 INFO L93 Difference]: Finished difference Result 566 states and 1680 transitions. [2020-02-10 20:16:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:51,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:51,545 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:16:51,545 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:16:51,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:16:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 20:16:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-02-10 20:16:51,554 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:51,555 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-02-10 20:16:51,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-02-10 20:16:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:51,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:51,555 INFO L415 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] [2020-02-10 20:16:51,555 INFO L427 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1257983426, now seen corresponding path program 719 times [2020-02-10 20:16:51,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:51,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348072002] [2020-02-10 20:16:51,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:51,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348072002] [2020-02-10 20:16:51,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:51,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:51,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450698743] [2020-02-10 20:16:51,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:51,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:51,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:51,818 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:51,950 INFO L93 Difference]: Finished difference Result 574 states and 1699 transitions. [2020-02-10 20:16:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:51,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:51,951 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:16:51,951 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:16:51,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:16:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 392. [2020-02-10 20:16:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:16:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1342 transitions. [2020-02-10 20:16:51,960 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:51,961 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1342 transitions. [2020-02-10 20:16:51,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1342 transitions. [2020-02-10 20:16:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:51,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:51,961 INFO L415 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] [2020-02-10 20:16:51,961 INFO L427 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash 184898046, now seen corresponding path program 720 times [2020-02-10 20:16:51,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:51,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753352297] [2020-02-10 20:16:51,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:52,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753352297] [2020-02-10 20:16:52,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:52,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:52,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879892712] [2020-02-10 20:16:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:52,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:52,235 INFO L87 Difference]: Start difference. First operand 392 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:52,374 INFO L93 Difference]: Finished difference Result 573 states and 1692 transitions. [2020-02-10 20:16:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:52,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:52,376 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:16:52,376 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:16:52,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:16:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 379. [2020-02-10 20:16:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:16:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1320 transitions. [2020-02-10 20:16:52,385 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1320 transitions. Word has length 22 [2020-02-10 20:16:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:52,385 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1320 transitions. [2020-02-10 20:16:52,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1320 transitions. [2020-02-10 20:16:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:52,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:52,386 INFO L415 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] [2020-02-10 20:16:52,386 INFO L427 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1940093732, now seen corresponding path program 721 times [2020-02-10 20:16:52,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:52,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35729674] [2020-02-10 20:16:52,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:52,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35729674] [2020-02-10 20:16:52,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:52,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:52,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016511684] [2020-02-10 20:16:52,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:52,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:52,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:52,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:52,664 INFO L87 Difference]: Start difference. First operand 379 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:16:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:52,778 INFO L93 Difference]: Finished difference Result 597 states and 1761 transitions. [2020-02-10 20:16:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:52,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:52,779 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:16:52,780 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:16:52,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:16:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 387. [2020-02-10 20:16:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 20:16:52,788 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 20:16:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:52,788 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 20:16:52,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 20:16:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:52,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:52,789 INFO L415 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] [2020-02-10 20:16:52,789 INFO L427 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:52,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash -764607678, now seen corresponding path program 722 times [2020-02-10 20:16:52,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:52,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378847502] [2020-02-10 20:16:52,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:53,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378847502] [2020-02-10 20:16:53,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:53,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:53,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682232356] [2020-02-10 20:16:53,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:53,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:53,078 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:16:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,191 INFO L93 Difference]: Finished difference Result 592 states and 1748 transitions. [2020-02-10 20:16:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:53,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:53,193 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:16:53,193 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:16:53,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:16:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 383. [2020-02-10 20:16:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:16:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1332 transitions. [2020-02-10 20:16:53,202 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:53,202 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1332 transitions. [2020-02-10 20:16:53,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1332 transitions. [2020-02-10 20:16:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:53,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:53,203 INFO L415 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] [2020-02-10 20:16:53,203 INFO L427 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1002323244, now seen corresponding path program 723 times [2020-02-10 20:16:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:53,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882904695] [2020-02-10 20:16:53,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:53,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882904695] [2020-02-10 20:16:53,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:53,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:53,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749027832] [2020-02-10 20:16:53,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:53,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:53,486 INFO L87 Difference]: Start difference. First operand 383 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,597 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-02-10 20:16:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:53,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:53,599 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:16:53,599 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:16:53,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:16:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 385. [2020-02-10 20:16:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 20:16:53,609 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 20:16:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:53,609 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 20:16:53,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 20:16:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:53,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:53,610 INFO L415 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] [2020-02-10 20:16:53,610 INFO L427 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:53,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:53,610 INFO L82 PathProgramCache]: Analyzing trace with hash -441254752, now seen corresponding path program 724 times [2020-02-10 20:16:53,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:53,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882556092] [2020-02-10 20:16:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:53,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882556092] [2020-02-10 20:16:53,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:53,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:53,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995617758] [2020-02-10 20:16:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:53,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:53,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:53,883 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:16:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,999 INFO L93 Difference]: Finished difference Result 586 states and 1734 transitions. [2020-02-10 20:16:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:53,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:54,001 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:16:54,001 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:16:54,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:16:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 383. [2020-02-10 20:16:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:16:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1330 transitions. [2020-02-10 20:16:54,011 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1330 transitions. Word has length 22 [2020-02-10 20:16:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:54,011 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1330 transitions. [2020-02-10 20:16:54,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1330 transitions. [2020-02-10 20:16:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:54,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:54,012 INFO L415 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] [2020-02-10 20:16:54,012 INFO L427 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2098353846, now seen corresponding path program 725 times [2020-02-10 20:16:54,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:54,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854067774] [2020-02-10 20:16:54,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:54,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854067774] [2020-02-10 20:16:54,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:54,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:54,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758205572] [2020-02-10 20:16:54,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:54,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:54,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:54,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:54,302 INFO L87 Difference]: Start difference. First operand 383 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:16:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:54,436 INFO L93 Difference]: Finished difference Result 582 states and 1727 transitions. [2020-02-10 20:16:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:54,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:54,438 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:16:54,438 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:16:54,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:16:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 384. [2020-02-10 20:16:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 20:16:54,446 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 20:16:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:54,446 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 20:16:54,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 20:16:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:54,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:54,447 INFO L415 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] [2020-02-10 20:16:54,447 INFO L427 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash 652836836, now seen corresponding path program 726 times [2020-02-10 20:16:54,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:54,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870172635] [2020-02-10 20:16:54,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:54,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870172635] [2020-02-10 20:16:54,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:54,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:54,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860419055] [2020-02-10 20:16:54,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:54,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:54,732 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:16:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:54,849 INFO L93 Difference]: Finished difference Result 580 states and 1722 transitions. [2020-02-10 20:16:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:54,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:54,850 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:16:54,850 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:16:54,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:16:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 20:16:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:16:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1326 transitions. [2020-02-10 20:16:54,860 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1326 transitions. Word has length 22 [2020-02-10 20:16:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:54,860 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1326 transitions. [2020-02-10 20:16:54,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1326 transitions. [2020-02-10 20:16:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:54,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:54,861 INFO L415 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] [2020-02-10 20:16:54,861 INFO L427 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1517608006, now seen corresponding path program 727 times [2020-02-10 20:16:54,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:54,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19155326] [2020-02-10 20:16:54,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:55,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19155326] [2020-02-10 20:16:55,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:55,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:55,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496467033] [2020-02-10 20:16:55,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:55,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:55,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:55,143 INFO L87 Difference]: Start difference. First operand 381 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:16:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:55,256 INFO L93 Difference]: Finished difference Result 601 states and 1771 transitions. [2020-02-10 20:16:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:55,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:55,257 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:16:55,258 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:16:55,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:16:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 388. [2020-02-10 20:16:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:16:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 20:16:55,267 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 20:16:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:55,267 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 20:16:55,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 20:16:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:55,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:55,268 INFO L415 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] [2020-02-10 20:16:55,268 INFO L427 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1187093404, now seen corresponding path program 728 times [2020-02-10 20:16:55,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:55,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635003393] [2020-02-10 20:16:55,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:55,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635003393] [2020-02-10 20:16:55,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:55,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:55,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432943237] [2020-02-10 20:16:55,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:55,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:55,540 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:16:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:55,652 INFO L93 Difference]: Finished difference Result 596 states and 1758 transitions. [2020-02-10 20:16:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:55,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:55,654 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:16:55,654 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:16:55,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:16:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 384. [2020-02-10 20:16:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1333 transitions. [2020-02-10 20:16:55,664 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:55,664 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1333 transitions. [2020-02-10 20:16:55,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1333 transitions. [2020-02-10 20:16:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:55,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:55,665 INFO L415 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] [2020-02-10 20:16:55,665 INFO L427 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:55,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1618520178, now seen corresponding path program 729 times [2020-02-10 20:16:55,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:55,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107574554] [2020-02-10 20:16:55,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:55,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107574554] [2020-02-10 20:16:55,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:55,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:55,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331663180] [2020-02-10 20:16:55,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:55,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:55,952 INFO L87 Difference]: Start difference. First operand 384 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,041 INFO L93 Difference]: Finished difference Result 599 states and 1763 transitions. [2020-02-10 20:16:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:56,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,043 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:16:56,043 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:16:56,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:16:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 387. [2020-02-10 20:16:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:16:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 20:16:56,058 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 20:16:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:56,059 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 20:16:56,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 20:16:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:56,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:56,059 INFO L415 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] [2020-02-10 20:16:56,059 INFO L427 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1745156552, now seen corresponding path program 730 times [2020-02-10 20:16:56,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:56,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931850343] [2020-02-10 20:16:56,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:56,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931850343] [2020-02-10 20:16:56,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:56,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:56,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023184357] [2020-02-10 20:16:56,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:56,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:56,343 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:16:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,453 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-02-10 20:16:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:56,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,454 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:16:56,455 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:16:56,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:16:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 20:16:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-02-10 20:16:56,464 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-02-10 20:16:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:56,464 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-02-10 20:16:56,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-02-10 20:16:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:56,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:56,465 INFO L415 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] [2020-02-10 20:16:56,465 INFO L427 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:56,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:56,465 INFO L82 PathProgramCache]: Analyzing trace with hash -669861616, now seen corresponding path program 731 times [2020-02-10 20:16:56,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:56,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392679672] [2020-02-10 20:16:56,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:56,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392679672] [2020-02-10 20:16:56,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:56,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:56,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032901377] [2020-02-10 20:16:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:56,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:56,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:56,749 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:16:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,852 INFO L93 Difference]: Finished difference Result 588 states and 1740 transitions. [2020-02-10 20:16:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:56,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,854 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:16:56,854 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:16:56,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:16:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 386. [2020-02-10 20:16:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 20:16:56,863 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 20:16:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:56,864 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 20:16:56,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 20:16:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:56,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:56,864 INFO L415 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] [2020-02-10 20:16:56,864 INFO L427 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 672071172, now seen corresponding path program 732 times [2020-02-10 20:16:56,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:56,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099066650] [2020-02-10 20:16:56,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:57,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099066650] [2020-02-10 20:16:57,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:57,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:57,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616196864] [2020-02-10 20:16:57,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:57,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:57,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:57,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:57,154 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:16:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:57,274 INFO L93 Difference]: Finished difference Result 587 states and 1736 transitions. [2020-02-10 20:16:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:57,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:57,276 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:16:57,276 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:16:57,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:16:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-02-10 20:16:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:16:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1324 transitions. [2020-02-10 20:16:57,285 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1324 transitions. Word has length 22 [2020-02-10 20:16:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:57,285 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1324 transitions. [2020-02-10 20:16:57,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1324 transitions. [2020-02-10 20:16:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:57,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:57,286 INFO L415 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] [2020-02-10 20:16:57,286 INFO L427 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1020911148, now seen corresponding path program 733 times [2020-02-10 20:16:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:57,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362963966] [2020-02-10 20:16:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:57,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362963966] [2020-02-10 20:16:57,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:57,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:57,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810238991] [2020-02-10 20:16:57,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:57,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:57,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:57,564 INFO L87 Difference]: Start difference. First operand 381 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:16:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:57,656 INFO L93 Difference]: Finished difference Result 591 states and 1742 transitions. [2020-02-10 20:16:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:57,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:57,658 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:16:57,658 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:16:57,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:16:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2020-02-10 20:16:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:16:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 20:16:57,666 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:57,666 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 20:16:57,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 20:16:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:57,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:57,667 INFO L415 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] [2020-02-10 20:16:57,667 INFO L427 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash -459842656, now seen corresponding path program 734 times [2020-02-10 20:16:57,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:57,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070700088] [2020-02-10 20:16:57,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:57,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070700088] [2020-02-10 20:16:57,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:57,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:57,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066711235] [2020-02-10 20:16:57,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:57,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:57,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:57,957 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:58,034 INFO L93 Difference]: Finished difference Result 584 states and 1727 transitions. [2020-02-10 20:16:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:58,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:58,036 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:16:58,036 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:16:58,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:16:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-02-10 20:16:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:16:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-02-10 20:16:58,045 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-02-10 20:16:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:58,045 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-02-10 20:16:58,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-02-10 20:16:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:58,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:58,046 INFO L415 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] [2020-02-10 20:16:58,046 INFO L427 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1673618294, now seen corresponding path program 735 times [2020-02-10 20:16:58,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:58,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888115832] [2020-02-10 20:16:58,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:58,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888115832] [2020-02-10 20:16:58,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:58,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:58,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10598738] [2020-02-10 20:16:58,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:58,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:58,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:58,372 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:16:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:58,448 INFO L93 Difference]: Finished difference Result 593 states and 1745 transitions. [2020-02-10 20:16:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:58,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:58,449 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:16:58,450 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:16:58,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:16:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 386. [2020-02-10 20:16:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:16:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-02-10 20:16:58,458 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-02-10 20:16:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:58,458 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-02-10 20:16:58,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-02-10 20:16:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:58,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:58,459 INFO L415 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] [2020-02-10 20:16:58,459 INFO L427 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash 711414632, now seen corresponding path program 736 times [2020-02-10 20:16:58,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:58,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11474245] [2020-02-10 20:16:58,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:58,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11474245] [2020-02-10 20:16:58,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:58,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:58,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684993733] [2020-02-10 20:16:58,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:58,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:58,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:58,752 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:16:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:58,856 INFO L93 Difference]: Finished difference Result 587 states and 1731 transitions. [2020-02-10 20:16:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:58,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:58,857 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:16:58,858 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:16:58,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:16:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-02-10 20:16:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:16:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-02-10 20:16:58,866 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-02-10 20:16:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:58,866 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-02-10 20:16:58,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-02-10 20:16:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:58,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:58,874 INFO L415 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] [2020-02-10 20:16:58,874 INFO L427 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:58,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1728340520, now seen corresponding path program 737 times [2020-02-10 20:16:58,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:58,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830353670] [2020-02-10 20:16:58,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:59,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830353670] [2020-02-10 20:16:59,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:59,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712830664] [2020-02-10 20:16:59,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:59,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:59,178 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:16:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:59,267 INFO L93 Difference]: Finished difference Result 577 states and 1712 transitions. [2020-02-10 20:16:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:59,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:59,269 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:16:59,269 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:16:59,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:16:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 384. [2020-02-10 20:16:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:16:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 20:16:59,279 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 20:16:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:59,279 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 20:16:59,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 20:16:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:59,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:59,280 INFO L415 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] [2020-02-10 20:16:59,280 INFO L427 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash -955685818, now seen corresponding path program 738 times [2020-02-10 20:16:59,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:59,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019450725] [2020-02-10 20:16:59,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:59,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019450725] [2020-02-10 20:16:59,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:59,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45914587] [2020-02-10 20:16:59,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:59,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:59,581 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:16:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:59,684 INFO L93 Difference]: Finished difference Result 578 states and 1713 transitions. [2020-02-10 20:16:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:16:59,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:16:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:59,686 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:16:59,686 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:16:59,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:16:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 381. [2020-02-10 20:16:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:16:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1322 transitions. [2020-02-10 20:16:59,695 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1322 transitions. Word has length 22 [2020-02-10 20:16:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:59,695 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1322 transitions. [2020-02-10 20:16:59,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:16:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1322 transitions. [2020-02-10 20:16:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:16:59,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:59,696 INFO L415 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] [2020-02-10 20:16:59,696 INFO L427 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1636866802, now seen corresponding path program 739 times [2020-02-10 20:16:59,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:59,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250207987] [2020-02-10 20:16:59,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:59,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250207987] [2020-02-10 20:16:59,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:16:59,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365517613] [2020-02-10 20:16:59,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:16:59,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:16:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:16:59,993 INFO L87 Difference]: Start difference. First operand 381 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:17:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:00,094 INFO L93 Difference]: Finished difference Result 572 states and 1704 transitions. [2020-02-10 20:17:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:00,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:00,096 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:17:00,096 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:00,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 20:17:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-02-10 20:17:00,104 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-02-10 20:17:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:00,104 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-02-10 20:17:00,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-02-10 20:17:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:00,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:00,105 INFO L415 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] [2020-02-10 20:17:00,105 INFO L427 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 191349792, now seen corresponding path program 740 times [2020-02-10 20:17:00,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:00,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839221426] [2020-02-10 20:17:00,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:00,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839221426] [2020-02-10 20:17:00,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:00,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:00,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21681630] [2020-02-10 20:17:00,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:00,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:00,402 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:17:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:00,481 INFO L93 Difference]: Finished difference Result 570 states and 1699 transitions. [2020-02-10 20:17:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:00,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:00,483 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:17:00,483 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:17:00,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:17:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:17:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-02-10 20:17:00,493 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-02-10 20:17:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:00,493 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-02-10 20:17:00,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-02-10 20:17:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:00,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:00,494 INFO L415 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] [2020-02-10 20:17:00,494 INFO L427 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash 36428948, now seen corresponding path program 741 times [2020-02-10 20:17:00,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:00,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370665427] [2020-02-10 20:17:00,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:00,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370665427] [2020-02-10 20:17:00,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:00,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:00,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940030651] [2020-02-10 20:17:00,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:00,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:00,828 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:17:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:00,927 INFO L93 Difference]: Finished difference Result 574 states and 1708 transitions. [2020-02-10 20:17:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:00,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:00,929 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:17:00,929 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:17:00,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:17:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 20:17:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 20:17:00,939 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:00,939 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 20:17:00,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 20:17:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:00,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:00,940 INFO L415 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] [2020-02-10 20:17:00,940 INFO L427 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 289521700, now seen corresponding path program 742 times [2020-02-10 20:17:00,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:00,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076577998] [2020-02-10 20:17:00,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:01,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076577998] [2020-02-10 20:17:01,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:01,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:01,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907881745] [2020-02-10 20:17:01,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:01,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:01,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:01,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:01,238 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:01,356 INFO L93 Difference]: Finished difference Result 573 states and 1704 transitions. [2020-02-10 20:17:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:01,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:01,358 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:17:01,358 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:01,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 20:17:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-02-10 20:17:01,367 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:01,367 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-02-10 20:17:01,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-02-10 20:17:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:01,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:01,368 INFO L415 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] [2020-02-10 20:17:01,368 INFO L427 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1285441380, now seen corresponding path program 743 times [2020-02-10 20:17:01,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:01,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326839027] [2020-02-10 20:17:01,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:01,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326839027] [2020-02-10 20:17:01,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:01,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:01,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150930089] [2020-02-10 20:17:01,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:01,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:01,666 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:01,740 INFO L93 Difference]: Finished difference Result 569 states and 1696 transitions. [2020-02-10 20:17:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:01,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:01,742 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:17:01,742 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:17:01,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:17:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-02-10 20:17:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 20:17:01,751 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 20:17:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:01,751 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 20:17:01,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 20:17:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:01,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:01,752 INFO L415 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] [2020-02-10 20:17:01,752 INFO L427 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1398584958, now seen corresponding path program 744 times [2020-02-10 20:17:01,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:01,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595469663] [2020-02-10 20:17:01,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595469663] [2020-02-10 20:17:02,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:02,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416550655] [2020-02-10 20:17:02,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:02,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:02,046 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:17:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:02,149 INFO L93 Difference]: Finished difference Result 570 states and 1697 transitions. [2020-02-10 20:17:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:02,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:02,151 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:17:02,151 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:17:02,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:17:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-02-10 20:17:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:17:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1318 transitions. [2020-02-10 20:17:02,166 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1318 transitions. Word has length 22 [2020-02-10 20:17:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:02,167 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1318 transitions. [2020-02-10 20:17:02,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1318 transitions. [2020-02-10 20:17:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:02,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:02,167 INFO L415 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] [2020-02-10 20:17:02,167 INFO L427 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -869784238, now seen corresponding path program 745 times [2020-02-10 20:17:02,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:02,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339305923] [2020-02-10 20:17:02,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339305923] [2020-02-10 20:17:02,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:02,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183621365] [2020-02-10 20:17:02,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:02,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:02,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:02,445 INFO L87 Difference]: Start difference. First operand 379 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:17:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:02,521 INFO L93 Difference]: Finished difference Result 611 states and 1794 transitions. [2020-02-10 20:17:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:02,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:02,522 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:17:02,523 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:17:02,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:17:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2020-02-10 20:17:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-02-10 20:17:02,532 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-02-10 20:17:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:02,532 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-02-10 20:17:02,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-02-10 20:17:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:02,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:02,532 INFO L415 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] [2020-02-10 20:17:02,533 INFO L427 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash 720481648, now seen corresponding path program 746 times [2020-02-10 20:17:02,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:02,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62573421] [2020-02-10 20:17:02,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62573421] [2020-02-10 20:17:02,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:02,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489418833] [2020-02-10 20:17:02,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:02,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:02,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:02,811 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:17:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:02,911 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-02-10 20:17:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:02,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:02,913 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:17:02,913 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:17:02,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:17:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-02-10 20:17:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1333 transitions. [2020-02-10 20:17:02,924 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1333 transitions. Word has length 22 [2020-02-10 20:17:02,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:02,924 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1333 transitions. [2020-02-10 20:17:02,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1333 transitions. [2020-02-10 20:17:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:02,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:02,925 INFO L415 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] [2020-02-10 20:17:02,925 INFO L427 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash 482766082, now seen corresponding path program 747 times [2020-02-10 20:17:02,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:02,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265560571] [2020-02-10 20:17:02,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:03,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265560571] [2020-02-10 20:17:03,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:03,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:03,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670126046] [2020-02-10 20:17:03,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:03,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:03,210 INFO L87 Difference]: Start difference. First operand 384 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:17:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:03,287 INFO L93 Difference]: Finished difference Result 607 states and 1782 transitions. [2020-02-10 20:17:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:03,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:03,289 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:17:03,289 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:17:03,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:17:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 386. [2020-02-10 20:17:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:17:03,305 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:17:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:03,305 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:17:03,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:17:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:03,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:03,305 INFO L415 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] [2020-02-10 20:17:03,306 INFO L427 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1043834574, now seen corresponding path program 748 times [2020-02-10 20:17:03,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:03,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007982082] [2020-02-10 20:17:03,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:03,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007982082] [2020-02-10 20:17:03,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:03,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:03,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854006184] [2020-02-10 20:17:03,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:03,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:03,585 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:17:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:03,670 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-02-10 20:17:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:03,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:03,671 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:17:03,672 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:17:03,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:17:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 384. [2020-02-10 20:17:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 20:17:03,680 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 20:17:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:03,681 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 20:17:03,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 20:17:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:03,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:03,681 INFO L415 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] [2020-02-10 20:17:03,681 INFO L427 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash -711524124, now seen corresponding path program 749 times [2020-02-10 20:17:03,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:03,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352310081] [2020-02-10 20:17:03,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:03,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352310081] [2020-02-10 20:17:03,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:03,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:03,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932543625] [2020-02-10 20:17:03,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:03,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:03,967 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:17:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:04,066 INFO L93 Difference]: Finished difference Result 596 states and 1760 transitions. [2020-02-10 20:17:04,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:04,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,068 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:17:04,068 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:17:04,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:17:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 385. [2020-02-10 20:17:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 20:17:04,076 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 20:17:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,076 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 20:17:04,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 20:17:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:04,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,077 INFO L415 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] [2020-02-10 20:17:04,077 INFO L427 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2137926162, now seen corresponding path program 750 times [2020-02-10 20:17:04,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919946583] [2020-02-10 20:17:04,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:04,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919946583] [2020-02-10 20:17:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:04,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537075149] [2020-02-10 20:17:04,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:04,374 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:17:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:04,458 INFO L93 Difference]: Finished difference Result 594 states and 1755 transitions. [2020-02-10 20:17:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:04,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,460 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:17:04,460 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:17:04,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:17:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 382. [2020-02-10 20:17:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1327 transitions. [2020-02-10 20:17:04,468 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,469 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1327 transitions. [2020-02-10 20:17:04,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1327 transitions. [2020-02-10 20:17:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:04,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,469 INFO L415 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] [2020-02-10 20:17:04,469 INFO L427 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1665130118, now seen corresponding path program 751 times [2020-02-10 20:17:04,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516067010] [2020-02-10 20:17:04,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:04,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516067010] [2020-02-10 20:17:04,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:04,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:04,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162656204] [2020-02-10 20:17:04,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:04,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:04,758 INFO L87 Difference]: Start difference. First operand 382 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:04,833 INFO L93 Difference]: Finished difference Result 627 states and 1834 transitions. [2020-02-10 20:17:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:04,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,835 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:17:04,835 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:17:04,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:17:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 391. [2020-02-10 20:17:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:17:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-02-10 20:17:04,844 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-02-10 20:17:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,844 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-02-10 20:17:04,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-02-10 20:17:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:04,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,845 INFO L415 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] [2020-02-10 20:17:04,845 INFO L427 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1039571292, now seen corresponding path program 752 times [2020-02-10 20:17:04,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131928842] [2020-02-10 20:17:04,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:05,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131928842] [2020-02-10 20:17:05,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:05,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:05,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353813583] [2020-02-10 20:17:05,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:05,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:05,135 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:17:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:05,234 INFO L93 Difference]: Finished difference Result 622 states and 1821 transitions. [2020-02-10 20:17:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:05,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:05,235 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:17:05,235 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:17:05,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:17:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 387. [2020-02-10 20:17:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 20:17:05,245 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 20:17:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:05,245 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 20:17:05,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 20:17:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:05,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:05,245 INFO L415 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] [2020-02-10 20:17:05,246 INFO L427 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1930180982, now seen corresponding path program 753 times [2020-02-10 20:17:05,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:05,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415477820] [2020-02-10 20:17:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:05,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415477820] [2020-02-10 20:17:05,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:05,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:05,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476849456] [2020-02-10 20:17:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:05,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:05,547 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:17:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:05,626 INFO L93 Difference]: Finished difference Result 634 states and 1846 transitions. [2020-02-10 20:17:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:05,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:05,628 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:17:05,628 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:17:05,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:17:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 395. [2020-02-10 20:17:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:17:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1352 transitions. [2020-02-10 20:17:05,636 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1352 transitions. Word has length 22 [2020-02-10 20:17:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:05,637 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1352 transitions. [2020-02-10 20:17:05,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1352 transitions. [2020-02-10 20:17:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:05,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:05,637 INFO L415 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] [2020-02-10 20:17:05,637 INFO L427 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 432609432, now seen corresponding path program 754 times [2020-02-10 20:17:05,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986164095] [2020-02-10 20:17:05,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:05,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986164095] [2020-02-10 20:17:05,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:05,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:05,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758351254] [2020-02-10 20:17:05,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:05,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:05,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:05,926 INFO L87 Difference]: Start difference. First operand 395 states and 1352 transitions. Second operand 9 states. [2020-02-10 20:17:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:06,029 INFO L93 Difference]: Finished difference Result 632 states and 1836 transitions. [2020-02-10 20:17:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:06,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:06,031 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:17:06,031 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:17:06,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:17:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-02-10 20:17:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 20:17:06,041 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 20:17:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:06,041 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 20:17:06,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 20:17:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:06,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:06,042 INFO L415 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] [2020-02-10 20:17:06,042 INFO L427 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash 714884568, now seen corresponding path program 755 times [2020-02-10 20:17:06,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:06,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586856111] [2020-02-10 20:17:06,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:06,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586856111] [2020-02-10 20:17:06,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:06,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:06,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068239142] [2020-02-10 20:17:06,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:06,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:06,362 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:17:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:06,463 INFO L93 Difference]: Finished difference Result 619 states and 1811 transitions. [2020-02-10 20:17:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:06,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:06,465 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:17:06,465 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:17:06,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:17:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 390. [2020-02-10 20:17:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:17:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1339 transitions. [2020-02-10 20:17:06,474 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1339 transitions. Word has length 22 [2020-02-10 20:17:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:06,474 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1339 transitions. [2020-02-10 20:17:06,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1339 transitions. [2020-02-10 20:17:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:06,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:06,475 INFO L415 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] [2020-02-10 20:17:06,475 INFO L427 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash 733318594, now seen corresponding path program 756 times [2020-02-10 20:17:06,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:06,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386619976] [2020-02-10 20:17:06,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:06,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386619976] [2020-02-10 20:17:06,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:06,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:06,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838040182] [2020-02-10 20:17:06,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:06,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:06,771 INFO L87 Difference]: Start difference. First operand 390 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:17:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:06,873 INFO L93 Difference]: Finished difference Result 622 states and 1814 transitions. [2020-02-10 20:17:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:06,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:06,875 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:17:06,875 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:17:06,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:17:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 382. [2020-02-10 20:17:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-02-10 20:17:06,885 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-02-10 20:17:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:06,885 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-02-10 20:17:06,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-02-10 20:17:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:06,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:06,886 INFO L415 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] [2020-02-10 20:17:06,886 INFO L427 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1470725694, now seen corresponding path program 757 times [2020-02-10 20:17:06,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:06,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146033887] [2020-02-10 20:17:06,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:07,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146033887] [2020-02-10 20:17:07,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:07,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:07,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104386126] [2020-02-10 20:17:07,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:07,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:07,161 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:17:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:07,235 INFO L93 Difference]: Finished difference Result 615 states and 1797 transitions. [2020-02-10 20:17:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:07,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:07,237 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:17:07,237 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:17:07,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:17:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 387. [2020-02-10 20:17:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 20:17:07,246 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 20:17:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:07,246 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 20:17:07,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 20:17:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:07,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:07,247 INFO L415 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] [2020-02-10 20:17:07,247 INFO L427 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:07,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:07,247 INFO L82 PathProgramCache]: Analyzing trace with hash -909657202, now seen corresponding path program 758 times [2020-02-10 20:17:07,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:07,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901471112] [2020-02-10 20:17:07,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901471112] [2020-02-10 20:17:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:07,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:07,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170874200] [2020-02-10 20:17:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:07,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:07,523 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:17:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:07,599 INFO L93 Difference]: Finished difference Result 608 states and 1782 transitions. [2020-02-10 20:17:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:07,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:07,601 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:17:07,601 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:17:07,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:17:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 385. [2020-02-10 20:17:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1330 transitions. [2020-02-10 20:17:07,611 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1330 transitions. Word has length 22 [2020-02-10 20:17:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:07,611 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1330 transitions. [2020-02-10 20:17:07,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1330 transitions. [2020-02-10 20:17:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:07,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:07,612 INFO L415 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] [2020-02-10 20:17:07,612 INFO L427 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash -458033162, now seen corresponding path program 759 times [2020-02-10 20:17:07,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:07,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205140607] [2020-02-10 20:17:07,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:07,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205140607] [2020-02-10 20:17:07,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:07,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:07,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392252845] [2020-02-10 20:17:07,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:07,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:07,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:07,927 INFO L87 Difference]: Start difference. First operand 385 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:17:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:08,001 INFO L93 Difference]: Finished difference Result 626 states and 1821 transitions. [2020-02-10 20:17:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:08,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:08,003 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:17:08,003 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:17:08,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:17:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2020-02-10 20:17:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:17:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1343 transitions. [2020-02-10 20:17:08,012 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1343 transitions. Word has length 22 [2020-02-10 20:17:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:08,012 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1343 transitions. [2020-02-10 20:17:08,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1343 transitions. [2020-02-10 20:17:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:08,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:08,012 INFO L415 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] [2020-02-10 20:17:08,013 INFO L427 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash -588003608, now seen corresponding path program 760 times [2020-02-10 20:17:08,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:08,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546141612] [2020-02-10 20:17:08,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:08,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546141612] [2020-02-10 20:17:08,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:08,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:08,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103861594] [2020-02-10 20:17:08,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:08,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:08,305 INFO L87 Difference]: Start difference. First operand 393 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:17:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:08,405 INFO L93 Difference]: Finished difference Result 624 states and 1811 transitions. [2020-02-10 20:17:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:08,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:08,406 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:17:08,407 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:17:08,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:17:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 385. [2020-02-10 20:17:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 20:17:08,416 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:08,416 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 20:17:08,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 20:17:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:08,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:08,416 INFO L415 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] [2020-02-10 20:17:08,417 INFO L427 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash -403310936, now seen corresponding path program 761 times [2020-02-10 20:17:08,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:08,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156821460] [2020-02-10 20:17:08,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:08,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156821460] [2020-02-10 20:17:08,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:08,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:08,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850918390] [2020-02-10 20:17:08,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:08,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:08,698 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:08,776 INFO L93 Difference]: Finished difference Result 605 states and 1774 transitions. [2020-02-10 20:17:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:08,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:08,778 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:17:08,778 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:17:08,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:17:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-02-10 20:17:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 20:17:08,787 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 20:17:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:08,787 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 20:17:08,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 20:17:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:08,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:08,787 INFO L415 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] [2020-02-10 20:17:08,788 INFO L427 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1479022092, now seen corresponding path program 762 times [2020-02-10 20:17:08,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:08,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204470563] [2020-02-10 20:17:08,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:09,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204470563] [2020-02-10 20:17:09,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:09,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:09,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263909823] [2020-02-10 20:17:09,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:09,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:09,077 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:17:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:09,195 INFO L93 Difference]: Finished difference Result 610 states and 1783 transitions. [2020-02-10 20:17:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:09,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:09,196 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:17:09,196 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:17:09,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:17:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 382. [2020-02-10 20:17:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 20:17:09,205 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 20:17:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:09,205 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 20:17:09,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 20:17:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:09,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:09,206 INFO L415 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] [2020-02-10 20:17:09,206 INFO L427 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1187052256, now seen corresponding path program 763 times [2020-02-10 20:17:09,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:09,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793910121] [2020-02-10 20:17:09,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:09,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793910121] [2020-02-10 20:17:09,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:09,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:09,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765373666] [2020-02-10 20:17:09,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:09,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:09,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:09,496 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:17:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:09,598 INFO L93 Difference]: Finished difference Result 591 states and 1746 transitions. [2020-02-10 20:17:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:09,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:09,600 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:17:09,600 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:17:09,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:17:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 20:17:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 20:17:09,609 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:09,609 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 20:17:09,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 20:17:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:09,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:09,610 INFO L415 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] [2020-02-10 20:17:09,610 INFO L427 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash -258464754, now seen corresponding path program 764 times [2020-02-10 20:17:09,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:09,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442715629] [2020-02-10 20:17:09,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:09,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442715629] [2020-02-10 20:17:09,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:09,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:09,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635500317] [2020-02-10 20:17:09,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:09,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:09,901 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:09,980 INFO L93 Difference]: Finished difference Result 589 states and 1741 transitions. [2020-02-10 20:17:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:09,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:09,982 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:17:09,982 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:17:09,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:17:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 383. [2020-02-10 20:17:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1323 transitions. [2020-02-10 20:17:09,992 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:09,992 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1323 transitions. [2020-02-10 20:17:09,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1323 transitions. [2020-02-10 20:17:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:09,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:09,993 INFO L415 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] [2020-02-10 20:17:09,993 INFO L427 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2095222508, now seen corresponding path program 765 times [2020-02-10 20:17:09,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:09,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546985370] [2020-02-10 20:17:09,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:10,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546985370] [2020-02-10 20:17:10,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:10,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:10,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393910553] [2020-02-10 20:17:10,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:10,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:10,287 INFO L87 Difference]: Start difference. First operand 383 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:10,388 INFO L93 Difference]: Finished difference Result 598 states and 1761 transitions. [2020-02-10 20:17:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:10,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:10,390 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:17:10,390 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:17:10,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:17:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 386. [2020-02-10 20:17:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 20:17:10,399 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 20:17:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:10,399 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 20:17:10,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 20:17:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:10,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:10,400 INFO L415 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] [2020-02-10 20:17:10,400 INFO L427 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -709187378, now seen corresponding path program 766 times [2020-02-10 20:17:10,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:10,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357026046] [2020-02-10 20:17:10,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:10,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357026046] [2020-02-10 20:17:10,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:10,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:10,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049191879] [2020-02-10 20:17:10,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:10,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:10,681 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:17:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:10,782 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-02-10 20:17:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:10,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:10,784 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:17:10,784 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:17:10,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:17:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 383. [2020-02-10 20:17:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-02-10 20:17:10,792 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-02-10 20:17:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:10,793 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-02-10 20:17:10,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-02-10 20:17:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:10,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:10,793 INFO L415 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] [2020-02-10 20:17:10,793 INFO L427 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash -846210076, now seen corresponding path program 767 times [2020-02-10 20:17:10,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:10,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672501970] [2020-02-10 20:17:10,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:11,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672501970] [2020-02-10 20:17:11,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:11,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:11,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70971883] [2020-02-10 20:17:11,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:11,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:11,074 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:17:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:11,155 INFO L93 Difference]: Finished difference Result 592 states and 1746 transitions. [2020-02-10 20:17:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:11,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:11,157 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:17:11,157 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:17:11,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:17:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 20:17:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:17:11,167 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:11,167 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:17:11,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:17:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:11,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:11,168 INFO L415 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] [2020-02-10 20:17:11,168 INFO L427 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1921921232, now seen corresponding path program 768 times [2020-02-10 20:17:11,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:11,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355498111] [2020-02-10 20:17:11,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:11,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355498111] [2020-02-10 20:17:11,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:11,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:11,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700727502] [2020-02-10 20:17:11,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:11,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:11,450 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:11,552 INFO L93 Difference]: Finished difference Result 597 states and 1755 transitions. [2020-02-10 20:17:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:11,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:11,553 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:17:11,554 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:17:11,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:17:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 379. [2020-02-10 20:17:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:17:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1315 transitions. [2020-02-10 20:17:11,562 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:11,562 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1315 transitions. [2020-02-10 20:17:11,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1315 transitions. [2020-02-10 20:17:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:11,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:11,563 INFO L415 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] [2020-02-10 20:17:11,563 INFO L427 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1504425582, now seen corresponding path program 769 times [2020-02-10 20:17:11,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:11,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200613303] [2020-02-10 20:17:11,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:11,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200613303] [2020-02-10 20:17:11,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:11,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:11,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782168732] [2020-02-10 20:17:11,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:11,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:11,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:11,842 INFO L87 Difference]: Start difference. First operand 379 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:11,925 INFO L93 Difference]: Finished difference Result 623 states and 1831 transitions. [2020-02-10 20:17:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:11,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:11,927 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:17:11,927 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:17:11,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:17:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 390. [2020-02-10 20:17:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:17:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-02-10 20:17:11,936 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-02-10 20:17:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:11,936 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-02-10 20:17:11,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-02-10 20:17:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:11,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:11,937 INFO L415 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] [2020-02-10 20:17:11,937 INFO L427 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:11,937 INFO L82 PathProgramCache]: Analyzing trace with hash 85840304, now seen corresponding path program 770 times [2020-02-10 20:17:11,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:11,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741151643] [2020-02-10 20:17:11,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:12,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741151643] [2020-02-10 20:17:12,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:12,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:12,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632809530] [2020-02-10 20:17:12,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:12,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:12,221 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:17:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:12,320 INFO L93 Difference]: Finished difference Result 618 states and 1818 transitions. [2020-02-10 20:17:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:12,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:12,322 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:17:12,322 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:17:12,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:17:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2020-02-10 20:17:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 20:17:12,331 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 20:17:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:12,331 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 20:17:12,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 20:17:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:12,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:12,332 INFO L415 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] [2020-02-10 20:17:12,332 INFO L427 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1403513410, now seen corresponding path program 771 times [2020-02-10 20:17:12,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:12,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157419590] [2020-02-10 20:17:12,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:12,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157419590] [2020-02-10 20:17:12,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:12,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:12,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909411086] [2020-02-10 20:17:12,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:12,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:12,620 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:17:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:12,705 INFO L93 Difference]: Finished difference Result 621 states and 1823 transitions. [2020-02-10 20:17:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:12,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:12,706 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:17:12,706 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:17:12,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:17:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 389. [2020-02-10 20:17:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:17:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 20:17:12,716 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 20:17:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:12,716 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 20:17:12,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 20:17:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:12,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:12,717 INFO L415 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] [2020-02-10 20:17:12,717 INFO L427 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1276877036, now seen corresponding path program 772 times [2020-02-10 20:17:12,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:12,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156082155] [2020-02-10 20:17:12,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:13,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156082155] [2020-02-10 20:17:13,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:13,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139878372] [2020-02-10 20:17:13,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:13,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:13,011 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:17:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:13,115 INFO L93 Difference]: Finished difference Result 615 states and 1809 transitions. [2020-02-10 20:17:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:13,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:13,117 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:17:13,117 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:17:13,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:17:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 20:17:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 20:17:13,127 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 20:17:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:13,127 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 20:17:13,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 20:17:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:13,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:13,128 INFO L415 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] [2020-02-10 20:17:13,128 INFO L427 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash 603072092, now seen corresponding path program 773 times [2020-02-10 20:17:13,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:13,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884805401] [2020-02-10 20:17:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:13,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884805401] [2020-02-10 20:17:13,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:13,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863565867] [2020-02-10 20:17:13,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:13,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:13,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:13,407 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:17:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:13,507 INFO L93 Difference]: Finished difference Result 610 states and 1800 transitions. [2020-02-10 20:17:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:13,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:13,509 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:17:13,509 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:17:13,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:17:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-02-10 20:17:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:17:13,518 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:17:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:13,518 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:17:13,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:17:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:13,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:13,519 INFO L415 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] [2020-02-10 20:17:13,519 INFO L427 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1945004880, now seen corresponding path program 774 times [2020-02-10 20:17:13,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:13,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33051980] [2020-02-10 20:17:13,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:13,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33051980] [2020-02-10 20:17:13,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:13,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014346005] [2020-02-10 20:17:13,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:13,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:13,801 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:17:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:13,902 INFO L93 Difference]: Finished difference Result 609 states and 1796 transitions. [2020-02-10 20:17:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:13,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:13,903 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:17:13,903 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:17:13,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:17:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 383. [2020-02-10 20:17:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-02-10 20:17:13,912 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-02-10 20:17:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:13,912 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-02-10 20:17:13,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-02-10 20:17:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:13,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:13,913 INFO L415 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] [2020-02-10 20:17:13,913 INFO L427 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1452974500, now seen corresponding path program 775 times [2020-02-10 20:17:13,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:13,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079173257] [2020-02-10 20:17:13,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:14,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079173257] [2020-02-10 20:17:14,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:14,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:14,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947528025] [2020-02-10 20:17:14,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:14,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:14,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:14,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:14,211 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:17:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:14,287 INFO L93 Difference]: Finished difference Result 635 states and 1858 transitions. [2020-02-10 20:17:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:14,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:14,289 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:17:14,289 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:17:14,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:17:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 392. [2020-02-10 20:17:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:17:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-02-10 20:17:14,299 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-02-10 20:17:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:14,299 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-02-10 20:17:14,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-02-10 20:17:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:14,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:14,300 INFO L415 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] [2020-02-10 20:17:14,300 INFO L427 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1251726910, now seen corresponding path program 776 times [2020-02-10 20:17:14,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:14,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365813962] [2020-02-10 20:17:14,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:14,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365813962] [2020-02-10 20:17:14,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:14,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:14,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718530972] [2020-02-10 20:17:14,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:14,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:14,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:14,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:14,591 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:17:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:14,695 INFO L93 Difference]: Finished difference Result 630 states and 1845 transitions. [2020-02-10 20:17:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:14,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:14,696 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:17:14,697 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:17:14,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:17:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 388. [2020-02-10 20:17:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1340 transitions. [2020-02-10 20:17:14,706 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1340 transitions. Word has length 22 [2020-02-10 20:17:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:14,706 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1340 transitions. [2020-02-10 20:17:14,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1340 transitions. [2020-02-10 20:17:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:14,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:14,707 INFO L415 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] [2020-02-10 20:17:14,707 INFO L427 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1718025364, now seen corresponding path program 777 times [2020-02-10 20:17:14,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:14,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000683123] [2020-02-10 20:17:14,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:15,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000683123] [2020-02-10 20:17:15,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:15,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:15,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716818726] [2020-02-10 20:17:15,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:15,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:15,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:15,010 INFO L87 Difference]: Start difference. First operand 388 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:17:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:15,088 INFO L93 Difference]: Finished difference Result 642 states and 1870 transitions. [2020-02-10 20:17:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:15,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:15,090 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:17:15,090 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:17:15,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:17:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 396. [2020-02-10 20:17:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:17:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1353 transitions. [2020-02-10 20:17:15,099 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1353 transitions. Word has length 22 [2020-02-10 20:17:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:15,100 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1353 transitions. [2020-02-10 20:17:15,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1353 transitions. [2020-02-10 20:17:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:15,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:15,100 INFO L415 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] [2020-02-10 20:17:15,100 INFO L427 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 220453814, now seen corresponding path program 778 times [2020-02-10 20:17:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:15,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394443096] [2020-02-10 20:17:15,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:15,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394443096] [2020-02-10 20:17:15,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:15,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:15,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345540748] [2020-02-10 20:17:15,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:15,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:15,396 INFO L87 Difference]: Start difference. First operand 396 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:17:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:15,502 INFO L93 Difference]: Finished difference Result 640 states and 1860 transitions. [2020-02-10 20:17:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:15,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:15,504 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:17:15,504 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:17:15,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:17:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 388. [2020-02-10 20:17:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1335 transitions. [2020-02-10 20:17:15,518 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1335 transitions. Word has length 22 [2020-02-10 20:17:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:15,518 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1335 transitions. [2020-02-10 20:17:15,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1335 transitions. [2020-02-10 20:17:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:15,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:15,519 INFO L415 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] [2020-02-10 20:17:15,519 INFO L427 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash 502728950, now seen corresponding path program 779 times [2020-02-10 20:17:15,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:15,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028281356] [2020-02-10 20:17:15,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:15,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028281356] [2020-02-10 20:17:15,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:15,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:15,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358866492] [2020-02-10 20:17:15,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:15,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:15,809 INFO L87 Difference]: Start difference. First operand 388 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:17:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:15,916 INFO L93 Difference]: Finished difference Result 627 states and 1835 transitions. [2020-02-10 20:17:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:15,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:15,918 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:17:15,918 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:17:15,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:17:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 391. [2020-02-10 20:17:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:17:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1340 transitions. [2020-02-10 20:17:15,927 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1340 transitions. Word has length 22 [2020-02-10 20:17:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:15,927 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1340 transitions. [2020-02-10 20:17:15,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1340 transitions. [2020-02-10 20:17:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:15,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:15,928 INFO L415 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] [2020-02-10 20:17:15,928 INFO L427 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash 521162976, now seen corresponding path program 780 times [2020-02-10 20:17:15,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:15,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742403942] [2020-02-10 20:17:15,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:16,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742403942] [2020-02-10 20:17:16,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:16,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:16,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000268613] [2020-02-10 20:17:16,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:16,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:16,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:16,222 INFO L87 Difference]: Start difference. First operand 391 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:17:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:16,329 INFO L93 Difference]: Finished difference Result 630 states and 1838 transitions. [2020-02-10 20:17:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:16,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:16,331 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:17:16,331 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:17:16,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:17:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 383. [2020-02-10 20:17:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 20:17:16,341 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 20:17:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:16,341 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 20:17:16,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 20:17:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:16,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:16,342 INFO L415 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] [2020-02-10 20:17:16,342 INFO L427 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1905105740, now seen corresponding path program 781 times [2020-02-10 20:17:16,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:16,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056614698] [2020-02-10 20:17:16,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:16,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056614698] [2020-02-10 20:17:16,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:16,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:16,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506992139] [2020-02-10 20:17:16,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:16,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:16,633 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:17:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:16,713 INFO L93 Difference]: Finished difference Result 629 states and 1837 transitions. [2020-02-10 20:17:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:16,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:16,714 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:17:16,714 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:17:16,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:17:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 390. [2020-02-10 20:17:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:17:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1340 transitions. [2020-02-10 20:17:16,724 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1340 transitions. Word has length 22 [2020-02-10 20:17:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:16,724 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1340 transitions. [2020-02-10 20:17:16,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1340 transitions. [2020-02-10 20:17:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:16,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:16,725 INFO L415 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] [2020-02-10 20:17:16,725 INFO L427 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1778469366, now seen corresponding path program 782 times [2020-02-10 20:17:16,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:16,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135902706] [2020-02-10 20:17:16,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135902706] [2020-02-10 20:17:17,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:17,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659483599] [2020-02-10 20:17:17,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:17,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:17,014 INFO L87 Difference]: Start difference. First operand 390 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:17:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:17,118 INFO L93 Difference]: Finished difference Result 623 states and 1823 transitions. [2020-02-10 20:17:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:17,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:17,120 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:17:17,120 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:17:17,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:17:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-02-10 20:17:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-02-10 20:17:17,129 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-02-10 20:17:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:17,130 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-02-10 20:17:17,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-02-10 20:17:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:17,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:17,130 INFO L415 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] [2020-02-10 20:17:17,130 INFO L427 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash -296790558, now seen corresponding path program 783 times [2020-02-10 20:17:17,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:17,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172318629] [2020-02-10 20:17:17,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172318629] [2020-02-10 20:17:17,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:17,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378300954] [2020-02-10 20:17:17,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:17,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:17,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:17,427 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:17:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:17,515 INFO L93 Difference]: Finished difference Result 638 states and 1855 transitions. [2020-02-10 20:17:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:17,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:17,516 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:17:17,516 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:17:17,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:17:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 395. [2020-02-10 20:17:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:17:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1346 transitions. [2020-02-10 20:17:17,524 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1346 transitions. Word has length 22 [2020-02-10 20:17:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:17,524 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1346 transitions. [2020-02-10 20:17:17,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1346 transitions. [2020-02-10 20:17:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:17,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:17,525 INFO L415 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] [2020-02-10 20:17:17,525 INFO L427 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -946236150, now seen corresponding path program 784 times [2020-02-10 20:17:17,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:17,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530635155] [2020-02-10 20:17:17,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530635155] [2020-02-10 20:17:17,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:17,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193495167] [2020-02-10 20:17:17,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:17,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:17,813 INFO L87 Difference]: Start difference. First operand 395 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:17:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:17,929 INFO L93 Difference]: Finished difference Result 636 states and 1845 transitions. [2020-02-10 20:17:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:17,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:17,931 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:17:17,931 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:17:17,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:17:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 387. [2020-02-10 20:17:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1329 transitions. [2020-02-10 20:17:17,940 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1329 transitions. Word has length 22 [2020-02-10 20:17:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:17,940 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1329 transitions. [2020-02-10 20:17:17,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1329 transitions. [2020-02-10 20:17:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:17,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:17,941 INFO L415 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] [2020-02-10 20:17:17,941 INFO L427 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1978642352, now seen corresponding path program 785 times [2020-02-10 20:17:17,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:17,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389917471] [2020-02-10 20:17:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:18,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389917471] [2020-02-10 20:17:18,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:18,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:18,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359248371] [2020-02-10 20:17:18,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:18,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:18,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:18,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:18,225 INFO L87 Difference]: Start difference. First operand 387 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:17:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:18,342 INFO L93 Difference]: Finished difference Result 620 states and 1814 transitions. [2020-02-10 20:17:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:18,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:18,344 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:17:18,344 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:17:18,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:17:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 389. [2020-02-10 20:17:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:17:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1332 transitions. [2020-02-10 20:17:18,354 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1332 transitions. Word has length 22 [2020-02-10 20:17:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:18,354 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1332 transitions. [2020-02-10 20:17:18,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1332 transitions. [2020-02-10 20:17:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:18,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:18,355 INFO L415 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] [2020-02-10 20:17:18,355 INFO L427 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1060692162, now seen corresponding path program 786 times [2020-02-10 20:17:18,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:18,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040210713] [2020-02-10 20:17:18,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:18,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040210713] [2020-02-10 20:17:18,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:18,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811716544] [2020-02-10 20:17:18,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:18,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:18,633 INFO L87 Difference]: Start difference. First operand 389 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:17:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:18,749 INFO L93 Difference]: Finished difference Result 624 states and 1820 transitions. [2020-02-10 20:17:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:18,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:18,751 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:17:18,751 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:17:18,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:17:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 383. [2020-02-10 20:17:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 20:17:18,760 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 20:17:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:18,761 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 20:17:18,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 20:17:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:18,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:18,761 INFO L415 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] [2020-02-10 20:17:18,761 INFO L427 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1195571350, now seen corresponding path program 787 times [2020-02-10 20:17:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:18,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706778580] [2020-02-10 20:17:18,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:19,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706778580] [2020-02-10 20:17:19,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:19,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:19,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360997134] [2020-02-10 20:17:19,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:19,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:19,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:19,045 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:17:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:19,152 INFO L93 Difference]: Finished difference Result 605 states and 1785 transitions. [2020-02-10 20:17:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:19,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:19,154 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:17:19,154 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:17:19,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:17:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 20:17:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-02-10 20:17:19,163 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-02-10 20:17:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:19,163 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-02-10 20:17:19,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-02-10 20:17:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:19,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:19,164 INFO L415 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] [2020-02-10 20:17:19,164 INFO L427 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:19,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1757463158, now seen corresponding path program 788 times [2020-02-10 20:17:19,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:19,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164238835] [2020-02-10 20:17:19,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:19,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164238835] [2020-02-10 20:17:19,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:19,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:19,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691347754] [2020-02-10 20:17:19,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:19,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:19,455 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:17:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:19,560 INFO L93 Difference]: Finished difference Result 604 states and 1781 transitions. [2020-02-10 20:17:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:19,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:19,562 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:17:19,562 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:17:19,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:17:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 385. [2020-02-10 20:17:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-02-10 20:17:19,572 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:19,572 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-02-10 20:17:19,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-02-10 20:17:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:19,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:19,573 INFO L415 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] [2020-02-10 20:17:19,573 INFO L427 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1491080764, now seen corresponding path program 789 times [2020-02-10 20:17:19,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:19,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657631216] [2020-02-10 20:17:19,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:19,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657631216] [2020-02-10 20:17:19,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:19,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:19,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878680316] [2020-02-10 20:17:19,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:19,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:19,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:19,862 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:19,974 INFO L93 Difference]: Finished difference Result 610 states and 1794 transitions. [2020-02-10 20:17:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:19,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:19,976 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:17:19,976 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:17:19,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:17:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-02-10 20:17:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1330 transitions. [2020-02-10 20:17:19,986 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1330 transitions. Word has length 22 [2020-02-10 20:17:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:19,986 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1330 transitions. [2020-02-10 20:17:19,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1330 transitions. [2020-02-10 20:17:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:19,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:19,987 INFO L415 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] [2020-02-10 20:17:19,987 INFO L427 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash -624520780, now seen corresponding path program 790 times [2020-02-10 20:17:19,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:19,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790963415] [2020-02-10 20:17:19,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:20,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790963415] [2020-02-10 20:17:20,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:20,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:20,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067324410] [2020-02-10 20:17:20,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:20,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:20,268 INFO L87 Difference]: Start difference. First operand 388 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:17:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:20,376 INFO L93 Difference]: Finished difference Result 613 states and 1797 transitions. [2020-02-10 20:17:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:20,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:20,378 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:17:20,378 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:17:20,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:17:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-02-10 20:17:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 20:17:20,387 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:20,387 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 20:17:20,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 20:17:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:20,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:20,388 INFO L415 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] [2020-02-10 20:17:20,388 INFO L427 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1222233356, now seen corresponding path program 791 times [2020-02-10 20:17:20,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:20,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357365532] [2020-02-10 20:17:20,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:20,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357365532] [2020-02-10 20:17:20,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:20,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:20,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884028981] [2020-02-10 20:17:20,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:20,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:20,674 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:20,775 INFO L93 Difference]: Finished difference Result 607 states and 1785 transitions. [2020-02-10 20:17:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:20,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:20,777 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:17:20,777 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:17:20,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:17:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 387. [2020-02-10 20:17:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-02-10 20:17:20,786 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-02-10 20:17:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:20,786 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-02-10 20:17:20,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-02-10 20:17:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:20,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:20,787 INFO L415 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] [2020-02-10 20:17:20,787 INFO L427 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2140183546, now seen corresponding path program 792 times [2020-02-10 20:17:20,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:20,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21330035] [2020-02-10 20:17:20,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:21,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21330035] [2020-02-10 20:17:21,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:21,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:21,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658705457] [2020-02-10 20:17:21,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:21,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:21,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:21,066 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:17:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:21,172 INFO L93 Difference]: Finished difference Result 611 states and 1791 transitions. [2020-02-10 20:17:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:21,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:21,174 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:17:21,174 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:17:21,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:17:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 379. [2020-02-10 20:17:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:17:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1312 transitions. [2020-02-10 20:17:21,183 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1312 transitions. Word has length 22 [2020-02-10 20:17:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:21,183 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1312 transitions. [2020-02-10 20:17:21,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1312 transitions. [2020-02-10 20:17:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:21,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:21,184 INFO L415 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] [2020-02-10 20:17:21,184 INFO L427 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1449614060, now seen corresponding path program 793 times [2020-02-10 20:17:21,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:21,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744014478] [2020-02-10 20:17:21,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:21,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744014478] [2020-02-10 20:17:21,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:21,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:21,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123018968] [2020-02-10 20:17:21,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:21,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:21,472 INFO L87 Difference]: Start difference. First operand 379 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:17:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:21,552 INFO L93 Difference]: Finished difference Result 601 states and 1761 transitions. [2020-02-10 20:17:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:21,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:21,553 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:17:21,554 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:17:21,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:17:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-02-10 20:17:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-02-10 20:17:21,563 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-02-10 20:17:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:21,563 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-02-10 20:17:21,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-02-10 20:17:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:21,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:21,563 INFO L415 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] [2020-02-10 20:17:21,564 INFO L427 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -888545568, now seen corresponding path program 794 times [2020-02-10 20:17:21,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:21,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078063264] [2020-02-10 20:17:21,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:21,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078063264] [2020-02-10 20:17:21,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:21,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:21,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755117160] [2020-02-10 20:17:21,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:21,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:21,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:21,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:21,854 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:17:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:21,931 INFO L93 Difference]: Finished difference Result 594 states and 1746 transitions. [2020-02-10 20:17:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:21,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:21,933 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:17:21,933 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:17:21,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:17:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 20:17:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 20:17:21,942 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:21,942 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 20:17:21,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 20:17:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:21,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:21,943 INFO L415 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] [2020-02-10 20:17:21,943 INFO L427 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1244915382, now seen corresponding path program 795 times [2020-02-10 20:17:21,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:21,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53019456] [2020-02-10 20:17:21,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:22,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53019456] [2020-02-10 20:17:22,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:22,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:22,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396304884] [2020-02-10 20:17:22,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:22,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:22,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:22,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:22,245 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:22,330 INFO L93 Difference]: Finished difference Result 603 states and 1764 transitions. [2020-02-10 20:17:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:22,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:22,332 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:17:22,332 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:17:22,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:17:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 387. [2020-02-10 20:17:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 20:17:22,340 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 20:17:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:22,340 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 20:17:22,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 20:17:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:22,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:22,341 INFO L415 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] [2020-02-10 20:17:22,341 INFO L427 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 282711720, now seen corresponding path program 796 times [2020-02-10 20:17:22,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:22,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129375924] [2020-02-10 20:17:22,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:22,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129375924] [2020-02-10 20:17:22,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:22,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:22,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682827898] [2020-02-10 20:17:22,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:22,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:22,644 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:17:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:22,746 INFO L93 Difference]: Finished difference Result 597 states and 1750 transitions. [2020-02-10 20:17:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:22,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:22,747 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:17:22,748 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:17:22,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:17:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 20:17:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 20:17:22,757 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:22,757 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 20:17:22,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 20:17:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:22,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:22,758 INFO L415 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] [2020-02-10 20:17:22,758 INFO L427 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1299637608, now seen corresponding path program 797 times [2020-02-10 20:17:22,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:22,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143877158] [2020-02-10 20:17:22,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:23,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143877158] [2020-02-10 20:17:23,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:23,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:23,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540806010] [2020-02-10 20:17:23,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:23,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:23,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:23,060 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:23,136 INFO L93 Difference]: Finished difference Result 587 states and 1731 transitions. [2020-02-10 20:17:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:23,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:23,138 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:17:23,138 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:17:23,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:17:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-02-10 20:17:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-02-10 20:17:23,148 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-02-10 20:17:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,148 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-02-10 20:17:23,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-02-10 20:17:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:23,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,148 INFO L415 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] [2020-02-10 20:17:23,148 INFO L427 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1384388730, now seen corresponding path program 798 times [2020-02-10 20:17:23,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114260962] [2020-02-10 20:17:23,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:23,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114260962] [2020-02-10 20:17:23,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:23,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:23,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679767553] [2020-02-10 20:17:23,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:23,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:23,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:23,450 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:17:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:23,552 INFO L93 Difference]: Finished difference Result 588 states and 1732 transitions. [2020-02-10 20:17:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:23,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:23,554 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:17:23,554 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:17:23,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:17:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 20:17:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 20:17:23,569 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 20:17:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,569 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 20:17:23,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 20:17:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:23,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,570 INFO L415 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] [2020-02-10 20:17:23,570 INFO L427 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2046950718, now seen corresponding path program 799 times [2020-02-10 20:17:23,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932222228] [2020-02-10 20:17:23,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:23,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932222228] [2020-02-10 20:17:23,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:23,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:23,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467048635] [2020-02-10 20:17:23,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:23,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:23,842 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:17:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:23,920 INFO L93 Difference]: Finished difference Result 611 states and 1782 transitions. [2020-02-10 20:17:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:23,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:23,922 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:17:23,922 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:17:23,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:17:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2020-02-10 20:17:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 20:17:23,931 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 20:17:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,932 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 20:17:23,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 20:17:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:23,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,932 INFO L415 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] [2020-02-10 20:17:23,932 INFO L427 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1485882226, now seen corresponding path program 800 times [2020-02-10 20:17:23,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115980667] [2020-02-10 20:17:23,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:24,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115980667] [2020-02-10 20:17:24,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:24,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:24,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753630369] [2020-02-10 20:17:24,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:24,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:24,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:24,202 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:17:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:24,279 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-02-10 20:17:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:24,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:24,281 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:17:24,281 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:17:24,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:17:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 385. [2020-02-10 20:17:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 20:17:24,290 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:24,290 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 20:17:24,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 20:17:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:24,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:24,291 INFO L415 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] [2020-02-10 20:17:24,291 INFO L427 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1034258186, now seen corresponding path program 801 times [2020-02-10 20:17:24,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:24,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229830383] [2020-02-10 20:17:24,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:24,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229830383] [2020-02-10 20:17:24,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:24,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:24,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490060656] [2020-02-10 20:17:24,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:24,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:24,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:24,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:24,578 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:24,658 INFO L93 Difference]: Finished difference Result 622 states and 1806 transitions. [2020-02-10 20:17:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:24,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:24,660 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:17:24,660 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:17:24,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:17:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 393. [2020-02-10 20:17:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:17:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1340 transitions. [2020-02-10 20:17:24,670 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1340 transitions. Word has length 22 [2020-02-10 20:17:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:24,670 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1340 transitions. [2020-02-10 20:17:24,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1340 transitions. [2020-02-10 20:17:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:24,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:24,670 INFO L415 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] [2020-02-10 20:17:24,671 INFO L427 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1164228632, now seen corresponding path program 802 times [2020-02-10 20:17:24,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:24,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906409813] [2020-02-10 20:17:24,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:24,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906409813] [2020-02-10 20:17:24,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:24,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199956447] [2020-02-10 20:17:24,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:24,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:24,949 INFO L87 Difference]: Start difference. First operand 393 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:17:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:25,064 INFO L93 Difference]: Finished difference Result 620 states and 1796 transitions. [2020-02-10 20:17:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:25,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:25,065 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:17:25,066 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:17:25,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:17:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 385. [2020-02-10 20:17:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 20:17:25,075 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 20:17:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:25,075 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 20:17:25,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 20:17:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:25,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:25,076 INFO L415 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] [2020-02-10 20:17:25,076 INFO L427 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash -979535960, now seen corresponding path program 803 times [2020-02-10 20:17:25,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:25,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291477184] [2020-02-10 20:17:25,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:25,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291477184] [2020-02-10 20:17:25,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:25,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:25,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480315903] [2020-02-10 20:17:25,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:25,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:25,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:25,349 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:17:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:25,428 INFO L93 Difference]: Finished difference Result 601 states and 1759 transitions. [2020-02-10 20:17:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:25,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:25,430 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:17:25,430 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:17:25,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:17:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 386. [2020-02-10 20:17:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 20:17:25,439 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:25,440 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 20:17:25,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 20:17:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:25,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:25,440 INFO L415 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] [2020-02-10 20:17:25,440 INFO L427 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2055247116, now seen corresponding path program 804 times [2020-02-10 20:17:25,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:25,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958431712] [2020-02-10 20:17:25,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:25,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958431712] [2020-02-10 20:17:25,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:25,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:25,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931300531] [2020-02-10 20:17:25,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:25,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:25,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:25,699 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:25,808 INFO L93 Difference]: Finished difference Result 606 states and 1768 transitions. [2020-02-10 20:17:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:25,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:25,810 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:17:25,810 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:17:25,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:17:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 382. [2020-02-10 20:17:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-02-10 20:17:25,820 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-02-10 20:17:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:25,820 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-02-10 20:17:25,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-02-10 20:17:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:25,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:25,821 INFO L415 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] [2020-02-10 20:17:25,821 INFO L427 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1721354494, now seen corresponding path program 805 times [2020-02-10 20:17:25,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:25,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444377741] [2020-02-10 20:17:25,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:26,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444377741] [2020-02-10 20:17:26,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:26,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560633572] [2020-02-10 20:17:26,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:26,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:26,124 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:17:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:26,200 INFO L93 Difference]: Finished difference Result 617 states and 1796 transitions. [2020-02-10 20:17:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:26,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:26,202 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:17:26,202 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:17:26,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:17:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 389. [2020-02-10 20:17:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:17:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1334 transitions. [2020-02-10 20:17:26,211 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1334 transitions. Word has length 22 [2020-02-10 20:17:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:26,211 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1334 transitions. [2020-02-10 20:17:26,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1334 transitions. [2020-02-10 20:17:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:26,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:26,212 INFO L415 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] [2020-02-10 20:17:26,212 INFO L427 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1611409140, now seen corresponding path program 806 times [2020-02-10 20:17:26,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:26,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177751279] [2020-02-10 20:17:26,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:26,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177751279] [2020-02-10 20:17:26,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:26,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105954761] [2020-02-10 20:17:26,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:26,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:26,510 INFO L87 Difference]: Start difference. First operand 389 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:17:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:26,611 INFO L93 Difference]: Finished difference Result 611 states and 1782 transitions. [2020-02-10 20:17:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:26,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:26,613 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:17:26,613 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:17:26,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:17:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-02-10 20:17:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1327 transitions. [2020-02-10 20:17:26,622 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:26,622 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1327 transitions. [2020-02-10 20:17:26,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1327 transitions. [2020-02-10 20:17:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:26,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:26,623 INFO L415 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] [2020-02-10 20:17:26,623 INFO L427 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash 891775892, now seen corresponding path program 807 times [2020-02-10 20:17:26,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:26,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829157770] [2020-02-10 20:17:26,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:26,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829157770] [2020-02-10 20:17:26,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:26,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513549480] [2020-02-10 20:17:26,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:26,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:26,918 INFO L87 Difference]: Start difference. First operand 386 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:26,998 INFO L93 Difference]: Finished difference Result 626 states and 1814 transitions. [2020-02-10 20:17:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:26,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,000 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:17:27,000 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:17:27,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:17:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-02-10 20:17:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:17:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1340 transitions. [2020-02-10 20:17:27,010 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1340 transitions. Word has length 22 [2020-02-10 20:17:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:27,010 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1340 transitions. [2020-02-10 20:17:27,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1340 transitions. [2020-02-10 20:17:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:27,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:27,010 INFO L415 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] [2020-02-10 20:17:27,010 INFO L427 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash 761805446, now seen corresponding path program 808 times [2020-02-10 20:17:27,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:27,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277494761] [2020-02-10 20:17:27,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:27,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277494761] [2020-02-10 20:17:27,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:27,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:27,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138675788] [2020-02-10 20:17:27,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:27,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:27,304 INFO L87 Difference]: Start difference. First operand 394 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:17:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:27,408 INFO L93 Difference]: Finished difference Result 624 states and 1804 transitions. [2020-02-10 20:17:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:27,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,410 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:17:27,410 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:17:27,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:17:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 20:17:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 20:17:27,418 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:27,419 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 20:17:27,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 20:17:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:27,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:27,419 INFO L415 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] [2020-02-10 20:17:27,419 INFO L427 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2586096, now seen corresponding path program 809 times [2020-02-10 20:17:27,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:27,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645848830] [2020-02-10 20:17:27,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:27,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645848830] [2020-02-10 20:17:27,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:27,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:27,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605986544] [2020-02-10 20:17:27,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:27,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:27,696 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:27,798 INFO L93 Difference]: Finished difference Result 608 states and 1773 transitions. [2020-02-10 20:17:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:27,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,800 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:17:27,800 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:17:27,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:17:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 388. [2020-02-10 20:17:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-02-10 20:17:27,809 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-02-10 20:17:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:27,809 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-02-10 20:17:27,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-02-10 20:17:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:27,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:27,810 INFO L415 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] [2020-02-10 20:17:27,810 INFO L427 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash -920536286, now seen corresponding path program 810 times [2020-02-10 20:17:27,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:27,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477554170] [2020-02-10 20:17:27,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:28,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477554170] [2020-02-10 20:17:28,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:28,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:28,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331869178] [2020-02-10 20:17:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:28,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:28,086 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:17:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:28,197 INFO L93 Difference]: Finished difference Result 612 states and 1779 transitions. [2020-02-10 20:17:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:28,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:28,199 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:17:28,199 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:17:28,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:17:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 382. [2020-02-10 20:17:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:17:28,209 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:28,209 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:17:28,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:17:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:28,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:28,210 INFO L415 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] [2020-02-10 20:17:28,210 INFO L427 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash -183497330, now seen corresponding path program 811 times [2020-02-10 20:17:28,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:28,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939056475] [2020-02-10 20:17:28,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:28,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939056475] [2020-02-10 20:17:28,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:28,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:28,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996901523] [2020-02-10 20:17:28,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:28,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:28,506 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:28,588 INFO L93 Difference]: Finished difference Result 582 states and 1717 transitions. [2020-02-10 20:17:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:28,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:28,590 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:17:28,590 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:17:28,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:17:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 384. [2020-02-10 20:17:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 20:17:28,599 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:28,600 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 20:17:28,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 20:17:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:28,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:28,600 INFO L415 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] [2020-02-10 20:17:28,600 INFO L427 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1427443628, now seen corresponding path program 812 times [2020-02-10 20:17:28,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:28,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332887257] [2020-02-10 20:17:28,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:28,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332887257] [2020-02-10 20:17:28,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:28,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:28,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286570162] [2020-02-10 20:17:28,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:28,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:28,889 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:29,000 INFO L93 Difference]: Finished difference Result 583 states and 1718 transitions. [2020-02-10 20:17:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:29,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:29,002 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:17:29,002 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:17:29,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:17:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2020-02-10 20:17:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1317 transitions. [2020-02-10 20:17:29,012 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:29,012 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1317 transitions. [2020-02-10 20:17:29,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1317 transitions. [2020-02-10 20:17:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:29,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:29,013 INFO L415 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] [2020-02-10 20:17:29,013 INFO L427 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1865334240, now seen corresponding path program 813 times [2020-02-10 20:17:29,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:29,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054888110] [2020-02-10 20:17:29,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:29,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054888110] [2020-02-10 20:17:29,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:29,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:29,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784764069] [2020-02-10 20:17:29,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:29,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:29,292 INFO L87 Difference]: Start difference. First operand 383 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:29,374 INFO L93 Difference]: Finished difference Result 586 states and 1724 transitions. [2020-02-10 20:17:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:29,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:29,376 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:17:29,376 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:17:29,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:17:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 20:17:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1318 transitions. [2020-02-10 20:17:29,384 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1318 transitions. Word has length 22 [2020-02-10 20:17:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:29,385 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1318 transitions. [2020-02-10 20:17:29,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1318 transitions. [2020-02-10 20:17:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:29,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:29,385 INFO L415 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] [2020-02-10 20:17:29,385 INFO L427 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1353921900, now seen corresponding path program 814 times [2020-02-10 20:17:29,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:29,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812908040] [2020-02-10 20:17:29,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:29,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812908040] [2020-02-10 20:17:29,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:29,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:29,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852086020] [2020-02-10 20:17:29,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:29,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:29,657 INFO L87 Difference]: Start difference. First operand 384 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:17:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:29,764 INFO L93 Difference]: Finished difference Result 591 states and 1733 transitions. [2020-02-10 20:17:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:29,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:29,766 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:17:29,766 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:17:29,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:17:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 20:17:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 20:17:29,775 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 20:17:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:29,775 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 20:17:29,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 20:17:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:29,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:29,776 INFO L415 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] [2020-02-10 20:17:29,776 INFO L427 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1854831136, now seen corresponding path program 815 times [2020-02-10 20:17:29,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:29,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904607845] [2020-02-10 20:17:29,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:30,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904607845] [2020-02-10 20:17:30,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:30,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773730695] [2020-02-10 20:17:30,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:30,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:30,062 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:17:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:30,165 INFO L93 Difference]: Finished difference Result 589 states and 1730 transitions. [2020-02-10 20:17:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:30,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:30,167 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:17:30,167 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:17:30,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:17:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-02-10 20:17:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1319 transitions. [2020-02-10 20:17:30,177 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:30,177 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1319 transitions. [2020-02-10 20:17:30,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1319 transitions. [2020-02-10 20:17:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:30,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:30,178 INFO L415 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] [2020-02-10 20:17:30,178 INFO L427 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash -246515954, now seen corresponding path program 816 times [2020-02-10 20:17:30,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:30,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693156449] [2020-02-10 20:17:30,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:30,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693156449] [2020-02-10 20:17:30,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:30,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797070500] [2020-02-10 20:17:30,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:30,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:30,456 INFO L87 Difference]: Start difference. First operand 385 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:30,566 INFO L93 Difference]: Finished difference Result 593 states and 1736 transitions. [2020-02-10 20:17:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:30,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:30,568 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:17:30,568 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:17:30,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:17:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 379. [2020-02-10 20:17:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:17:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1309 transitions. [2020-02-10 20:17:30,577 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1309 transitions. Word has length 22 [2020-02-10 20:17:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:30,578 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1309 transitions. [2020-02-10 20:17:30,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1309 transitions. [2020-02-10 20:17:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:30,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:30,578 INFO L415 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] [2020-02-10 20:17:30,578 INFO L427 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:30,579 INFO L82 PathProgramCache]: Analyzing trace with hash 363192438, now seen corresponding path program 817 times [2020-02-10 20:17:30,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:30,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377491908] [2020-02-10 20:17:30,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:30,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377491908] [2020-02-10 20:17:30,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:30,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829867012] [2020-02-10 20:17:30,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:30,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:30,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:30,978 INFO L87 Difference]: Start difference. First operand 379 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:17:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:31,086 INFO L93 Difference]: Finished difference Result 563 states and 1677 transitions. [2020-02-10 20:17:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:31,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:31,087 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:17:31,087 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:17:31,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:17:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2020-02-10 20:17:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 20:17:31,097 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:31,097 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 20:17:31,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 20:17:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:31,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:31,097 INFO L415 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] [2020-02-10 20:17:31,097 INFO L427 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1082324572, now seen corresponding path program 818 times [2020-02-10 20:17:31,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:31,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128004431] [2020-02-10 20:17:31,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:31,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128004431] [2020-02-10 20:17:31,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:31,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:31,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570487073] [2020-02-10 20:17:31,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:31,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:31,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:31,404 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:31,483 INFO L93 Difference]: Finished difference Result 561 states and 1672 transitions. [2020-02-10 20:17:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:31,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:31,485 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:17:31,485 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:17:31,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:31,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:17:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 381. [2020-02-10 20:17:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1315 transitions. [2020-02-10 20:17:31,495 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:31,495 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1315 transitions. [2020-02-10 20:17:31,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1315 transitions. [2020-02-10 20:17:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:31,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:31,495 INFO L415 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] [2020-02-10 20:17:31,495 INFO L427 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1237245416, now seen corresponding path program 819 times [2020-02-10 20:17:31,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:31,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504086283] [2020-02-10 20:17:31,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:31,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504086283] [2020-02-10 20:17:31,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:31,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:31,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521588122] [2020-02-10 20:17:31,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:31,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:31,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:31,792 INFO L87 Difference]: Start difference. First operand 381 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:31,911 INFO L93 Difference]: Finished difference Result 565 states and 1681 transitions. [2020-02-10 20:17:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:31,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:31,912 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:17:31,913 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:17:31,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:17:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-02-10 20:17:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:17:31,922 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:17:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:31,922 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:17:31,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:17:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:31,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:31,923 INFO L415 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] [2020-02-10 20:17:31,923 INFO L427 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash -984152664, now seen corresponding path program 820 times [2020-02-10 20:17:31,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:31,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233492349] [2020-02-10 20:17:31,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:32,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233492349] [2020-02-10 20:17:32,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:32,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:32,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72550096] [2020-02-10 20:17:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:32,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:32,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:32,241 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:17:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:32,345 INFO L93 Difference]: Finished difference Result 564 states and 1677 transitions. [2020-02-10 20:17:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:32,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:32,347 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:17:32,347 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:17:32,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:17:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-02-10 20:17:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 20:17:32,356 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:32,356 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 20:17:32,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 20:17:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:32,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:32,356 INFO L415 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] [2020-02-10 20:17:32,356 INFO L427 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash 11767016, now seen corresponding path program 821 times [2020-02-10 20:17:32,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:32,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235341488] [2020-02-10 20:17:32,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:32,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235341488] [2020-02-10 20:17:32,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:32,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:32,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355911002] [2020-02-10 20:17:32,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:32,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:32,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:32,660 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:32,740 INFO L93 Difference]: Finished difference Result 560 states and 1669 transitions. [2020-02-10 20:17:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:32,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:32,742 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:17:32,742 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:17:32,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:17:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 382. [2020-02-10 20:17:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:17:32,751 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:32,751 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:17:32,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:17:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:32,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:32,752 INFO L415 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] [2020-02-10 20:17:32,752 INFO L427 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1622707974, now seen corresponding path program 822 times [2020-02-10 20:17:32,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:32,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225572554] [2020-02-10 20:17:32,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:33,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225572554] [2020-02-10 20:17:33,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:33,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:33,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301586615] [2020-02-10 20:17:33,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:33,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:33,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:33,056 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:33,161 INFO L93 Difference]: Finished difference Result 561 states and 1670 transitions. [2020-02-10 20:17:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:33,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:33,163 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:17:33,163 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:17:33,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:17:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-02-10 20:17:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1312 transitions. [2020-02-10 20:17:33,173 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1312 transitions. Word has length 22 [2020-02-10 20:17:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:33,173 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1312 transitions. [2020-02-10 20:17:33,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1312 transitions. [2020-02-10 20:17:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:33,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:33,174 INFO L415 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] [2020-02-10 20:17:33,174 INFO L427 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash -234144220, now seen corresponding path program 823 times [2020-02-10 20:17:33,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:33,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618367566] [2020-02-10 20:17:33,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:33,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618367566] [2020-02-10 20:17:33,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:33,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:33,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506086046] [2020-02-10 20:17:33,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:33,459 INFO L87 Difference]: Start difference. First operand 380 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:17:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:33,576 INFO L93 Difference]: Finished difference Result 568 states and 1687 transitions. [2020-02-10 20:17:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:33,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:33,578 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:17:33,578 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:17:33,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:17:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 382. [2020-02-10 20:17:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-02-10 20:17:33,587 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-02-10 20:17:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:33,587 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-02-10 20:17:33,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-02-10 20:17:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:33,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:33,588 INFO L415 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] [2020-02-10 20:17:33,588 INFO L427 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1679661230, now seen corresponding path program 824 times [2020-02-10 20:17:33,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:33,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669798256] [2020-02-10 20:17:33,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:33,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669798256] [2020-02-10 20:17:33,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:33,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:33,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599737164] [2020-02-10 20:17:33,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:33,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:33,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:33,890 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:17:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:33,981 INFO L93 Difference]: Finished difference Result 566 states and 1682 transitions. [2020-02-10 20:17:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:33,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:33,983 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:17:33,983 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:17:33,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:17:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 381. [2020-02-10 20:17:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 20:17:33,993 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:33,993 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 20:17:33,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 20:17:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:33,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:33,993 INFO L415 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] [2020-02-10 20:17:33,994 INFO L427 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:33,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash 778548312, now seen corresponding path program 825 times [2020-02-10 20:17:33,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:33,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035017932] [2020-02-10 20:17:33,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:34,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035017932] [2020-02-10 20:17:34,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:34,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:34,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598636424] [2020-02-10 20:17:34,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:34,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:34,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:34,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:34,299 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:34,401 INFO L93 Difference]: Finished difference Result 575 states and 1702 transitions. [2020-02-10 20:17:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:34,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:34,403 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:17:34,403 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:17:34,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:17:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 384. [2020-02-10 20:17:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 20:17:34,412 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:34,412 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 20:17:34,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 20:17:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:34,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:34,413 INFO L415 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] [2020-02-10 20:17:34,413 INFO L427 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2130383854, now seen corresponding path program 826 times [2020-02-10 20:17:34,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:34,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27944634] [2020-02-10 20:17:34,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:34,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27944634] [2020-02-10 20:17:34,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:34,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:34,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628435521] [2020-02-10 20:17:34,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:34,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:34,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:34,703 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:34,810 INFO L93 Difference]: Finished difference Result 578 states and 1705 transitions. [2020-02-10 20:17:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:34,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:34,812 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:17:34,812 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:34,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 381. [2020-02-10 20:17:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-02-10 20:17:34,822 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-02-10 20:17:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:34,822 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-02-10 20:17:34,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-02-10 20:17:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:34,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:34,823 INFO L415 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] [2020-02-10 20:17:34,823 INFO L427 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2027560744, now seen corresponding path program 827 times [2020-02-10 20:17:34,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:34,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995856171] [2020-02-10 20:17:34,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:35,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995856171] [2020-02-10 20:17:35,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:35,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619010026] [2020-02-10 20:17:35,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:35,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:35,130 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:17:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:35,208 INFO L93 Difference]: Finished difference Result 569 states and 1687 transitions. [2020-02-10 20:17:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:35,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:35,209 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:17:35,210 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:17:35,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:17:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:17:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 20:17:35,218 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:35,218 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 20:17:35,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 20:17:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:35,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:35,219 INFO L415 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] [2020-02-10 20:17:35,219 INFO L427 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash 951849588, now seen corresponding path program 828 times [2020-02-10 20:17:35,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:35,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052704812] [2020-02-10 20:17:35,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:35,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052704812] [2020-02-10 20:17:35,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:35,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008419839] [2020-02-10 20:17:35,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:35,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:35,505 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:35,609 INFO L93 Difference]: Finished difference Result 574 states and 1696 transitions. [2020-02-10 20:17:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:35,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:35,611 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:17:35,611 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:17:35,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:17:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 20:17:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 20:17:35,619 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 20:17:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:35,619 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 20:17:35,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 20:17:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:35,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:35,620 INFO L415 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] [2020-02-10 20:17:35,620 INFO L427 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash 91452004, now seen corresponding path program 829 times [2020-02-10 20:17:35,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:35,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984561327] [2020-02-10 20:17:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984561327] [2020-02-10 20:17:35,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507328487] [2020-02-10 20:17:35,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:35,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:35,905 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:17:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:36,008 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-02-10 20:17:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:36,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:36,010 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:17:36,010 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:17:36,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:17:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 20:17:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1321 transitions. [2020-02-10 20:17:36,018 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1321 transitions. Word has length 22 [2020-02-10 20:17:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:36,018 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1321 transitions. [2020-02-10 20:17:36,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1321 transitions. [2020-02-10 20:17:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:36,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:36,019 INFO L415 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] [2020-02-10 20:17:36,019 INFO L427 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash 344544756, now seen corresponding path program 830 times [2020-02-10 20:17:36,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:36,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2863738] [2020-02-10 20:17:36,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:36,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2863738] [2020-02-10 20:17:36,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:36,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:36,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763787534] [2020-02-10 20:17:36,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:36,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:36,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:36,309 INFO L87 Difference]: Start difference. First operand 384 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:17:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:36,413 INFO L93 Difference]: Finished difference Result 573 states and 1699 transitions. [2020-02-10 20:17:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:36,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:36,415 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:17:36,415 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:36,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 20:17:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-02-10 20:17:36,425 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-02-10 20:17:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:36,425 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-02-10 20:17:36,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-02-10 20:17:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:36,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:36,426 INFO L415 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] [2020-02-10 20:17:36,426 INFO L427 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1590384906, now seen corresponding path program 831 times [2020-02-10 20:17:36,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:36,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642126233] [2020-02-10 20:17:36,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:36,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642126233] [2020-02-10 20:17:36,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:36,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:36,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141776281] [2020-02-10 20:17:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:36,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:36,720 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:17:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:36,822 INFO L93 Difference]: Finished difference Result 579 states and 1712 transitions. [2020-02-10 20:17:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:36,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:36,824 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:17:36,824 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:17:36,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:17:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 385. [2020-02-10 20:17:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 20:17:36,833 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 20:17:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:36,833 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 20:17:36,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 20:17:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:36,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:36,834 INFO L415 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] [2020-02-10 20:17:36,834 INFO L427 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -204349776, now seen corresponding path program 832 times [2020-02-10 20:17:36,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:36,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079882579] [2020-02-10 20:17:36,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:37,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079882579] [2020-02-10 20:17:37,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:37,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:37,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982940378] [2020-02-10 20:17:37,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:37,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:37,123 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:17:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:37,233 INFO L93 Difference]: Finished difference Result 582 states and 1715 transitions. [2020-02-10 20:17:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:37,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:37,235 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:17:37,235 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:17:37,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:17:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-02-10 20:17:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 20:17:37,244 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:37,244 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 20:17:37,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 20:17:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:37,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:37,245 INFO L415 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] [2020-02-10 20:17:37,245 INFO L427 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -196365100, now seen corresponding path program 833 times [2020-02-10 20:17:37,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:37,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015431389] [2020-02-10 20:17:37,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:37,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015431389] [2020-02-10 20:17:37,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:37,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:37,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633922049] [2020-02-10 20:17:37,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:37,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:37,543 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:37,645 INFO L93 Difference]: Finished difference Result 576 states and 1703 transitions. [2020-02-10 20:17:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:37,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:37,647 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:17:37,647 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:17:37,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:17:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 384. [2020-02-10 20:17:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:17:37,656 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:37,656 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:17:37,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:17:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:37,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:37,657 INFO L415 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] [2020-02-10 20:17:37,657 INFO L427 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1114315290, now seen corresponding path program 834 times [2020-02-10 20:17:37,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:37,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282349413] [2020-02-10 20:17:37,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:37,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282349413] [2020-02-10 20:17:37,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:37,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:37,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564468614] [2020-02-10 20:17:37,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:37,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:37,930 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:38,046 INFO L93 Difference]: Finished difference Result 580 states and 1709 transitions. [2020-02-10 20:17:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:38,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:38,048 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:17:38,048 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:17:38,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:17:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 380. [2020-02-10 20:17:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-02-10 20:17:38,057 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-02-10 20:17:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:38,057 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-02-10 20:17:38,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-02-10 20:17:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:38,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:38,058 INFO L415 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] [2020-02-10 20:17:38,058 INFO L427 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1028468782, now seen corresponding path program 835 times [2020-02-10 20:17:38,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:38,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534306930] [2020-02-10 20:17:38,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:38,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534306930] [2020-02-10 20:17:38,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:38,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:38,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381517892] [2020-02-10 20:17:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:38,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:38,366 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:17:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:38,470 INFO L93 Difference]: Finished difference Result 563 states and 1674 transitions. [2020-02-10 20:17:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:38,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:38,472 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:17:38,472 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:17:38,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:17:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 382. [2020-02-10 20:17:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 20:17:38,482 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:38,482 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 20:17:38,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 20:17:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:38,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:38,482 INFO L415 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] [2020-02-10 20:17:38,483 INFO L427 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 582472176, now seen corresponding path program 836 times [2020-02-10 20:17:38,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:38,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141277201] [2020-02-10 20:17:38,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:38,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141277201] [2020-02-10 20:17:38,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:38,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:38,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336750979] [2020-02-10 20:17:38,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:38,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:38,777 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:38,882 INFO L93 Difference]: Finished difference Result 564 states and 1675 transitions. [2020-02-10 20:17:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:38,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:38,884 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:17:38,884 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:17:38,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:17:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 381. [2020-02-10 20:17:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 20:17:38,894 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 20:17:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:38,894 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 20:17:38,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 20:17:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:38,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:38,895 INFO L415 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] [2020-02-10 20:17:38,895 INFO L427 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1584661604, now seen corresponding path program 837 times [2020-02-10 20:17:38,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:38,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244173858] [2020-02-10 20:17:38,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:39,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244173858] [2020-02-10 20:17:39,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:39,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:39,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122373044] [2020-02-10 20:17:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:39,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:39,170 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:17:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:39,247 INFO L93 Difference]: Finished difference Result 567 states and 1681 transitions. [2020-02-10 20:17:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:39,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:39,248 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:17:39,248 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:17:39,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:17:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2020-02-10 20:17:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-02-10 20:17:39,263 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-02-10 20:17:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:39,263 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-02-10 20:17:39,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-02-10 20:17:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:39,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:39,264 INFO L415 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] [2020-02-10 20:17:39,264 INFO L427 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 508950448, now seen corresponding path program 838 times [2020-02-10 20:17:39,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:39,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878180495] [2020-02-10 20:17:39,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:39,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878180495] [2020-02-10 20:17:39,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:39,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:39,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549040939] [2020-02-10 20:17:39,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:39,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:39,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:39,533 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:17:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:39,636 INFO L93 Difference]: Finished difference Result 572 states and 1690 transitions. [2020-02-10 20:17:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:39,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:39,638 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:17:39,638 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:17:39,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:17:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 381. [2020-02-10 20:17:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-02-10 20:17:39,647 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-02-10 20:17:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:39,647 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-02-10 20:17:39,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-02-10 20:17:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:39,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:39,648 INFO L415 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] [2020-02-10 20:17:39,648 INFO L427 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1595164708, now seen corresponding path program 839 times [2020-02-10 20:17:39,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:39,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023454827] [2020-02-10 20:17:39,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:39,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023454827] [2020-02-10 20:17:39,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:39,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:39,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762909698] [2020-02-10 20:17:39,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:39,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:39,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:39,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:39,924 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:17:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:40,025 INFO L93 Difference]: Finished difference Result 570 states and 1687 transitions. [2020-02-10 20:17:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:40,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:40,027 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:17:40,027 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:17:40,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:17:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-02-10 20:17:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 20:17:40,036 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:40,036 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 20:17:40,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 20:17:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:40,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:40,037 INFO L415 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] [2020-02-10 20:17:40,037 INFO L427 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1091487406, now seen corresponding path program 840 times [2020-02-10 20:17:40,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:40,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373676984] [2020-02-10 20:17:40,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:40,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373676984] [2020-02-10 20:17:40,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:40,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:40,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369069627] [2020-02-10 20:17:40,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:40,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:40,327 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:40,435 INFO L93 Difference]: Finished difference Result 574 states and 1693 transitions. [2020-02-10 20:17:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:40,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:40,436 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:17:40,436 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:17:40,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:17:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 376. [2020-02-10 20:17:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:17:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1303 transitions. [2020-02-10 20:17:40,445 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1303 transitions. Word has length 22 [2020-02-10 20:17:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:40,446 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1303 transitions. [2020-02-10 20:17:40,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1303 transitions. [2020-02-10 20:17:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:40,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:40,446 INFO L415 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] [2020-02-10 20:17:40,446 INFO L427 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:40,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1001902390, now seen corresponding path program 841 times [2020-02-10 20:17:40,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:40,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083582837] [2020-02-10 20:17:40,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:40,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083582837] [2020-02-10 20:17:40,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:40,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:40,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513319181] [2020-02-10 20:17:40,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:40,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:40,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:40,727 INFO L87 Difference]: Start difference. First operand 376 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:17:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:40,806 INFO L93 Difference]: Finished difference Result 583 states and 1720 transitions. [2020-02-10 20:17:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:40,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:40,808 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:17:40,808 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:17:40,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:17:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 386. [2020-02-10 20:17:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 20:17:40,817 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 20:17:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:40,817 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 20:17:40,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 20:17:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:40,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:40,818 INFO L415 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] [2020-02-10 20:17:40,818 INFO L427 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1702799020, now seen corresponding path program 842 times [2020-02-10 20:17:40,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:40,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234493918] [2020-02-10 20:17:40,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234493918] [2020-02-10 20:17:41,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:41,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649634750] [2020-02-10 20:17:41,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:41,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:41,085 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:17:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,188 INFO L93 Difference]: Finished difference Result 578 states and 1707 transitions. [2020-02-10 20:17:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:41,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,190 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:17:41,190 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:17:41,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:17:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 382. [2020-02-10 20:17:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1325 transitions. [2020-02-10 20:17:41,200 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:41,200 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1325 transitions. [2020-02-10 20:17:41,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1325 transitions. [2020-02-10 20:17:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:41,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:41,201 INFO L415 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] [2020-02-10 20:17:41,201 INFO L427 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1940514586, now seen corresponding path program 843 times [2020-02-10 20:17:41,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:41,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400193854] [2020-02-10 20:17:41,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400193854] [2020-02-10 20:17:41,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:41,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61914810] [2020-02-10 20:17:41,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:41,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:41,477 INFO L87 Difference]: Start difference. First operand 382 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,557 INFO L93 Difference]: Finished difference Result 579 states and 1708 transitions. [2020-02-10 20:17:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:41,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,559 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:17:41,559 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:17:41,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:17:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 20:17:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 20:17:41,568 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:41,568 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 20:17:41,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 20:17:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:41,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:41,569 INFO L415 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] [2020-02-10 20:17:41,569 INFO L427 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:41,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1379446094, now seen corresponding path program 844 times [2020-02-10 20:17:41,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:41,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106823031] [2020-02-10 20:17:41,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106823031] [2020-02-10 20:17:41,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:41,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021725233] [2020-02-10 20:17:41,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:41,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:41,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:41,872 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,955 INFO L93 Difference]: Finished difference Result 572 states and 1693 transitions. [2020-02-10 20:17:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:41,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,957 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:17:41,957 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:41,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 20:17:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-02-10 20:17:41,965 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:41,965 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-02-10 20:17:41,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-02-10 20:17:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:41,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:41,966 INFO L415 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] [2020-02-10 20:17:41,966 INFO L427 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1160162504, now seen corresponding path program 845 times [2020-02-10 20:17:41,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:41,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952577575] [2020-02-10 20:17:41,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:42,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952577575] [2020-02-10 20:17:42,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:42,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:42,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862106024] [2020-02-10 20:17:42,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:42,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:42,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:42,247 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:42,354 INFO L93 Difference]: Finished difference Result 568 states and 1686 transitions. [2020-02-10 20:17:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:42,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:42,355 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:17:42,356 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:17:42,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:17:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 383. [2020-02-10 20:17:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 20:17:42,364 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 20:17:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:42,364 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 20:17:42,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 20:17:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:42,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:42,365 INFO L415 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] [2020-02-10 20:17:42,365 INFO L427 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -285354506, now seen corresponding path program 846 times [2020-02-10 20:17:42,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:42,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449830252] [2020-02-10 20:17:42,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:42,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449830252] [2020-02-10 20:17:42,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:42,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:42,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3357175] [2020-02-10 20:17:42,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:42,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:42,651 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:17:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:42,734 INFO L93 Difference]: Finished difference Result 566 states and 1681 transitions. [2020-02-10 20:17:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:42,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:42,736 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:17:42,736 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:17:42,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:17:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 380. [2020-02-10 20:17:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1319 transitions. [2020-02-10 20:17:42,745 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:42,745 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1319 transitions. [2020-02-10 20:17:42,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1319 transitions. [2020-02-10 20:17:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:42,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:42,746 INFO L415 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] [2020-02-10 20:17:42,746 INFO L427 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 579416664, now seen corresponding path program 847 times [2020-02-10 20:17:42,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:42,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507041495] [2020-02-10 20:17:42,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:43,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507041495] [2020-02-10 20:17:43,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:43,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:43,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141158418] [2020-02-10 20:17:43,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:43,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:43,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:43,032 INFO L87 Difference]: Start difference. First operand 380 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:43,133 INFO L93 Difference]: Finished difference Result 587 states and 1730 transitions. [2020-02-10 20:17:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:43,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:43,135 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:17:43,135 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:17:43,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:17:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 387. [2020-02-10 20:17:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 20:17:43,143 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 20:17:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:43,143 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 20:17:43,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 20:17:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:43,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:43,144 INFO L415 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] [2020-02-10 20:17:43,144 INFO L427 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2125284746, now seen corresponding path program 848 times [2020-02-10 20:17:43,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:43,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611883886] [2020-02-10 20:17:43,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:43,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611883886] [2020-02-10 20:17:43,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:43,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:43,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030949059] [2020-02-10 20:17:43,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:43,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:43,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:43,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:43,416 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:17:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:43,521 INFO L93 Difference]: Finished difference Result 582 states and 1717 transitions. [2020-02-10 20:17:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:43,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:43,522 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:17:43,523 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:17:43,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:17:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 383. [2020-02-10 20:17:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-02-10 20:17:43,532 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-02-10 20:17:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:43,532 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-02-10 20:17:43,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-02-10 20:17:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:43,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:43,533 INFO L415 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] [2020-02-10 20:17:43,533 INFO L427 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash 680328836, now seen corresponding path program 849 times [2020-02-10 20:17:43,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:43,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197453247] [2020-02-10 20:17:43,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:43,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197453247] [2020-02-10 20:17:43,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:43,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:43,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517502773] [2020-02-10 20:17:43,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:43,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:43,819 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:17:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:43,905 INFO L93 Difference]: Finished difference Result 585 states and 1722 transitions. [2020-02-10 20:17:43,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:43,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:43,907 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:17:43,907 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:17:43,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:17:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 386. [2020-02-10 20:17:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1330 transitions. [2020-02-10 20:17:43,916 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1330 transitions. Word has length 22 [2020-02-10 20:17:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:43,916 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1330 transitions. [2020-02-10 20:17:43,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1330 transitions. [2020-02-10 20:17:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:43,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:43,917 INFO L415 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] [2020-02-10 20:17:43,917 INFO L427 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 806965210, now seen corresponding path program 850 times [2020-02-10 20:17:43,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:43,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838455344] [2020-02-10 20:17:43,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:44,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838455344] [2020-02-10 20:17:44,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:44,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:44,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5590079] [2020-02-10 20:17:44,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:44,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:44,193 INFO L87 Difference]: Start difference. First operand 386 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:17:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:44,301 INFO L93 Difference]: Finished difference Result 579 states and 1708 transitions. [2020-02-10 20:17:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:44,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:44,303 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:17:44,303 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:17:44,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:17:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 383. [2020-02-10 20:17:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1323 transitions. [2020-02-10 20:17:44,311 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:44,312 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1323 transitions. [2020-02-10 20:17:44,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1323 transitions. [2020-02-10 20:17:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:44,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:44,312 INFO L415 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] [2020-02-10 20:17:44,312 INFO L427 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1608052958, now seen corresponding path program 851 times [2020-02-10 20:17:44,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:44,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422807432] [2020-02-10 20:17:44,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:44,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422807432] [2020-02-10 20:17:44,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:44,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:44,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812565960] [2020-02-10 20:17:44,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:44,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:44,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:44,589 INFO L87 Difference]: Start difference. First operand 383 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:44,704 INFO L93 Difference]: Finished difference Result 574 states and 1699 transitions. [2020-02-10 20:17:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:44,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:44,706 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:17:44,706 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:17:44,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:17:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 20:17:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-02-10 20:17:44,715 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-02-10 20:17:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:44,715 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-02-10 20:17:44,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-02-10 20:17:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:44,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:44,716 INFO L415 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] [2020-02-10 20:17:44,716 INFO L427 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -266120170, now seen corresponding path program 852 times [2020-02-10 20:17:44,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:44,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48948643] [2020-02-10 20:17:44,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:44,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48948643] [2020-02-10 20:17:44,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:44,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:44,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638265495] [2020-02-10 20:17:44,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:44,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:44,993 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:17:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,109 INFO L93 Difference]: Finished difference Result 573 states and 1695 transitions. [2020-02-10 20:17:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:45,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,111 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:17:45,111 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:17:45,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:17:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 20:17:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1317 transitions. [2020-02-10 20:17:45,120 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,120 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1317 transitions. [2020-02-10 20:17:45,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1317 transitions. [2020-02-10 20:17:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:45,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,121 INFO L415 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] [2020-02-10 20:17:45,121 INFO L427 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1959102490, now seen corresponding path program 853 times [2020-02-10 20:17:45,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60168272] [2020-02-10 20:17:45,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:45,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60168272] [2020-02-10 20:17:45,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:45,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:45,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948730113] [2020-02-10 20:17:45,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:45,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:45,401 INFO L87 Difference]: Start difference. First operand 380 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,481 INFO L93 Difference]: Finished difference Result 577 states and 1701 transitions. [2020-02-10 20:17:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:45,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,483 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:17:45,483 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:45,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-02-10 20:17:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 20:17:45,492 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,493 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 20:17:45,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 20:17:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:45,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,493 INFO L415 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] [2020-02-10 20:17:45,493 INFO L427 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1398033998, now seen corresponding path program 854 times [2020-02-10 20:17:45,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954657636] [2020-02-10 20:17:45,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:45,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954657636] [2020-02-10 20:17:45,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:45,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:45,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235845622] [2020-02-10 20:17:45,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:45,777 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,858 INFO L93 Difference]: Finished difference Result 570 states and 1686 transitions. [2020-02-10 20:17:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:45,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,860 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:17:45,860 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:17:45,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:17:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 382. [2020-02-10 20:17:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 20:17:45,870 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 20:17:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,870 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 20:17:45,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 20:17:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:45,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,871 INFO L415 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] [2020-02-10 20:17:45,871 INFO L427 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash 735426952, now seen corresponding path program 855 times [2020-02-10 20:17:45,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210215775] [2020-02-10 20:17:45,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:46,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210215775] [2020-02-10 20:17:46,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:46,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:46,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311422698] [2020-02-10 20:17:46,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:46,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:46,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:46,188 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:17:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:46,265 INFO L93 Difference]: Finished difference Result 579 states and 1704 transitions. [2020-02-10 20:17:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:46,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:46,267 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:17:46,267 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:17:46,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:17:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 20:17:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:17:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-02-10 20:17:46,276 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:46,276 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-02-10 20:17:46,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-02-10 20:17:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:46,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:46,277 INFO L415 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] [2020-02-10 20:17:46,277 INFO L427 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash -226776710, now seen corresponding path program 856 times [2020-02-10 20:17:46,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:46,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332533696] [2020-02-10 20:17:46,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:46,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332533696] [2020-02-10 20:17:46,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:46,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:46,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685404336] [2020-02-10 20:17:46,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:46,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:46,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:46,570 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:46,674 INFO L93 Difference]: Finished difference Result 573 states and 1690 transitions. [2020-02-10 20:17:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:46,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:46,676 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:17:46,676 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:17:46,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:17:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:17:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 20:17:46,685 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:46,685 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 20:17:46,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 20:17:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:46,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:46,686 INFO L415 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] [2020-02-10 20:17:46,686 INFO L427 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 790149178, now seen corresponding path program 857 times [2020-02-10 20:17:46,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:46,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567447653] [2020-02-10 20:17:46,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:46,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567447653] [2020-02-10 20:17:46,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:46,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:46,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235782773] [2020-02-10 20:17:46,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:46,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:46,987 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:47,066 INFO L93 Difference]: Finished difference Result 563 states and 1671 transitions. [2020-02-10 20:17:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:47,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:47,068 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:17:47,068 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:17:47,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:17:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-02-10 20:17:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 20:17:47,077 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 20:17:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:47,077 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 20:17:47,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 20:17:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:47,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:47,078 INFO L415 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] [2020-02-10 20:17:47,078 INFO L427 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1893877160, now seen corresponding path program 858 times [2020-02-10 20:17:47,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:47,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197213393] [2020-02-10 20:17:47,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:47,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197213393] [2020-02-10 20:17:47,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:47,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:47,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869962448] [2020-02-10 20:17:47,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:47,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:47,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:47,417 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:17:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:47,541 INFO L93 Difference]: Finished difference Result 564 states and 1672 transitions. [2020-02-10 20:17:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:47,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:47,543 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:17:47,543 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:17:47,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:17:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 380. [2020-02-10 20:17:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1315 transitions. [2020-02-10 20:17:47,553 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:47,553 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1315 transitions. [2020-02-10 20:17:47,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1315 transitions. [2020-02-10 20:17:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:47,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:47,554 INFO L415 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] [2020-02-10 20:17:47,554 INFO L427 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 698675460, now seen corresponding path program 859 times [2020-02-10 20:17:47,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:47,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689876947] [2020-02-10 20:17:47,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:47,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689876947] [2020-02-10 20:17:47,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:47,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:47,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373183756] [2020-02-10 20:17:47,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:47,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:47,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:47,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:47,838 INFO L87 Difference]: Start difference. First operand 380 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:47,959 INFO L93 Difference]: Finished difference Result 558 states and 1663 transitions. [2020-02-10 20:17:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:47,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:47,961 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:17:47,961 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:17:47,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:47,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:17:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-02-10 20:17:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 20:17:47,970 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:47,970 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 20:17:47,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 20:17:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:47,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:47,971 INFO L415 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] [2020-02-10 20:17:47,971 INFO L427 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -746841550, now seen corresponding path program 860 times [2020-02-10 20:17:47,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:47,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856327924] [2020-02-10 20:17:47,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:48,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856327924] [2020-02-10 20:17:48,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:48,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:48,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989521173] [2020-02-10 20:17:48,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:48,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:48,270 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:48,350 INFO L93 Difference]: Finished difference Result 556 states and 1658 transitions. [2020-02-10 20:17:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:48,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:48,352 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:17:48,352 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:17:48,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:17:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 381. [2020-02-10 20:17:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1317 transitions. [2020-02-10 20:17:48,360 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:48,360 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1317 transitions. [2020-02-10 20:17:48,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1317 transitions. [2020-02-10 20:17:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:48,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:48,361 INFO L415 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] [2020-02-10 20:17:48,361 INFO L427 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash -901762394, now seen corresponding path program 861 times [2020-02-10 20:17:48,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:48,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705348133] [2020-02-10 20:17:48,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:48,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705348133] [2020-02-10 20:17:48,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:48,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:48,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101223094] [2020-02-10 20:17:48,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:48,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:48,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:48,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:48,660 INFO L87 Difference]: Start difference. First operand 381 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:48,764 INFO L93 Difference]: Finished difference Result 560 states and 1667 transitions. [2020-02-10 20:17:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:48,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:48,765 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:17:48,765 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:17:48,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:17:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 383. [2020-02-10 20:17:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 20:17:48,774 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 20:17:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:48,774 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 20:17:48,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 20:17:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:48,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:48,774 INFO L415 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] [2020-02-10 20:17:48,775 INFO L427 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:48,775 INFO L82 PathProgramCache]: Analyzing trace with hash -648669642, now seen corresponding path program 862 times [2020-02-10 20:17:48,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:48,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806042151] [2020-02-10 20:17:48,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:49,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806042151] [2020-02-10 20:17:49,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:49,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:49,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484919281] [2020-02-10 20:17:49,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:49,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:49,061 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:17:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:49,169 INFO L93 Difference]: Finished difference Result 559 states and 1663 transitions. [2020-02-10 20:17:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:49,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:49,171 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:17:49,171 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:17:49,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:17:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 381. [2020-02-10 20:17:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-02-10 20:17:49,180 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-02-10 20:17:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:49,181 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-02-10 20:17:49,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-02-10 20:17:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:49,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:49,181 INFO L415 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] [2020-02-10 20:17:49,181 INFO L427 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 347250038, now seen corresponding path program 863 times [2020-02-10 20:17:49,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:49,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563015170] [2020-02-10 20:17:49,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:49,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563015170] [2020-02-10 20:17:49,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:49,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:49,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634057637] [2020-02-10 20:17:49,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:49,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:49,482 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:17:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:49,570 INFO L93 Difference]: Finished difference Result 555 states and 1655 transitions. [2020-02-10 20:17:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:49,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:49,572 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:17:49,572 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:17:49,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:17:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 382. [2020-02-10 20:17:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 20:17:49,581 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:49,582 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 20:17:49,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 20:17:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:49,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:49,582 INFO L415 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] [2020-02-10 20:17:49,582 INFO L427 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1958190996, now seen corresponding path program 864 times [2020-02-10 20:17:49,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:49,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937579479] [2020-02-10 20:17:49,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:49,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937579479] [2020-02-10 20:17:49,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:49,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:49,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022570283] [2020-02-10 20:17:49,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:49,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:49,888 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:50,000 INFO L93 Difference]: Finished difference Result 556 states and 1656 transitions. [2020-02-10 20:17:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:50,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:50,002 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:17:50,002 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:17:50,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:17:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 378. [2020-02-10 20:17:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:17:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1311 transitions. [2020-02-10 20:17:50,011 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1311 transitions. Word has length 22 [2020-02-10 20:17:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:50,011 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1311 transitions. [2020-02-10 20:17:50,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1311 transitions. [2020-02-10 20:17:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:50,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:50,012 INFO L415 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] [2020-02-10 20:17:50,012 INFO L427 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2020131198, now seen corresponding path program 865 times [2020-02-10 20:17:50,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:50,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669909144] [2020-02-10 20:17:50,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:50,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669909144] [2020-02-10 20:17:50,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:50,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:50,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482232964] [2020-02-10 20:17:50,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:50,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:50,288 INFO L87 Difference]: Start difference. First operand 378 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:17:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:50,383 INFO L93 Difference]: Finished difference Result 587 states and 1729 transitions. [2020-02-10 20:17:50,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:50,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:50,385 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:17:50,385 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:17:50,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:17:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 386. [2020-02-10 20:17:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:17:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-02-10 20:17:50,395 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-02-10 20:17:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:50,395 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-02-10 20:17:50,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-02-10 20:17:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:50,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:50,396 INFO L415 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] [2020-02-10 20:17:50,396 INFO L427 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:50,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash -429865312, now seen corresponding path program 866 times [2020-02-10 20:17:50,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:50,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192203985] [2020-02-10 20:17:50,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:50,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192203985] [2020-02-10 20:17:50,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:50,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:50,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211553768] [2020-02-10 20:17:50,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:50,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:50,677 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:17:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:50,780 INFO L93 Difference]: Finished difference Result 582 states and 1716 transitions. [2020-02-10 20:17:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:50,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:50,782 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:17:50,782 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:17:50,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:17:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 382. [2020-02-10 20:17:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-02-10 20:17:50,792 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:50,792 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-02-10 20:17:50,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-02-10 20:17:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:50,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:50,793 INFO L415 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] [2020-02-10 20:17:50,793 INFO L427 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -667580878, now seen corresponding path program 867 times [2020-02-10 20:17:50,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:50,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703286509] [2020-02-10 20:17:50,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:51,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703286509] [2020-02-10 20:17:51,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:51,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:51,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406062713] [2020-02-10 20:17:51,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:51,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:51,064 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:51,150 INFO L93 Difference]: Finished difference Result 583 states and 1717 transitions. [2020-02-10 20:17:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:51,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:51,151 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:17:51,151 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:17:51,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:17:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 384. [2020-02-10 20:17:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 20:17:51,161 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 20:17:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:51,161 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 20:17:51,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 20:17:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:51,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:51,162 INFO L415 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] [2020-02-10 20:17:51,162 INFO L427 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:51,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash -106512386, now seen corresponding path program 868 times [2020-02-10 20:17:51,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:51,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436234169] [2020-02-10 20:17:51,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:51,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436234169] [2020-02-10 20:17:51,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:51,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:51,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325479068] [2020-02-10 20:17:51,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:51,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:51,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:51,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:51,439 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:17:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:51,521 INFO L93 Difference]: Finished difference Result 576 states and 1702 transitions. [2020-02-10 20:17:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:51,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:51,523 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:17:51,523 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:17:51,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:17:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-02-10 20:17:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 20:17:51,531 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 20:17:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:51,531 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 20:17:51,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 20:17:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:51,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:51,532 INFO L415 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] [2020-02-10 20:17:51,532 INFO L427 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1861871084, now seen corresponding path program 869 times [2020-02-10 20:17:51,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:51,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559452251] [2020-02-10 20:17:51,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:51,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559452251] [2020-02-10 20:17:51,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:51,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:51,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987647709] [2020-02-10 20:17:51,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:51,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:51,812 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:17:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:51,928 INFO L93 Difference]: Finished difference Result 572 states and 1695 transitions. [2020-02-10 20:17:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:51,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:51,930 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:17:51,930 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:51,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 20:17:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-02-10 20:17:51,938 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-02-10 20:17:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:51,938 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-02-10 20:17:51,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-02-10 20:17:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:51,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:51,939 INFO L415 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] [2020-02-10 20:17:51,939 INFO L427 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash 987579202, now seen corresponding path program 870 times [2020-02-10 20:17:51,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:51,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512417015] [2020-02-10 20:17:51,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:52,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512417015] [2020-02-10 20:17:52,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:52,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:52,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557819966] [2020-02-10 20:17:52,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:52,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:52,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:52,226 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:17:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:52,307 INFO L93 Difference]: Finished difference Result 570 states and 1690 transitions. [2020-02-10 20:17:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:52,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:52,309 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:17:52,309 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:17:52,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:17:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 20:17:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1317 transitions. [2020-02-10 20:17:52,318 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:52,319 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1317 transitions. [2020-02-10 20:17:52,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1317 transitions. [2020-02-10 20:17:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:52,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:52,319 INFO L415 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] [2020-02-10 20:17:52,319 INFO L427 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash 92297432, now seen corresponding path program 871 times [2020-02-10 20:17:52,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:52,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009244273] [2020-02-10 20:17:52,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:52,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009244273] [2020-02-10 20:17:52,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:52,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:52,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412785889] [2020-02-10 20:17:52,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:52,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:52,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:52,610 INFO L87 Difference]: Start difference. First operand 380 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:52,709 INFO L93 Difference]: Finished difference Result 593 states and 1746 transitions. [2020-02-10 20:17:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:52,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:52,711 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:17:52,711 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:17:52,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:17:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 388. [2020-02-10 20:17:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 20:17:52,720 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 20:17:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:52,720 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 20:17:52,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 20:17:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:52,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:52,720 INFO L415 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] [2020-02-10 20:17:52,721 INFO L427 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1682563318, now seen corresponding path program 872 times [2020-02-10 20:17:52,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:52,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425605088] [2020-02-10 20:17:52,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:53,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425605088] [2020-02-10 20:17:53,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:53,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:53,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731534701] [2020-02-10 20:17:53,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:53,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:53,002 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:17:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:53,110 INFO L93 Difference]: Finished difference Result 588 states and 1733 transitions. [2020-02-10 20:17:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:53,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:53,112 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:17:53,112 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:17:53,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:17:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 384. [2020-02-10 20:17:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 20:17:53,121 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:53,121 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 20:17:53,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 20:17:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:53,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:53,122 INFO L415 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] [2020-02-10 20:17:53,122 INFO L427 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1256379320, now seen corresponding path program 873 times [2020-02-10 20:17:53,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:53,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614347734] [2020-02-10 20:17:53,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:53,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614347734] [2020-02-10 20:17:53,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:53,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:53,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805928883] [2020-02-10 20:17:53,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:53,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:53,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:53,409 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:53,494 INFO L93 Difference]: Finished difference Result 587 states and 1733 transitions. [2020-02-10 20:17:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:53,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:53,496 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:17:53,496 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:17:53,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:17:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 389. [2020-02-10 20:17:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:17:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1335 transitions. [2020-02-10 20:17:53,505 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1335 transitions. Word has length 22 [2020-02-10 20:17:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:53,512 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1335 transitions. [2020-02-10 20:17:53,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1335 transitions. [2020-02-10 20:17:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:53,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:53,512 INFO L415 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] [2020-02-10 20:17:53,513 INFO L427 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1337260074, now seen corresponding path program 874 times [2020-02-10 20:17:53,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:53,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735754002] [2020-02-10 20:17:53,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:53,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735754002] [2020-02-10 20:17:53,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:53,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:53,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583925967] [2020-02-10 20:17:53,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:53,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:53,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:53,798 INFO L87 Difference]: Start difference. First operand 389 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:17:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:53,910 INFO L93 Difference]: Finished difference Result 574 states and 1713 transitions. [2020-02-10 20:17:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:53,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:53,912 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:17:53,912 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:17:53,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:17:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 384. [2020-02-10 20:17:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:17:53,921 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:53,921 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:17:53,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:17:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:53,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:53,922 INFO L415 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] [2020-02-10 20:17:53,922 INFO L427 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1823291562, now seen corresponding path program 875 times [2020-02-10 20:17:53,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:53,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271579468] [2020-02-10 20:17:53,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:54,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271579468] [2020-02-10 20:17:54,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:54,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:54,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537674930] [2020-02-10 20:17:54,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:54,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:54,208 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:54,315 INFO L93 Difference]: Finished difference Result 580 states and 1715 transitions. [2020-02-10 20:17:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:54,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:54,317 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:17:54,317 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:17:54,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:17:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-02-10 20:17:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 20:17:54,326 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 20:17:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:54,326 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 20:17:54,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 20:17:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:54,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:54,327 INFO L415 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] [2020-02-10 20:17:54,327 INFO L427 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1597935054, now seen corresponding path program 876 times [2020-02-10 20:17:54,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:54,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485676492] [2020-02-10 20:17:54,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:54,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485676492] [2020-02-10 20:17:54,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:54,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:54,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056668215] [2020-02-10 20:17:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:54,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:54,607 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:17:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:54,725 INFO L93 Difference]: Finished difference Result 572 states and 1706 transitions. [2020-02-10 20:17:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:54,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:54,727 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:17:54,727 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:17:54,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:17:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 380. [2020-02-10 20:17:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1315 transitions. [2020-02-10 20:17:54,736 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:54,736 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1315 transitions. [2020-02-10 20:17:54,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1315 transitions. [2020-02-10 20:17:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:54,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:54,737 INFO L415 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] [2020-02-10 20:17:54,737 INFO L427 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1117524302, now seen corresponding path program 877 times [2020-02-10 20:17:54,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:54,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173917281] [2020-02-10 20:17:54,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:55,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173917281] [2020-02-10 20:17:55,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:55,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:55,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267752290] [2020-02-10 20:17:55,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:55,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:55,010 INFO L87 Difference]: Start difference. First operand 380 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:55,092 INFO L93 Difference]: Finished difference Result 583 states and 1716 transitions. [2020-02-10 20:17:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:55,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:55,094 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:17:55,094 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:17:55,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:17:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 384. [2020-02-10 20:17:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:17:55,104 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:17:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:55,104 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:17:55,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:17:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:55,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:55,104 INFO L415 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] [2020-02-10 20:17:55,104 INFO L427 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -556455810, now seen corresponding path program 878 times [2020-02-10 20:17:55,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:55,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767171563] [2020-02-10 20:17:55,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:55,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767171563] [2020-02-10 20:17:55,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:55,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:55,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497126397] [2020-02-10 20:17:55,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:55,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:55,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:55,375 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:17:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:55,463 INFO L93 Difference]: Finished difference Result 576 states and 1701 transitions. [2020-02-10 20:17:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:55,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:55,465 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:17:55,465 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:17:55,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:17:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-02-10 20:17:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 20:17:55,475 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 20:17:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:55,475 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 20:17:55,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 20:17:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:55,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:55,476 INFO L415 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] [2020-02-10 20:17:55,476 INFO L427 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1705269624, now seen corresponding path program 879 times [2020-02-10 20:17:55,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:55,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56555690] [2020-02-10 20:17:55,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:55,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56555690] [2020-02-10 20:17:55,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:55,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:55,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434692891] [2020-02-10 20:17:55,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:55,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:55,776 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:17:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:55,886 INFO L93 Difference]: Finished difference Result 581 states and 1715 transitions. [2020-02-10 20:17:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:55,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:55,888 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:17:55,888 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:17:55,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:17:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-02-10 20:17:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:17:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1327 transitions. [2020-02-10 20:17:55,898 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1327 transitions. Word has length 22 [2020-02-10 20:17:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:55,898 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1327 transitions. [2020-02-10 20:17:55,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1327 transitions. [2020-02-10 20:17:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:55,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:55,899 INFO L415 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] [2020-02-10 20:17:55,899 INFO L427 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:55,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash 316647034, now seen corresponding path program 880 times [2020-02-10 20:17:55,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:55,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622315143] [2020-02-10 20:17:55,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622315143] [2020-02-10 20:17:56,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:56,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554209277] [2020-02-10 20:17:56,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:56,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:56,182 INFO L87 Difference]: Start difference. First operand 387 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:17:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:56,292 INFO L93 Difference]: Finished difference Result 568 states and 1695 transitions. [2020-02-10 20:17:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:56,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:56,294 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:17:56,294 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:17:56,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:17:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 382. [2020-02-10 20:17:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 20:17:56,303 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:56,303 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 20:17:56,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 20:17:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:56,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:56,304 INFO L415 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] [2020-02-10 20:17:56,304 INFO L427 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1650547398, now seen corresponding path program 881 times [2020-02-10 20:17:56,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:56,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935083280] [2020-02-10 20:17:56,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935083280] [2020-02-10 20:17:56,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:56,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722038133] [2020-02-10 20:17:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:56,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:56,587 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:56,674 INFO L93 Difference]: Finished difference Result 570 states and 1689 transitions. [2020-02-10 20:17:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:56,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:56,676 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:17:56,676 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:17:56,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:17:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 20:17:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:17:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:17:56,685 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:17:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:56,686 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:17:56,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:17:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:56,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:56,686 INFO L415 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] [2020-02-10 20:17:56,686 INFO L427 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1115317596, now seen corresponding path program 882 times [2020-02-10 20:17:56,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:56,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005926429] [2020-02-10 20:17:56,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005926429] [2020-02-10 20:17:56,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:56,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580189791] [2020-02-10 20:17:56,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:56,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:56,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:56,969 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:17:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:57,085 INFO L93 Difference]: Finished difference Result 564 states and 1686 transitions. [2020-02-10 20:17:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:57,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:57,087 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:17:57,087 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:17:57,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:17:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-02-10 20:17:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:17:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1313 transitions. [2020-02-10 20:17:57,096 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1313 transitions. Word has length 22 [2020-02-10 20:17:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:57,096 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1313 transitions. [2020-02-10 20:17:57,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1313 transitions. [2020-02-10 20:17:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:57,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:57,096 INFO L415 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] [2020-02-10 20:17:57,097 INFO L427 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1540253648, now seen corresponding path program 883 times [2020-02-10 20:17:57,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:57,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776875723] [2020-02-10 20:17:57,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:57,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776875723] [2020-02-10 20:17:57,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:57,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:57,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511657984] [2020-02-10 20:17:57,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:57,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:57,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:57,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:57,376 INFO L87 Difference]: Start difference. First operand 380 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:17:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:57,513 INFO L93 Difference]: Finished difference Result 564 states and 1677 transitions. [2020-02-10 20:17:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:57,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:57,515 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:17:57,515 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:17:57,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:17:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 20:17:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 20:17:57,524 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 20:17:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:57,525 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 20:17:57,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 20:17:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:57,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:57,525 INFO L415 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] [2020-02-10 20:17:57,525 INFO L427 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 94736638, now seen corresponding path program 884 times [2020-02-10 20:17:57,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:57,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771902338] [2020-02-10 20:17:57,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:57,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771902338] [2020-02-10 20:17:57,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:57,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:57,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529197784] [2020-02-10 20:17:57,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:57,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:57,822 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:17:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:57,907 INFO L93 Difference]: Finished difference Result 562 states and 1672 transitions. [2020-02-10 20:17:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:57,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:57,909 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:17:57,909 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:17:57,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:17:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-02-10 20:17:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1315 transitions. [2020-02-10 20:17:57,917 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:57,917 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1315 transitions. [2020-02-10 20:17:57,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1315 transitions. [2020-02-10 20:17:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:57,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:57,918 INFO L415 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] [2020-02-10 20:17:57,918 INFO L427 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:57,918 INFO L82 PathProgramCache]: Analyzing trace with hash 952508326, now seen corresponding path program 885 times [2020-02-10 20:17:57,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:57,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786296086] [2020-02-10 20:17:57,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:58,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786296086] [2020-02-10 20:17:58,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:58,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:58,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751385743] [2020-02-10 20:17:58,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:58,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:58,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:58,203 INFO L87 Difference]: Start difference. First operand 381 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:58,323 INFO L93 Difference]: Finished difference Result 566 states and 1683 transitions. [2020-02-10 20:17:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:58,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:58,325 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:17:58,325 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:17:58,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:17:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 384. [2020-02-10 20:17:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:17:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-02-10 20:17:58,334 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-02-10 20:17:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:58,334 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-02-10 20:17:58,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-02-10 20:17:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:58,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:58,334 INFO L415 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] [2020-02-10 20:17:58,335 INFO L427 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1254526270, now seen corresponding path program 886 times [2020-02-10 20:17:58,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:58,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22156637] [2020-02-10 20:17:58,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:58,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22156637] [2020-02-10 20:17:58,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:58,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:58,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62262191] [2020-02-10 20:17:58,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:58,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:58,622 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:17:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:58,733 INFO L93 Difference]: Finished difference Result 558 states and 1674 transitions. [2020-02-10 20:17:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:58,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:58,735 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:17:58,735 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:17:58,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:17:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-02-10 20:17:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:17:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 20:17:58,750 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 20:17:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:58,750 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 20:17:58,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 20:17:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:58,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:58,751 INFO L415 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] [2020-02-10 20:17:58,751 INFO L427 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2093446538, now seen corresponding path program 887 times [2020-02-10 20:17:58,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:58,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274982432] [2020-02-10 20:17:58,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:59,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274982432] [2020-02-10 20:17:59,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:59,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:59,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030923451] [2020-02-10 20:17:59,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:59,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:59,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:59,035 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:17:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:59,124 INFO L93 Difference]: Finished difference Result 562 states and 1672 transitions. [2020-02-10 20:17:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:59,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:59,126 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:17:59,126 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:17:59,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:17:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 20:17:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:17:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:17:59,135 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:17:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:59,135 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:17:59,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:17:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:59,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:59,136 INFO L415 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] [2020-02-10 20:17:59,136 INFO L427 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1558216736, now seen corresponding path program 888 times [2020-02-10 20:17:59,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:59,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567006015] [2020-02-10 20:17:59,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:59,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567006015] [2020-02-10 20:17:59,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:59,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:59,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557240388] [2020-02-10 20:17:59,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:59,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:59,413 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:17:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:59,547 INFO L93 Difference]: Finished difference Result 556 states and 1669 transitions. [2020-02-10 20:17:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:59,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:59,549 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:17:59,549 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:17:59,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:17:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 378. [2020-02-10 20:17:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:17:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1309 transitions. [2020-02-10 20:17:59,558 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1309 transitions. Word has length 22 [2020-02-10 20:17:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:59,559 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1309 transitions. [2020-02-10 20:17:59,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1309 transitions. [2020-02-10 20:17:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:59,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:59,559 INFO L415 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] [2020-02-10 20:17:59,559 INFO L427 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1640194754, now seen corresponding path program 889 times [2020-02-10 20:17:59,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:59,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762393008] [2020-02-10 20:17:59,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:59,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762393008] [2020-02-10 20:17:59,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:59,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:17:59,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891766015] [2020-02-10 20:17:59,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:17:59,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:17:59,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:17:59,855 INFO L87 Difference]: Start difference. First operand 378 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:17:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:59,942 INFO L93 Difference]: Finished difference Result 598 states and 1763 transitions. [2020-02-10 20:17:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:17:59,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:17:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:59,944 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:17:59,944 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:17:59,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:17:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 388. [2020-02-10 20:17:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:17:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:17:59,953 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:17:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:59,953 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:17:59,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:17:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:17:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:17:59,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:59,954 INFO L415 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] [2020-02-10 20:17:59,954 INFO L427 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:59,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1064506656, now seen corresponding path program 890 times [2020-02-10 20:17:59,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:59,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307577871] [2020-02-10 20:17:59,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:00,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307577871] [2020-02-10 20:18:00,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:00,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:00,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206992657] [2020-02-10 20:18:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:00,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:00,247 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:18:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:00,364 INFO L93 Difference]: Finished difference Result 593 states and 1750 transitions. [2020-02-10 20:18:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:00,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:00,366 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:18:00,366 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:18:00,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:18:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-02-10 20:18:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1329 transitions. [2020-02-10 20:18:00,375 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1329 transitions. Word has length 22 [2020-02-10 20:18:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:00,375 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1329 transitions. [2020-02-10 20:18:00,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1329 transitions. [2020-02-10 20:18:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:00,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:00,376 INFO L415 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] [2020-02-10 20:18:00,376 INFO L427 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1741106926, now seen corresponding path program 891 times [2020-02-10 20:18:00,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:00,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091769866] [2020-02-10 20:18:00,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:00,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091769866] [2020-02-10 20:18:00,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:00,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:00,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809631260] [2020-02-10 20:18:00,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:00,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:00,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:00,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:00,665 INFO L87 Difference]: Start difference. First operand 384 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:18:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:00,775 INFO L93 Difference]: Finished difference Result 596 states and 1755 transitions. [2020-02-10 20:18:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:00,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:00,777 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:18:00,777 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:18:00,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:18:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 387. [2020-02-10 20:18:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-02-10 20:18:00,794 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-02-10 20:18:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:00,795 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-02-10 20:18:00,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-02-10 20:18:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:00,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:00,795 INFO L415 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] [2020-02-10 20:18:00,796 INFO L427 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1867743300, now seen corresponding path program 892 times [2020-02-10 20:18:00,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:00,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550063844] [2020-02-10 20:18:00,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550063844] [2020-02-10 20:18:01,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:01,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975919689] [2020-02-10 20:18:01,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:01,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:01,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:01,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:01,076 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:18:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:01,187 INFO L93 Difference]: Finished difference Result 590 states and 1741 transitions. [2020-02-10 20:18:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:01,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:01,189 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:18:01,189 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:18:01,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:18:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 20:18:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1326 transitions. [2020-02-10 20:18:01,199 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1326 transitions. Word has length 22 [2020-02-10 20:18:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:01,199 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1326 transitions. [2020-02-10 20:18:01,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1326 transitions. [2020-02-10 20:18:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:01,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:01,200 INFO L415 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] [2020-02-10 20:18:01,200 INFO L427 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash -547274868, now seen corresponding path program 893 times [2020-02-10 20:18:01,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:01,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125138007] [2020-02-10 20:18:01,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:01,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125138007] [2020-02-10 20:18:01,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:01,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:01,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774888577] [2020-02-10 20:18:01,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:01,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:01,479 INFO L87 Difference]: Start difference. First operand 384 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:18:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:01,588 INFO L93 Difference]: Finished difference Result 585 states and 1732 transitions. [2020-02-10 20:18:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:01,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:01,590 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:18:01,590 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:18:01,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:18:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 386. [2020-02-10 20:18:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1329 transitions. [2020-02-10 20:18:01,599 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1329 transitions. Word has length 22 [2020-02-10 20:18:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:01,599 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1329 transitions. [2020-02-10 20:18:01,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1329 transitions. [2020-02-10 20:18:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:01,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:01,600 INFO L415 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] [2020-02-10 20:18:01,600 INFO L427 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:01,600 INFO L82 PathProgramCache]: Analyzing trace with hash 794657920, now seen corresponding path program 894 times [2020-02-10 20:18:01,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:01,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370348482] [2020-02-10 20:18:01,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:01,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370348482] [2020-02-10 20:18:01,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:01,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:01,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229181240] [2020-02-10 20:18:01,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:01,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:01,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:01,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:01,891 INFO L87 Difference]: Start difference. First operand 386 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:18:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:02,005 INFO L93 Difference]: Finished difference Result 584 states and 1728 transitions. [2020-02-10 20:18:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:02,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:02,007 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:18:02,007 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:18:02,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:18:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 381. [2020-02-10 20:18:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1319 transitions. [2020-02-10 20:18:02,016 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1319 transitions. Word has length 22 [2020-02-10 20:18:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:02,017 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1319 transitions. [2020-02-10 20:18:02,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1319 transitions. [2020-02-10 20:18:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:02,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:02,017 INFO L415 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] [2020-02-10 20:18:02,018 INFO L427 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -119858186, now seen corresponding path program 895 times [2020-02-10 20:18:02,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:02,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963070368] [2020-02-10 20:18:02,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:02,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963070368] [2020-02-10 20:18:02,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:02,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:02,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573892106] [2020-02-10 20:18:02,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:02,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:02,312 INFO L87 Difference]: Start difference. First operand 381 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:18:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:02,409 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-02-10 20:18:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:02,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:02,411 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:18:02,411 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:18:02,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:18:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-02-10 20:18:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:18:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1339 transitions. [2020-02-10 20:18:02,420 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1339 transitions. Word has length 22 [2020-02-10 20:18:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:02,420 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1339 transitions. [2020-02-10 20:18:02,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1339 transitions. [2020-02-10 20:18:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:02,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:02,421 INFO L415 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] [2020-02-10 20:18:02,421 INFO L427 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1470407700, now seen corresponding path program 896 times [2020-02-10 20:18:02,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:02,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84132227] [2020-02-10 20:18:02,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:02,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84132227] [2020-02-10 20:18:02,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:02,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:02,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156705542] [2020-02-10 20:18:02,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:02,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:02,702 INFO L87 Difference]: Start difference. First operand 389 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:18:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:02,834 INFO L93 Difference]: Finished difference Result 595 states and 1754 transitions. [2020-02-10 20:18:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:02,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:02,836 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:18:02,836 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:18:02,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:18:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-02-10 20:18:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1329 transitions. [2020-02-10 20:18:02,846 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1329 transitions. Word has length 22 [2020-02-10 20:18:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:02,846 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1329 transitions. [2020-02-10 20:18:02,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1329 transitions. [2020-02-10 20:18:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:02,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:02,847 INFO L415 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] [2020-02-10 20:18:02,847 INFO L427 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1468534938, now seen corresponding path program 897 times [2020-02-10 20:18:02,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:02,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586357815] [2020-02-10 20:18:02,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:03,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586357815] [2020-02-10 20:18:03,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:03,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:03,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040551568] [2020-02-10 20:18:03,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:03,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:03,146 INFO L87 Difference]: Start difference. First operand 385 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:18:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:03,257 INFO L93 Difference]: Finished difference Result 594 states and 1754 transitions. [2020-02-10 20:18:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:03,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:03,259 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:18:03,259 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:18:03,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:18:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-02-10 20:18:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1337 transitions. [2020-02-10 20:18:03,268 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1337 transitions. Word has length 22 [2020-02-10 20:18:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:03,268 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1337 transitions. [2020-02-10 20:18:03,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1337 transitions. [2020-02-10 20:18:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:03,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:03,269 INFO L415 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] [2020-02-10 20:18:03,269 INFO L427 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:03,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1125104456, now seen corresponding path program 898 times [2020-02-10 20:18:03,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:03,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916061706] [2020-02-10 20:18:03,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:03,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916061706] [2020-02-10 20:18:03,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:03,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:03,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888781390] [2020-02-10 20:18:03,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:03,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:03,553 INFO L87 Difference]: Start difference. First operand 390 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:18:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:03,663 INFO L93 Difference]: Finished difference Result 581 states and 1734 transitions. [2020-02-10 20:18:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:03,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:03,665 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:18:03,665 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:18:03,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:18:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 385. [2020-02-10 20:18:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-02-10 20:18:03,673 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-02-10 20:18:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:03,673 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-02-10 20:18:03,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-02-10 20:18:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:03,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:03,674 INFO L415 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] [2020-02-10 20:18:03,674 INFO L427 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1611135944, now seen corresponding path program 899 times [2020-02-10 20:18:03,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:03,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126715749] [2020-02-10 20:18:03,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:03,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126715749] [2020-02-10 20:18:03,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:03,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:03,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239969732] [2020-02-10 20:18:03,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:03,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:03,985 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:18:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:04,094 INFO L93 Difference]: Finished difference Result 587 states and 1736 transitions. [2020-02-10 20:18:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:04,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:04,096 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:18:04,096 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:18:04,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:18:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 388. [2020-02-10 20:18:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1330 transitions. [2020-02-10 20:18:04,104 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1330 transitions. Word has length 22 [2020-02-10 20:18:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:04,105 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1330 transitions. [2020-02-10 20:18:04,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1330 transitions. [2020-02-10 20:18:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:04,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:04,105 INFO L415 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] [2020-02-10 20:18:04,105 INFO L427 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1810090672, now seen corresponding path program 900 times [2020-02-10 20:18:04,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:04,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894374049] [2020-02-10 20:18:04,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:04,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894374049] [2020-02-10 20:18:04,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:04,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:04,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320494795] [2020-02-10 20:18:04,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:04,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:04,398 INFO L87 Difference]: Start difference. First operand 388 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:18:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:04,507 INFO L93 Difference]: Finished difference Result 579 states and 1727 transitions. [2020-02-10 20:18:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:04,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:04,509 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:18:04,509 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:18:04,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:18:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 381. [2020-02-10 20:18:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-02-10 20:18:04,519 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-02-10 20:18:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:04,519 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-02-10 20:18:04,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-02-10 20:18:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:04,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:04,520 INFO L415 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] [2020-02-10 20:18:04,520 INFO L427 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1142625094, now seen corresponding path program 901 times [2020-02-10 20:18:04,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:04,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592329717] [2020-02-10 20:18:04,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:04,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592329717] [2020-02-10 20:18:04,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:04,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:04,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519768175] [2020-02-10 20:18:04,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:04,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:04,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:04,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:04,790 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:18:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:04,900 INFO L93 Difference]: Finished difference Result 595 states and 1750 transitions. [2020-02-10 20:18:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:04,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:04,902 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:18:04,902 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:18:04,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:18:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-02-10 20:18:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-02-10 20:18:04,911 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-02-10 20:18:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:04,911 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-02-10 20:18:04,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-02-10 20:18:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:04,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:04,912 INFO L415 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] [2020-02-10 20:18:04,912 INFO L427 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1269261468, now seen corresponding path program 902 times [2020-02-10 20:18:04,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:04,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59614636] [2020-02-10 20:18:04,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:05,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59614636] [2020-02-10 20:18:05,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:05,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:05,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649720390] [2020-02-10 20:18:05,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:05,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:05,180 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:18:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:05,287 INFO L93 Difference]: Finished difference Result 589 states and 1736 transitions. [2020-02-10 20:18:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:05,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:05,289 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:18:05,289 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:18:05,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:18:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 384. [2020-02-10 20:18:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:18:05,297 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:05,297 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:18:05,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:18:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:05,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:05,298 INFO L415 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] [2020-02-10 20:18:05,298 INFO L427 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash 66913938, now seen corresponding path program 903 times [2020-02-10 20:18:05,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:05,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742991631] [2020-02-10 20:18:05,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:05,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742991631] [2020-02-10 20:18:05,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:05,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:05,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350313317] [2020-02-10 20:18:05,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:05,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:05,591 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:05,674 INFO L93 Difference]: Finished difference Result 591 states and 1743 transitions. [2020-02-10 20:18:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:05,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:05,676 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:18:05,676 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:18:05,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:18:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-02-10 20:18:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:18:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1331 transitions. [2020-02-10 20:18:05,685 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1331 transitions. Word has length 22 [2020-02-10 20:18:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:05,686 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1331 transitions. [2020-02-10 20:18:05,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1331 transitions. [2020-02-10 20:18:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:05,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:05,686 INFO L415 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] [2020-02-10 20:18:05,686 INFO L427 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash -41585508, now seen corresponding path program 904 times [2020-02-10 20:18:05,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:05,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787272674] [2020-02-10 20:18:05,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:05,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787272674] [2020-02-10 20:18:05,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:05,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:05,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756032975] [2020-02-10 20:18:05,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:05,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:05,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:05,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:05,990 INFO L87 Difference]: Start difference. First operand 389 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:18:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:06,125 INFO L93 Difference]: Finished difference Result 578 states and 1723 transitions. [2020-02-10 20:18:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:06,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:06,127 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:18:06,127 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:18:06,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:18:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-02-10 20:18:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-02-10 20:18:06,137 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-02-10 20:18:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:06,137 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-02-10 20:18:06,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-02-10 20:18:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:06,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:06,138 INFO L415 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] [2020-02-10 20:18:06,138 INFO L427 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1952620448, now seen corresponding path program 905 times [2020-02-10 20:18:06,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:06,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948573752] [2020-02-10 20:18:06,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:06,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948573752] [2020-02-10 20:18:06,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:06,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:06,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284759128] [2020-02-10 20:18:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:06,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:06,413 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:18:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:06,527 INFO L93 Difference]: Finished difference Result 582 states and 1721 transitions. [2020-02-10 20:18:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:06,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:06,529 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:18:06,529 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:18:06,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:18:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 386. [2020-02-10 20:18:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 20:18:06,538 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:06,538 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 20:18:06,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 20:18:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:06,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:06,539 INFO L415 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] [2020-02-10 20:18:06,539 INFO L427 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:06,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2125868140, now seen corresponding path program 906 times [2020-02-10 20:18:06,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:06,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672700303] [2020-02-10 20:18:06,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:06,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672700303] [2020-02-10 20:18:06,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:06,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:06,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446080802] [2020-02-10 20:18:06,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:06,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:06,820 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:06,940 INFO L93 Difference]: Finished difference Result 575 states and 1715 transitions. [2020-02-10 20:18:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:06,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:06,942 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:18:06,942 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:18:06,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:18:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 381. [2020-02-10 20:18:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-02-10 20:18:06,951 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-02-10 20:18:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:06,952 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-02-10 20:18:06,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-02-10 20:18:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:06,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:06,952 INFO L415 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] [2020-02-10 20:18:06,952 INFO L427 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash -51665112, now seen corresponding path program 907 times [2020-02-10 20:18:06,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:06,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836709104] [2020-02-10 20:18:06,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:07,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836709104] [2020-02-10 20:18:07,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:07,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:07,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745444644] [2020-02-10 20:18:07,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:07,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:07,235 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:18:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:07,349 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-02-10 20:18:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:07,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:07,350 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:18:07,351 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:18:07,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:18:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 385. [2020-02-10 20:18:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 20:18:07,359 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:07,359 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 20:18:07,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 20:18:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:07,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:07,360 INFO L415 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] [2020-02-10 20:18:07,360 INFO L427 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:07,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:07,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1290267676, now seen corresponding path program 908 times [2020-02-10 20:18:07,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:07,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858698351] [2020-02-10 20:18:07,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:07,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858698351] [2020-02-10 20:18:07,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:07,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:07,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293955570] [2020-02-10 20:18:07,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:07,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:07,643 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:07,756 INFO L93 Difference]: Finished difference Result 575 states and 1706 transitions. [2020-02-10 20:18:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:07,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:07,758 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:18:07,758 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:18:07,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:18:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 383. [2020-02-10 20:18:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:18:07,767 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:07,767 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:18:07,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:18:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:07,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:07,768 INFO L415 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] [2020-02-10 20:18:07,768 INFO L427 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1127376268, now seen corresponding path program 909 times [2020-02-10 20:18:07,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:07,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716750920] [2020-02-10 20:18:07,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716750920] [2020-02-10 20:18:08,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:08,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051476927] [2020-02-10 20:18:08,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:08,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:08,047 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:08,158 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-02-10 20:18:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:08,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:08,159 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:18:08,160 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:18:08,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:18:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 386. [2020-02-10 20:18:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 20:18:08,178 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:08,178 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 20:18:08,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 20:18:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:08,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:08,179 INFO L415 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] [2020-02-10 20:18:08,179 INFO L427 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1339192868, now seen corresponding path program 910 times [2020-02-10 20:18:08,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:08,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305889971] [2020-02-10 20:18:08,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305889971] [2020-02-10 20:18:08,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:08,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638720315] [2020-02-10 20:18:08,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:08,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:08,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:08,466 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:08,576 INFO L93 Difference]: Finished difference Result 568 states and 1701 transitions. [2020-02-10 20:18:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:08,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:08,577 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:18:08,578 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:18:08,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:18:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 383. [2020-02-10 20:18:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 20:18:08,586 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 20:18:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:08,586 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 20:18:08,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 20:18:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:08,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:08,587 INFO L415 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] [2020-02-10 20:18:08,587 INFO L427 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash -858528860, now seen corresponding path program 911 times [2020-02-10 20:18:08,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:08,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911712858] [2020-02-10 20:18:08,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911712858] [2020-02-10 20:18:08,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:08,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763266725] [2020-02-10 20:18:08,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:08,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:08,862 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:18:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:08,975 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-02-10 20:18:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:08,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:08,977 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:18:08,977 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:18:08,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:18:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 385. [2020-02-10 20:18:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1319 transitions. [2020-02-10 20:18:08,987 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1319 transitions. Word has length 22 [2020-02-10 20:18:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:08,987 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1319 transitions. [2020-02-10 20:18:08,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1319 transitions. [2020-02-10 20:18:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:08,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:08,987 INFO L415 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] [2020-02-10 20:18:08,988 INFO L427 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1031776552, now seen corresponding path program 912 times [2020-02-10 20:18:08,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:08,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368688440] [2020-02-10 20:18:08,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:09,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368688440] [2020-02-10 20:18:09,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:09,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:09,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365369248] [2020-02-10 20:18:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:09,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:09,263 INFO L87 Difference]: Start difference. First operand 385 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:18:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:09,383 INFO L93 Difference]: Finished difference Result 567 states and 1697 transitions. [2020-02-10 20:18:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:09,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:09,384 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:18:09,384 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:18:09,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:18:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 378. [2020-02-10 20:18:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:18:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1307 transitions. [2020-02-10 20:18:09,393 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1307 transitions. Word has length 22 [2020-02-10 20:18:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:09,393 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1307 transitions. [2020-02-10 20:18:09,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1307 transitions. [2020-02-10 20:18:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:09,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:09,394 INFO L415 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] [2020-02-10 20:18:09,394 INFO L427 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1272520550, now seen corresponding path program 913 times [2020-02-10 20:18:09,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:09,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037373744] [2020-02-10 20:18:09,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:09,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037373744] [2020-02-10 20:18:09,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:09,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:09,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415770320] [2020-02-10 20:18:09,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:09,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:09,675 INFO L87 Difference]: Start difference. First operand 378 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:18:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:09,757 INFO L93 Difference]: Finished difference Result 577 states and 1698 transitions. [2020-02-10 20:18:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:09,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:09,759 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:18:09,759 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:18:09,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:18:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-02-10 20:18:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:18:09,769 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:09,769 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:18:09,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:18:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:09,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:09,770 INFO L415 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] [2020-02-10 20:18:09,770 INFO L427 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:09,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:09,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1833589042, now seen corresponding path program 914 times [2020-02-10 20:18:09,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:09,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969097821] [2020-02-10 20:18:09,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:10,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969097821] [2020-02-10 20:18:10,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:10,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:10,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261984952] [2020-02-10 20:18:10,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:10,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:10,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:10,038 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:10,121 INFO L93 Difference]: Finished difference Result 570 states and 1683 transitions. [2020-02-10 20:18:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:10,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:10,122 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:18:10,123 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:18:10,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:18:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 382. [2020-02-10 20:18:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 20:18:10,131 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 20:18:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:10,131 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 20:18:10,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 20:18:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:10,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:10,132 INFO L415 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] [2020-02-10 20:18:10,132 INFO L427 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:10,132 INFO L82 PathProgramCache]: Analyzing trace with hash -327917304, now seen corresponding path program 915 times [2020-02-10 20:18:10,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:10,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959588577] [2020-02-10 20:18:10,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:10,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959588577] [2020-02-10 20:18:10,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:10,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:10,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124359904] [2020-02-10 20:18:10,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:10,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:10,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:10,402 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:18:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:10,485 INFO L93 Difference]: Finished difference Result 579 states and 1701 transitions. [2020-02-10 20:18:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:10,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:10,486 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:18:10,486 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:18:10,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:18:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 20:18:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 20:18:10,496 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:10,496 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 20:18:10,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 20:18:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:10,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:10,497 INFO L415 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] [2020-02-10 20:18:10,497 INFO L427 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1290120966, now seen corresponding path program 916 times [2020-02-10 20:18:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:10,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241508719] [2020-02-10 20:18:10,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:10,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241508719] [2020-02-10 20:18:10,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:10,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:10,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872899028] [2020-02-10 20:18:10,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:10,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:10,761 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:10,873 INFO L93 Difference]: Finished difference Result 573 states and 1687 transitions. [2020-02-10 20:18:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:10,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:10,875 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:18:10,875 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:18:10,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:18:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:18:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 20:18:10,884 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 20:18:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:10,885 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 20:18:10,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 20:18:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:10,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:10,885 INFO L415 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] [2020-02-10 20:18:10,885 INFO L427 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash -273195078, now seen corresponding path program 917 times [2020-02-10 20:18:10,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:10,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650491605] [2020-02-10 20:18:10,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:11,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650491605] [2020-02-10 20:18:11,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:11,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:11,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713220298] [2020-02-10 20:18:11,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:11,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:11,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:11,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:11,191 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:18:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:11,277 INFO L93 Difference]: Finished difference Result 563 states and 1668 transitions. [2020-02-10 20:18:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:11,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:11,279 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:18:11,279 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:18:11,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:18:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-02-10 20:18:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:18:11,289 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:11,289 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:18:11,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:18:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:11,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:11,290 INFO L415 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] [2020-02-10 20:18:11,290 INFO L427 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1337745880, now seen corresponding path program 918 times [2020-02-10 20:18:11,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:11,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605419993] [2020-02-10 20:18:11,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:11,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605419993] [2020-02-10 20:18:11,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:11,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:11,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293729023] [2020-02-10 20:18:11,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:11,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:11,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:11,575 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:11,686 INFO L93 Difference]: Finished difference Result 564 states and 1669 transitions. [2020-02-10 20:18:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:11,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:11,688 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:18:11,688 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:18:11,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:18:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 380. [2020-02-10 20:18:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1313 transitions. [2020-02-10 20:18:11,697 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1313 transitions. Word has length 22 [2020-02-10 20:18:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:11,697 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1313 transitions. [2020-02-10 20:18:11,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1313 transitions. [2020-02-10 20:18:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:11,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:11,698 INFO L415 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] [2020-02-10 20:18:11,698 INFO L427 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1693749326, now seen corresponding path program 919 times [2020-02-10 20:18:11,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:11,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459653187] [2020-02-10 20:18:11,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:11,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459653187] [2020-02-10 20:18:11,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:11,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:11,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184299004] [2020-02-10 20:18:11,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:11,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:11,973 INFO L87 Difference]: Start difference. First operand 380 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:18:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:12,081 INFO L93 Difference]: Finished difference Result 579 states and 1702 transitions. [2020-02-10 20:18:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:12,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:12,082 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:18:12,083 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:18:12,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:18:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 20:18:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1321 transitions. [2020-02-10 20:18:12,091 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1321 transitions. Word has length 22 [2020-02-10 20:18:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:12,091 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1321 transitions. [2020-02-10 20:18:12,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1321 transitions. [2020-02-10 20:18:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:12,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:12,092 INFO L415 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] [2020-02-10 20:18:12,092 INFO L427 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:12,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1132680834, now seen corresponding path program 920 times [2020-02-10 20:18:12,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:12,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994718213] [2020-02-10 20:18:12,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:12,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994718213] [2020-02-10 20:18:12,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:12,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:12,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933360907] [2020-02-10 20:18:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:12,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:12,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:12,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:12,371 INFO L87 Difference]: Start difference. First operand 384 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:18:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:12,460 INFO L93 Difference]: Finished difference Result 572 states and 1687 transitions. [2020-02-10 20:18:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:12,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:12,462 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:18:12,462 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:18:12,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:18:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 20:18:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 20:18:12,471 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 20:18:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:12,471 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 20:18:12,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 20:18:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:12,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:12,472 INFO L415 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] [2020-02-10 20:18:12,472 INFO L427 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2013472648, now seen corresponding path program 921 times [2020-02-10 20:18:12,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:12,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188049315] [2020-02-10 20:18:12,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:12,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188049315] [2020-02-10 20:18:12,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:12,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961764344] [2020-02-10 20:18:12,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:12,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:12,772 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:18:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:12,849 INFO L93 Difference]: Finished difference Result 577 states and 1701 transitions. [2020-02-10 20:18:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:12,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:12,851 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:18:12,851 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:18:12,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:18:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 387. [2020-02-10 20:18:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-02-10 20:18:12,860 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-02-10 20:18:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:12,861 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-02-10 20:18:12,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-02-10 20:18:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:12,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:12,861 INFO L415 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] [2020-02-10 20:18:12,862 INFO L427 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash -259577990, now seen corresponding path program 922 times [2020-02-10 20:18:12,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:12,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035752348] [2020-02-10 20:18:12,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:13,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035752348] [2020-02-10 20:18:13,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:13,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:13,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559525997] [2020-02-10 20:18:13,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:13,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:13,140 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:18:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:13,246 INFO L93 Difference]: Finished difference Result 564 states and 1681 transitions. [2020-02-10 20:18:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:13,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:13,247 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:18:13,248 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:18:13,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:18:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-02-10 20:18:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:18:13,257 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:18:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:13,257 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:18:13,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:18:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:13,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:13,257 INFO L415 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] [2020-02-10 20:18:13,257 INFO L427 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2068194874, now seen corresponding path program 923 times [2020-02-10 20:18:13,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:13,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110943044] [2020-02-10 20:18:13,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:13,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110943044] [2020-02-10 20:18:13,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:13,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:13,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511062308] [2020-02-10 20:18:13,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:13,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:13,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:13,540 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:18:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:13,629 INFO L93 Difference]: Finished difference Result 566 states and 1675 transitions. [2020-02-10 20:18:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:13,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:13,631 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:18:13,631 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:18:13,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:18:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 383. [2020-02-10 20:18:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 20:18:13,640 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 20:18:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:13,640 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 20:18:13,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 20:18:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:13,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:13,641 INFO L415 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] [2020-02-10 20:18:13,641 INFO L427 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1691542620, now seen corresponding path program 924 times [2020-02-10 20:18:13,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:13,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181800057] [2020-02-10 20:18:13,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:13,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181800057] [2020-02-10 20:18:13,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:13,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:13,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50912692] [2020-02-10 20:18:13,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:13,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:13,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:13,917 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:18:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:14,017 INFO L93 Difference]: Finished difference Result 560 states and 1672 transitions. [2020-02-10 20:18:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:14,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:14,019 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:18:14,019 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:18:14,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:18:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 380. [2020-02-10 20:18:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 20:18:14,028 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 20:18:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,028 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 20:18:14,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 20:18:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:14,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,029 INFO L415 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] [2020-02-10 20:18:14,029 INFO L427 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1368153102, now seen corresponding path program 925 times [2020-02-10 20:18:14,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281025382] [2020-02-10 20:18:14,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:14,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281025382] [2020-02-10 20:18:14,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:14,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:14,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645663393] [2020-02-10 20:18:14,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:14,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:14,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:14,315 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:18:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:14,396 INFO L93 Difference]: Finished difference Result 584 states and 1714 transitions. [2020-02-10 20:18:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:14,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:14,398 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:18:14,398 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:18:14,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:18:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 386. [2020-02-10 20:18:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 20:18:14,407 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 20:18:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,407 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 20:18:14,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 20:18:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:14,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,407 INFO L415 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] [2020-02-10 20:18:14,408 INFO L427 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1964610532, now seen corresponding path program 926 times [2020-02-10 20:18:14,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145311656] [2020-02-10 20:18:14,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:14,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145311656] [2020-02-10 20:18:14,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:14,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:14,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878299116] [2020-02-10 20:18:14,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:14,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:14,675 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:18:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:14,769 INFO L93 Difference]: Finished difference Result 578 states and 1700 transitions. [2020-02-10 20:18:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:14,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:14,770 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:18:14,771 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:18:14,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:18:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 383. [2020-02-10 20:18:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:18:14,780 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,780 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:18:14,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:18:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:14,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,781 INFO L415 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] [2020-02-10 20:18:14,781 INFO L427 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -355460570, now seen corresponding path program 927 times [2020-02-10 20:18:14,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109427853] [2020-02-10 20:18:14,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:15,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109427853] [2020-02-10 20:18:15,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:15,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:15,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413322258] [2020-02-10 20:18:15,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:15,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:15,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:15,072 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:15,161 INFO L93 Difference]: Finished difference Result 580 states and 1707 transitions. [2020-02-10 20:18:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:15,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:15,163 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:18:15,163 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:18:15,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:18:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-02-10 20:18:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-02-10 20:18:15,172 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-02-10 20:18:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:15,172 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-02-10 20:18:15,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-02-10 20:18:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:15,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:15,172 INFO L415 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] [2020-02-10 20:18:15,173 INFO L427 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1666456088, now seen corresponding path program 928 times [2020-02-10 20:18:15,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:15,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647005299] [2020-02-10 20:18:15,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:15,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647005299] [2020-02-10 20:18:15,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:15,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:15,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278742366] [2020-02-10 20:18:15,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:15,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:15,451 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:18:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:15,550 INFO L93 Difference]: Finished difference Result 567 states and 1687 transitions. [2020-02-10 20:18:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:15,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:15,552 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:18:15,552 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:18:15,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:18:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 383. [2020-02-10 20:18:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1315 transitions. [2020-02-10 20:18:15,561 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1315 transitions. Word has length 22 [2020-02-10 20:18:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:15,562 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1315 transitions. [2020-02-10 20:18:15,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1315 transitions. [2020-02-10 20:18:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:15,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:15,562 INFO L415 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] [2020-02-10 20:18:15,562 INFO L427 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash 361118400, now seen corresponding path program 929 times [2020-02-10 20:18:15,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:15,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385454898] [2020-02-10 20:18:15,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:15,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385454898] [2020-02-10 20:18:15,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:15,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:15,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931478285] [2020-02-10 20:18:15,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:15,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:15,842 INFO L87 Difference]: Start difference. First operand 383 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:18:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:15,948 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-02-10 20:18:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:15,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:15,949 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:18:15,950 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:18:15,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:18:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 385. [2020-02-10 20:18:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 20:18:15,958 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:15,959 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 20:18:15,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 20:18:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:15,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:15,959 INFO L415 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] [2020-02-10 20:18:15,960 INFO L427 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash 187870708, now seen corresponding path program 930 times [2020-02-10 20:18:15,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:15,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912024034] [2020-02-10 20:18:15,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:16,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912024034] [2020-02-10 20:18:16,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:16,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:16,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471250132] [2020-02-10 20:18:16,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:16,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:16,235 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:16,348 INFO L93 Difference]: Finished difference Result 564 states and 1679 transitions. [2020-02-10 20:18:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:16,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:16,350 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:18:16,350 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:18:16,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:18:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2020-02-10 20:18:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2020-02-10 20:18:16,359 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 22 [2020-02-10 20:18:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:16,359 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2020-02-10 20:18:16,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2020-02-10 20:18:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:16,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:16,360 INFO L415 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] [2020-02-10 20:18:16,360 INFO L427 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:16,360 INFO L82 PathProgramCache]: Analyzing trace with hash 169704062, now seen corresponding path program 931 times [2020-02-10 20:18:16,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:16,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216889377] [2020-02-10 20:18:16,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:16,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216889377] [2020-02-10 20:18:16,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:16,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:16,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403133098] [2020-02-10 20:18:16,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:16,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:16,658 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:18:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:16,738 INFO L93 Difference]: Finished difference Result 555 states and 1650 transitions. [2020-02-10 20:18:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:16,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:16,740 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:18:16,740 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:18:16,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:18:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 382. [2020-02-10 20:18:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-02-10 20:18:16,749 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-02-10 20:18:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:16,749 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-02-10 20:18:16,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-02-10 20:18:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:16,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:16,750 INFO L415 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] [2020-02-10 20:18:16,750 INFO L427 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1780645020, now seen corresponding path program 932 times [2020-02-10 20:18:16,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:16,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000728141] [2020-02-10 20:18:16,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:17,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000728141] [2020-02-10 20:18:17,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:17,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:17,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558890862] [2020-02-10 20:18:17,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:17,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:17,042 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:18:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:17,155 INFO L93 Difference]: Finished difference Result 556 states and 1651 transitions. [2020-02-10 20:18:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:17,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:17,157 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:18:17,157 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:18:17,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:18:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 381. [2020-02-10 20:18:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-02-10 20:18:17,165 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-02-10 20:18:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:17,165 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-02-10 20:18:17,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-02-10 20:18:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:17,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:17,166 INFO L415 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] [2020-02-10 20:18:17,166 INFO L427 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:17,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1182396594, now seen corresponding path program 933 times [2020-02-10 20:18:17,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:17,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289599605] [2020-02-10 20:18:17,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:17,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289599605] [2020-02-10 20:18:17,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:17,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:17,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125194820] [2020-02-10 20:18:17,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:17,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:17,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:17,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:17,449 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:18:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:17,539 INFO L93 Difference]: Finished difference Result 556 states and 1652 transitions. [2020-02-10 20:18:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:17,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:17,541 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:18:17,541 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:18:17,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:18:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-02-10 20:18:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 20:18:17,549 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 20:18:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:17,549 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 20:18:17,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 20:18:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:17,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:17,550 INFO L415 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] [2020-02-10 20:18:17,550 INFO L427 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1717626396, now seen corresponding path program 934 times [2020-02-10 20:18:17,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:17,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540298214] [2020-02-10 20:18:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:17,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540298214] [2020-02-10 20:18:17,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:17,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:17,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070141626] [2020-02-10 20:18:17,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:17,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:17,841 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:18:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:17,956 INFO L93 Difference]: Finished difference Result 550 states and 1649 transitions. [2020-02-10 20:18:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:17,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:17,958 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:18:17,958 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:18:17,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:18:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-02-10 20:18:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 20:18:17,966 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:17,966 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 20:18:17,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 20:18:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:17,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:17,967 INFO L415 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] [2020-02-10 20:18:17,967 INFO L427 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1192899698, now seen corresponding path program 935 times [2020-02-10 20:18:17,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:17,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117035997] [2020-02-10 20:18:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:18,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117035997] [2020-02-10 20:18:18,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:18,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:18,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129546276] [2020-02-10 20:18:18,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:18,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:18,244 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:18,345 INFO L93 Difference]: Finished difference Result 558 states and 1656 transitions. [2020-02-10 20:18:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:18,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:18,346 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:18:18,347 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:18:18,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:18:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 20:18:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 20:18:18,355 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 20:18:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:18,355 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 20:18:18,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 20:18:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:18,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:18,356 INFO L415 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] [2020-02-10 20:18:18,356 INFO L427 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 117188542, now seen corresponding path program 936 times [2020-02-10 20:18:18,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:18,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573765099] [2020-02-10 20:18:18,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:18,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573765099] [2020-02-10 20:18:18,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:18,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:18,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694384508] [2020-02-10 20:18:18,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:18,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:18,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:18,634 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:18:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:18,741 INFO L93 Difference]: Finished difference Result 551 states and 1650 transitions. [2020-02-10 20:18:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:18,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:18,743 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:18:18,743 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:18:18,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:18:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 378. [2020-02-10 20:18:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:18:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1305 transitions. [2020-02-10 20:18:18,752 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1305 transitions. Word has length 22 [2020-02-10 20:18:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:18,752 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1305 transitions. [2020-02-10 20:18:18,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1305 transitions. [2020-02-10 20:18:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:18,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:18,753 INFO L415 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] [2020-02-10 20:18:18,753 INFO L427 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1209640248, now seen corresponding path program 937 times [2020-02-10 20:18:18,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:18,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850201315] [2020-02-10 20:18:18,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:19,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850201315] [2020-02-10 20:18:19,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:19,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:19,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838781199] [2020-02-10 20:18:19,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:19,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:19,044 INFO L87 Difference]: Start difference. First operand 378 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:18:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:19,145 INFO L93 Difference]: Finished difference Result 546 states and 1632 transitions. [2020-02-10 20:18:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:19,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:19,147 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:18:19,147 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:18:19,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:18:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 381. [2020-02-10 20:18:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-02-10 20:18:19,156 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-02-10 20:18:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:19,156 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-02-10 20:18:19,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-02-10 20:18:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:19,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:19,157 INFO L415 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] [2020-02-10 20:18:19,157 INFO L427 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1639810038, now seen corresponding path program 938 times [2020-02-10 20:18:19,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:19,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76610693] [2020-02-10 20:18:19,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:19,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76610693] [2020-02-10 20:18:19,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:19,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:19,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695536835] [2020-02-10 20:18:19,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:19,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:19,467 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:18:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:19,549 INFO L93 Difference]: Finished difference Result 544 states and 1627 transitions. [2020-02-10 20:18:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:19,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:19,550 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:18:19,551 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:18:19,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:18:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 380. [2020-02-10 20:18:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 20:18:19,559 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 20:18:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:19,559 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 20:18:19,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 20:18:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:19,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:19,560 INFO L415 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] [2020-02-10 20:18:19,560 INFO L427 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1484889194, now seen corresponding path program 939 times [2020-02-10 20:18:19,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:19,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096684247] [2020-02-10 20:18:19,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:19,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096684247] [2020-02-10 20:18:19,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:19,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:19,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258756418] [2020-02-10 20:18:19,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:19,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:19,852 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:18:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:19,955 INFO L93 Difference]: Finished difference Result 548 states and 1636 transitions. [2020-02-10 20:18:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:19,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:19,957 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:18:19,957 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:18:19,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:18:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 382. [2020-02-10 20:18:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 20:18:19,965 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 20:18:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:19,965 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 20:18:19,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 20:18:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:19,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:19,966 INFO L415 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] [2020-02-10 20:18:19,966 INFO L427 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1737981946, now seen corresponding path program 940 times [2020-02-10 20:18:19,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:19,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141997157] [2020-02-10 20:18:19,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:20,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141997157] [2020-02-10 20:18:20,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:20,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:20,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417391867] [2020-02-10 20:18:20,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:20,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:20,266 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:18:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:20,380 INFO L93 Difference]: Finished difference Result 547 states and 1632 transitions. [2020-02-10 20:18:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:20,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:20,382 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:18:20,382 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:18:20,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:18:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 20:18:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-02-10 20:18:20,391 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:20,391 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-02-10 20:18:20,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-02-10 20:18:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:20,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:20,392 INFO L415 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] [2020-02-10 20:18:20,392 INFO L427 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1561065670, now seen corresponding path program 941 times [2020-02-10 20:18:20,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:20,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520896614] [2020-02-10 20:18:20,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:20,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520896614] [2020-02-10 20:18:20,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:20,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:20,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778445265] [2020-02-10 20:18:20,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:20,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:20,693 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:20,772 INFO L93 Difference]: Finished difference Result 543 states and 1624 transitions. [2020-02-10 20:18:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:20,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:20,774 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:18:20,774 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:18:20,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:18:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2020-02-10 20:18:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-02-10 20:18:20,783 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-02-10 20:18:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:20,784 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-02-10 20:18:20,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-02-10 20:18:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:20,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:20,784 INFO L415 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] [2020-02-10 20:18:20,784 INFO L427 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash 49875288, now seen corresponding path program 942 times [2020-02-10 20:18:20,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:20,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177108006] [2020-02-10 20:18:20,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:21,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177108006] [2020-02-10 20:18:21,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:21,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438121448] [2020-02-10 20:18:21,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:21,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:21,100 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:18:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:21,208 INFO L93 Difference]: Finished difference Result 544 states and 1625 transitions. [2020-02-10 20:18:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:21,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:21,210 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:18:21,210 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:18:21,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:18:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2020-02-10 20:18:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:18:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1308 transitions. [2020-02-10 20:18:21,219 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1308 transitions. Word has length 22 [2020-02-10 20:18:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:21,219 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1308 transitions. [2020-02-10 20:18:21,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1308 transitions. [2020-02-10 20:18:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:21,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:21,220 INFO L415 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] [2020-02-10 20:18:21,220 INFO L427 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash 119057172, now seen corresponding path program 943 times [2020-02-10 20:18:21,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:21,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009936882] [2020-02-10 20:18:21,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:21,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009936882] [2020-02-10 20:18:21,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:21,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:21,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149450116] [2020-02-10 20:18:21,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:21,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:21,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:21,509 INFO L87 Difference]: Start difference. First operand 379 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:18:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:21,609 INFO L93 Difference]: Finished difference Result 548 states and 1636 transitions. [2020-02-10 20:18:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:21,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:21,611 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:18:21,611 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:18:21,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:18:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-02-10 20:18:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 20:18:21,620 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 20:18:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:21,620 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 20:18:21,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 20:18:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:21,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:21,620 INFO L415 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] [2020-02-10 20:18:21,621 INFO L427 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1326459838, now seen corresponding path program 944 times [2020-02-10 20:18:21,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:21,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103648457] [2020-02-10 20:18:21,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:21,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103648457] [2020-02-10 20:18:21,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:21,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:21,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743684088] [2020-02-10 20:18:21,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:21,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:21,912 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:18:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:22,002 INFO L93 Difference]: Finished difference Result 546 states and 1631 transitions. [2020-02-10 20:18:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:22,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:22,004 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:18:22,004 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:18:22,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:18:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 380. [2020-02-10 20:18:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-02-10 20:18:22,012 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:22,012 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-02-10 20:18:22,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-02-10 20:18:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:22,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:22,013 INFO L415 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] [2020-02-10 20:18:22,013 INFO L427 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:22,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash -468688150, now seen corresponding path program 945 times [2020-02-10 20:18:22,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:22,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576924960] [2020-02-10 20:18:22,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:22,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576924960] [2020-02-10 20:18:22,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:22,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:22,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045108230] [2020-02-10 20:18:22,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:22,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:22,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:22,300 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:22,405 INFO L93 Difference]: Finished difference Result 550 states and 1642 transitions. [2020-02-10 20:18:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:22,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:22,407 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:18:22,407 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:18:22,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:18:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 383. [2020-02-10 20:18:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1315 transitions. [2020-02-10 20:18:22,417 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1315 transitions. Word has length 22 [2020-02-10 20:18:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:22,417 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1315 transitions. [2020-02-10 20:18:22,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1315 transitions. [2020-02-10 20:18:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:22,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:22,417 INFO L415 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] [2020-02-10 20:18:22,418 INFO L427 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash -166670206, now seen corresponding path program 946 times [2020-02-10 20:18:22,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:22,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057043399] [2020-02-10 20:18:22,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:22,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057043399] [2020-02-10 20:18:22,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:22,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:22,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555503415] [2020-02-10 20:18:22,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:22,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:22,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:22,717 INFO L87 Difference]: Start difference. First operand 383 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:18:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:22,823 INFO L93 Difference]: Finished difference Result 542 states and 1633 transitions. [2020-02-10 20:18:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:22,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:22,825 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:18:22,825 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 20:18:22,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 20:18:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 380. [2020-02-10 20:18:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2020-02-10 20:18:22,834 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 22 [2020-02-10 20:18:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:22,834 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2020-02-10 20:18:22,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2020-02-10 20:18:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:22,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:22,835 INFO L415 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] [2020-02-10 20:18:22,835 INFO L427 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash 780324282, now seen corresponding path program 947 times [2020-02-10 20:18:22,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:22,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675220259] [2020-02-10 20:18:22,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675220259] [2020-02-10 20:18:23,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:23,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990026682] [2020-02-10 20:18:23,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:23,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:23,124 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:18:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:23,204 INFO L93 Difference]: Finished difference Result 546 states and 1631 transitions. [2020-02-10 20:18:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:23,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:23,206 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:18:23,206 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:18:23,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:18:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-02-10 20:18:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 20:18:23,215 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:23,216 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 20:18:23,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 20:18:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:23,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:23,216 INFO L415 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] [2020-02-10 20:18:23,216 INFO L427 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1315554084, now seen corresponding path program 948 times [2020-02-10 20:18:23,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:23,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250408962] [2020-02-10 20:18:23,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250408962] [2020-02-10 20:18:23,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:23,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193273806] [2020-02-10 20:18:23,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:23,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:23,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:23,503 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:23,612 INFO L93 Difference]: Finished difference Result 540 states and 1628 transitions. [2020-02-10 20:18:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:23,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:23,614 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:18:23,614 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:18:23,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:18:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2020-02-10 20:18:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:18:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1307 transitions. [2020-02-10 20:18:23,623 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1307 transitions. Word has length 22 [2020-02-10 20:18:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:23,623 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1307 transitions. [2020-02-10 20:18:23,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1307 transitions. [2020-02-10 20:18:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:23,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:23,624 INFO L415 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] [2020-02-10 20:18:23,624 INFO L427 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash 444653396, now seen corresponding path program 949 times [2020-02-10 20:18:23,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:23,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114351228] [2020-02-10 20:18:23,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114351228] [2020-02-10 20:18:23,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:23,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481509104] [2020-02-10 20:18:23,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:23,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:23,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:23,910 INFO L87 Difference]: Start difference. First operand 379 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:18:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:24,008 INFO L93 Difference]: Finished difference Result 553 states and 1649 transitions. [2020-02-10 20:18:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:24,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:24,009 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:18:24,009 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:18:24,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:18:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 383. [2020-02-10 20:18:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1317 transitions. [2020-02-10 20:18:24,018 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1317 transitions. Word has length 22 [2020-02-10 20:18:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:24,019 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1317 transitions. [2020-02-10 20:18:24,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1317 transitions. [2020-02-10 20:18:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:24,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:24,019 INFO L415 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] [2020-02-10 20:18:24,019 INFO L427 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 697746148, now seen corresponding path program 950 times [2020-02-10 20:18:24,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:24,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154408596] [2020-02-10 20:18:24,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:24,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154408596] [2020-02-10 20:18:24,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:24,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:24,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938048668] [2020-02-10 20:18:24,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:24,307 INFO L87 Difference]: Start difference. First operand 383 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:18:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:24,424 INFO L93 Difference]: Finished difference Result 552 states and 1645 transitions. [2020-02-10 20:18:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:24,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:24,425 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:18:24,426 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:18:24,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:18:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 381. [2020-02-10 20:18:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 20:18:24,435 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 20:18:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:24,435 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 20:18:24,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 20:18:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:24,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:24,436 INFO L415 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] [2020-02-10 20:18:24,436 INFO L427 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:24,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1457345928, now seen corresponding path program 951 times [2020-02-10 20:18:24,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:24,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756232191] [2020-02-10 20:18:24,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756232191] [2020-02-10 20:18:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:24,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298433346] [2020-02-10 20:18:24,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:24,724 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:18:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:24,822 INFO L93 Difference]: Finished difference Result 553 states and 1649 transitions. [2020-02-10 20:18:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:24,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:24,824 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:18:24,824 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:18:24,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:18:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 384. [2020-02-10 20:18:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:18:24,833 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:18:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:24,833 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:18:24,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:18:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:24,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:24,833 INFO L415 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] [2020-02-10 20:18:24,834 INFO L427 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1759363872, now seen corresponding path program 952 times [2020-02-10 20:18:24,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:24,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051791892] [2020-02-10 20:18:24,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:25,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051791892] [2020-02-10 20:18:25,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:25,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:25,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657972595] [2020-02-10 20:18:25,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:25,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:25,123 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:18:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:25,235 INFO L93 Difference]: Finished difference Result 545 states and 1640 transitions. [2020-02-10 20:18:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:25,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:25,237 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:18:25,237 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:18:25,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:18:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 381. [2020-02-10 20:18:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 20:18:25,246 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:25,246 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 20:18:25,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 20:18:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:25,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:25,247 INFO L415 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] [2020-02-10 20:18:25,247 INFO L427 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash 167339396, now seen corresponding path program 953 times [2020-02-10 20:18:25,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:25,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704254224] [2020-02-10 20:18:25,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:25,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704254224] [2020-02-10 20:18:25,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:25,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:25,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312261373] [2020-02-10 20:18:25,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:25,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:25,530 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:25,634 INFO L93 Difference]: Finished difference Result 551 states and 1642 transitions. [2020-02-10 20:18:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:25,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:25,635 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:18:25,636 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:18:25,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:18:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2020-02-10 20:18:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 20:18:25,645 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 20:18:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:25,645 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 20:18:25,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 20:18:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:25,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:25,646 INFO L415 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] [2020-02-10 20:18:25,646 INFO L427 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash -5908296, now seen corresponding path program 954 times [2020-02-10 20:18:25,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:25,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779620724] [2020-02-10 20:18:25,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:25,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779620724] [2020-02-10 20:18:25,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:25,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:25,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487109378] [2020-02-10 20:18:25,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:25,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:25,940 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:18:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:26,044 INFO L93 Difference]: Finished difference Result 544 states and 1636 transitions. [2020-02-10 20:18:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:26,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:26,046 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:18:26,046 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:18:26,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:18:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-02-10 20:18:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:18:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1306 transitions. [2020-02-10 20:18:26,055 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1306 transitions. Word has length 22 [2020-02-10 20:18:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:26,056 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1306 transitions. [2020-02-10 20:18:26,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1306 transitions. [2020-02-10 20:18:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:26,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:26,056 INFO L415 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] [2020-02-10 20:18:26,056 INFO L427 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash -675267390, now seen corresponding path program 955 times [2020-02-10 20:18:26,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:26,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399965701] [2020-02-10 20:18:26,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:26,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399965701] [2020-02-10 20:18:26,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:26,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:26,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148201457] [2020-02-10 20:18:26,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:26,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:26,349 INFO L87 Difference]: Start difference. First operand 379 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:18:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:26,440 INFO L93 Difference]: Finished difference Result 543 states and 1623 transitions. [2020-02-10 20:18:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:26,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:26,441 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:18:26,441 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:18:26,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:18:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2020-02-10 20:18:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 20:18:26,451 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:26,451 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 20:18:26,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 20:18:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:26,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:26,452 INFO L415 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] [2020-02-10 20:18:26,452 INFO L427 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash 935673568, now seen corresponding path program 956 times [2020-02-10 20:18:26,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:26,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431329316] [2020-02-10 20:18:26,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:26,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431329316] [2020-02-10 20:18:26,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:26,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:26,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027947636] [2020-02-10 20:18:26,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:26,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:26,744 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:26,841 INFO L93 Difference]: Finished difference Result 544 states and 1624 transitions. [2020-02-10 20:18:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:26,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:26,843 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:18:26,843 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:18:26,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:18:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2020-02-10 20:18:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1308 transitions. [2020-02-10 20:18:26,851 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1308 transitions. Word has length 22 [2020-02-10 20:18:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:26,851 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1308 transitions. [2020-02-10 20:18:26,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1308 transitions. [2020-02-10 20:18:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:26,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:26,852 INFO L415 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] [2020-02-10 20:18:26,852 INFO L427 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 337425142, now seen corresponding path program 957 times [2020-02-10 20:18:26,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:26,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000030901] [2020-02-10 20:18:26,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:27,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000030901] [2020-02-10 20:18:27,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:27,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125397324] [2020-02-10 20:18:27,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:27,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:27,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:27,141 INFO L87 Difference]: Start difference. First operand 380 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:18:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:27,218 INFO L93 Difference]: Finished difference Result 544 states and 1625 transitions. [2020-02-10 20:18:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:27,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:27,219 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:18:27,219 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:18:27,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:18:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 381. [2020-02-10 20:18:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-02-10 20:18:27,229 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-02-10 20:18:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:27,229 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-02-10 20:18:27,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-02-10 20:18:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:27,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:27,229 INFO L415 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] [2020-02-10 20:18:27,229 INFO L427 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash 872654944, now seen corresponding path program 958 times [2020-02-10 20:18:27,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:27,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285422915] [2020-02-10 20:18:27,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:27,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285422915] [2020-02-10 20:18:27,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924002307] [2020-02-10 20:18:27,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:27,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:27,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:27,520 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:18:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:27,633 INFO L93 Difference]: Finished difference Result 538 states and 1622 transitions. [2020-02-10 20:18:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:27,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:27,634 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:18:27,634 INFO L226 Difference]: Without dead ends: 525 [2020-02-10 20:18:27,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-02-10 20:18:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 380. [2020-02-10 20:18:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:18:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-02-10 20:18:27,643 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-02-10 20:18:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:27,643 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-02-10 20:18:27,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-02-10 20:18:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:27,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:27,644 INFO L415 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] [2020-02-10 20:18:27,644 INFO L427 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 347928246, now seen corresponding path program 959 times [2020-02-10 20:18:27,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:27,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677467788] [2020-02-10 20:18:27,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:27,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677467788] [2020-02-10 20:18:27,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:27,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735867180] [2020-02-10 20:18:27,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:27,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:27,929 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:18:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:28,038 INFO L93 Difference]: Finished difference Result 546 states and 1629 transitions. [2020-02-10 20:18:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:28,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:28,040 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:18:28,040 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:18:28,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:18:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-02-10 20:18:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 20:18:28,048 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:28,048 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 20:18:28,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 20:18:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:28,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:28,049 INFO L415 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] [2020-02-10 20:18:28,049 INFO L427 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash -727782910, now seen corresponding path program 960 times [2020-02-10 20:18:28,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:28,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123241942] [2020-02-10 20:18:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:28,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123241942] [2020-02-10 20:18:28,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:28,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:28,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115547694] [2020-02-10 20:18:28,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:28,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:28,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:28,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:28,337 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:28,442 INFO L93 Difference]: Finished difference Result 539 states and 1623 transitions. [2020-02-10 20:18:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:28,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:28,444 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:18:28,444 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:18:28,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:18:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 376. [2020-02-10 20:18:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:18:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1301 transitions. [2020-02-10 20:18:28,452 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1301 transitions. Word has length 22 [2020-02-10 20:18:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:28,453 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1301 transitions. [2020-02-10 20:18:28,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1301 transitions. [2020-02-10 20:18:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:28,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:28,453 INFO L415 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] [2020-02-10 20:18:28,453 INFO L427 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:28,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1280120566, now seen corresponding path program 961 times [2020-02-10 20:18:28,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:28,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509098512] [2020-02-10 20:18:28,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:28,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509098512] [2020-02-10 20:18:28,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:28,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:28,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340234255] [2020-02-10 20:18:28,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:28,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:28,720 INFO L87 Difference]: Start difference. First operand 376 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:18:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:28,815 INFO L93 Difference]: Finished difference Result 620 states and 1820 transitions. [2020-02-10 20:18:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:28,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:28,817 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:18:28,817 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:18:28,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:18:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 388. [2020-02-10 20:18:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 20:18:28,826 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 20:18:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:28,826 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 20:18:28,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 20:18:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:28,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:28,827 INFO L415 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] [2020-02-10 20:18:28,827 INFO L427 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1424580844, now seen corresponding path program 962 times [2020-02-10 20:18:28,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:28,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430480563] [2020-02-10 20:18:28,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:29,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430480563] [2020-02-10 20:18:29,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:29,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:29,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646058201] [2020-02-10 20:18:29,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:29,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:29,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:29,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:29,093 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:18:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:29,190 INFO L93 Difference]: Finished difference Result 615 states and 1807 transitions. [2020-02-10 20:18:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:29,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:29,192 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:18:29,192 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:18:29,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:18:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 384. [2020-02-10 20:18:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-02-10 20:18:29,201 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-02-10 20:18:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:29,202 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-02-10 20:18:29,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-02-10 20:18:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:29,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:29,202 INFO L415 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] [2020-02-10 20:18:29,202 INFO L427 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1662296410, now seen corresponding path program 963 times [2020-02-10 20:18:29,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:29,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697167] [2020-02-10 20:18:29,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:29,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697167] [2020-02-10 20:18:29,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:29,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:29,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149389395] [2020-02-10 20:18:29,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:29,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:29,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:29,467 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:18:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:29,549 INFO L93 Difference]: Finished difference Result 616 states and 1808 transitions. [2020-02-10 20:18:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:29,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:29,551 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:18:29,551 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:18:29,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:18:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 386. [2020-02-10 20:18:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-02-10 20:18:29,561 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-02-10 20:18:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:29,561 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-02-10 20:18:29,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-02-10 20:18:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:29,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:29,561 INFO L415 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] [2020-02-10 20:18:29,562 INFO L427 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1101227918, now seen corresponding path program 964 times [2020-02-10 20:18:29,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:29,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320179315] [2020-02-10 20:18:29,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:29,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320179315] [2020-02-10 20:18:29,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:29,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:29,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143768420] [2020-02-10 20:18:29,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:29,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:29,826 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:18:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:29,919 INFO L93 Difference]: Finished difference Result 609 states and 1793 transitions. [2020-02-10 20:18:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:29,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:29,920 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:18:29,921 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:18:29,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:18:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 384. [2020-02-10 20:18:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1328 transitions. [2020-02-10 20:18:29,930 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1328 transitions. Word has length 22 [2020-02-10 20:18:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:29,930 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1328 transitions. [2020-02-10 20:18:29,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1328 transitions. [2020-02-10 20:18:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:29,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:29,931 INFO L415 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] [2020-02-10 20:18:29,931 INFO L427 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1438380680, now seen corresponding path program 965 times [2020-02-10 20:18:29,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:29,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446988923] [2020-02-10 20:18:29,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:30,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446988923] [2020-02-10 20:18:30,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:30,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:30,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409069975] [2020-02-10 20:18:30,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:30,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:30,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:30,209 INFO L87 Difference]: Start difference. First operand 384 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:18:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:30,322 INFO L93 Difference]: Finished difference Result 605 states and 1786 transitions. [2020-02-10 20:18:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:30,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:30,324 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:18:30,324 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:18:30,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:18:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 385. [2020-02-10 20:18:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1329 transitions. [2020-02-10 20:18:30,334 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1329 transitions. Word has length 22 [2020-02-10 20:18:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:30,334 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1329 transitions. [2020-02-10 20:18:30,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1329 transitions. [2020-02-10 20:18:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:30,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:30,335 INFO L415 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] [2020-02-10 20:18:30,335 INFO L427 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -7136330, now seen corresponding path program 966 times [2020-02-10 20:18:30,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:30,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740628370] [2020-02-10 20:18:30,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:30,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740628370] [2020-02-10 20:18:30,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:30,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:30,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429232476] [2020-02-10 20:18:30,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:30,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:30,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:30,609 INFO L87 Difference]: Start difference. First operand 385 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:18:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:30,688 INFO L93 Difference]: Finished difference Result 603 states and 1781 transitions. [2020-02-10 20:18:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:30,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:30,689 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:18:30,689 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:18:30,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:18:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 382. [2020-02-10 20:18:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-02-10 20:18:30,698 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-02-10 20:18:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:30,699 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-02-10 20:18:30,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-02-10 20:18:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:30,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:30,699 INFO L415 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] [2020-02-10 20:18:30,699 INFO L427 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash -479932374, now seen corresponding path program 967 times [2020-02-10 20:18:30,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:30,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899510797] [2020-02-10 20:18:30,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:30,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899510797] [2020-02-10 20:18:30,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:30,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:30,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944302589] [2020-02-10 20:18:30,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:30,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:30,977 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:18:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:31,061 INFO L93 Difference]: Finished difference Result 636 states and 1860 transitions. [2020-02-10 20:18:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:31,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:31,063 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:18:31,063 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:18:31,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:18:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 391. [2020-02-10 20:18:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:18:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1346 transitions. [2020-02-10 20:18:31,072 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1346 transitions. Word has length 22 [2020-02-10 20:18:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:31,072 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1346 transitions. [2020-02-10 20:18:31,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1346 transitions. [2020-02-10 20:18:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:31,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:31,073 INFO L415 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] [2020-02-10 20:18:31,073 INFO L427 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1110333512, now seen corresponding path program 968 times [2020-02-10 20:18:31,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:31,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736566776] [2020-02-10 20:18:31,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:31,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736566776] [2020-02-10 20:18:31,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:31,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:31,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668278635] [2020-02-10 20:18:31,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:31,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:31,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:31,344 INFO L87 Difference]: Start difference. First operand 391 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:18:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:31,455 INFO L93 Difference]: Finished difference Result 631 states and 1847 transitions. [2020-02-10 20:18:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:31,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:31,457 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:18:31,457 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:18:31,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:18:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 387. [2020-02-10 20:18:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 20:18:31,465 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 20:18:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:31,466 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 20:18:31,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 20:18:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:31,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:31,466 INFO L415 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] [2020-02-10 20:18:31,466 INFO L427 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:31,467 INFO L82 PathProgramCache]: Analyzing trace with hash -214881510, now seen corresponding path program 969 times [2020-02-10 20:18:31,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:31,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162639674] [2020-02-10 20:18:31,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:31,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162639674] [2020-02-10 20:18:31,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:31,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:31,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227566637] [2020-02-10 20:18:31,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:31,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:31,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:31,754 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:18:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:31,832 INFO L93 Difference]: Finished difference Result 643 states and 1872 transitions. [2020-02-10 20:18:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:31,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:31,833 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:18:31,834 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:18:31,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:18:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 395. [2020-02-10 20:18:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:18:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1349 transitions. [2020-02-10 20:18:31,843 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1349 transitions. Word has length 22 [2020-02-10 20:18:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:31,844 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1349 transitions. [2020-02-10 20:18:31,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1349 transitions. [2020-02-10 20:18:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:31,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:31,844 INFO L415 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] [2020-02-10 20:18:31,844 INFO L427 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1712453060, now seen corresponding path program 970 times [2020-02-10 20:18:31,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:31,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284976221] [2020-02-10 20:18:31,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:32,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284976221] [2020-02-10 20:18:32,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:32,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:32,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968681055] [2020-02-10 20:18:32,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:32,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:32,125 INFO L87 Difference]: Start difference. First operand 395 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:18:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:32,252 INFO L93 Difference]: Finished difference Result 641 states and 1862 transitions. [2020-02-10 20:18:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:32,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:32,254 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:18:32,254 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:18:32,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:18:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 387. [2020-02-10 20:18:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 20:18:32,262 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 20:18:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:32,263 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 20:18:32,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 20:18:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:32,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:32,263 INFO L415 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] [2020-02-10 20:18:32,263 INFO L427 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1430177924, now seen corresponding path program 971 times [2020-02-10 20:18:32,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:32,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974210556] [2020-02-10 20:18:32,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:32,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974210556] [2020-02-10 20:18:32,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:32,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:32,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123360362] [2020-02-10 20:18:32,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:32,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:32,541 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:18:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:32,649 INFO L93 Difference]: Finished difference Result 628 states and 1837 transitions. [2020-02-10 20:18:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:32,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:32,651 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:18:32,651 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:18:32,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:18:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 390. [2020-02-10 20:18:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-02-10 20:18:32,661 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-02-10 20:18:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:32,661 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-02-10 20:18:32,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-02-10 20:18:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:32,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:32,662 INFO L415 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] [2020-02-10 20:18:32,662 INFO L427 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1411743898, now seen corresponding path program 972 times [2020-02-10 20:18:32,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:32,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549113776] [2020-02-10 20:18:32,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:32,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549113776] [2020-02-10 20:18:32,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:32,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:32,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155683848] [2020-02-10 20:18:32,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:32,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:32,948 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:18:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:33,053 INFO L93 Difference]: Finished difference Result 631 states and 1840 transitions. [2020-02-10 20:18:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:33,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:33,054 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:18:33,054 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:18:33,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:18:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 382. [2020-02-10 20:18:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 20:18:33,064 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 20:18:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:33,064 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 20:18:33,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 20:18:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:33,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:33,065 INFO L415 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] [2020-02-10 20:18:33,065 INFO L427 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash 679179110, now seen corresponding path program 973 times [2020-02-10 20:18:33,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:33,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868592833] [2020-02-10 20:18:33,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:33,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868592833] [2020-02-10 20:18:33,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:33,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:33,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682253499] [2020-02-10 20:18:33,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:33,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:33,329 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:18:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:33,407 INFO L93 Difference]: Finished difference Result 624 states and 1823 transitions. [2020-02-10 20:18:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:33,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:33,409 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:18:33,409 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:18:33,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:18:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 387. [2020-02-10 20:18:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 20:18:33,419 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 20:18:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:33,419 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 20:18:33,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 20:18:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:33,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:33,420 INFO L415 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] [2020-02-10 20:18:33,420 INFO L427 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1240247602, now seen corresponding path program 974 times [2020-02-10 20:18:33,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:33,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619198184] [2020-02-10 20:18:33,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:33,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619198184] [2020-02-10 20:18:33,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:33,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:33,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862535622] [2020-02-10 20:18:33,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:33,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:33,690 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:18:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:33,768 INFO L93 Difference]: Finished difference Result 617 states and 1808 transitions. [2020-02-10 20:18:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:33,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:33,770 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:18:33,770 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:18:33,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:18:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 385. [2020-02-10 20:18:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 20:18:33,780 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 20:18:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:33,780 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 20:18:33,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 20:18:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:33,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:33,781 INFO L415 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] [2020-02-10 20:18:33,781 INFO L427 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1691871642, now seen corresponding path program 975 times [2020-02-10 20:18:33,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:33,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485150434] [2020-02-10 20:18:33,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:34,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485150434] [2020-02-10 20:18:34,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:34,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:34,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269436152] [2020-02-10 20:18:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:34,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:34,087 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:18:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:34,173 INFO L93 Difference]: Finished difference Result 635 states and 1847 transitions. [2020-02-10 20:18:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:34,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:34,174 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:18:34,175 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:18:34,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:18:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2020-02-10 20:18:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:18:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1340 transitions. [2020-02-10 20:18:34,184 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1340 transitions. Word has length 22 [2020-02-10 20:18:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:34,185 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1340 transitions. [2020-02-10 20:18:34,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1340 transitions. [2020-02-10 20:18:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:34,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:34,185 INFO L415 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] [2020-02-10 20:18:34,185 INFO L427 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:34,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1561901196, now seen corresponding path program 976 times [2020-02-10 20:18:34,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:34,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050235807] [2020-02-10 20:18:34,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:34,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050235807] [2020-02-10 20:18:34,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:34,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:34,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107839461] [2020-02-10 20:18:34,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:34,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:34,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:34,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:34,461 INFO L87 Difference]: Start difference. First operand 393 states and 1340 transitions. Second operand 9 states. [2020-02-10 20:18:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:34,570 INFO L93 Difference]: Finished difference Result 633 states and 1837 transitions. [2020-02-10 20:18:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:34,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:34,571 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:18:34,571 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:18:34,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:18:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 385. [2020-02-10 20:18:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 20:18:34,581 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 20:18:34,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:34,581 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 20:18:34,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 20:18:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:34,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:34,582 INFO L415 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] [2020-02-10 20:18:34,582 INFO L427 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:34,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:34,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1746593868, now seen corresponding path program 977 times [2020-02-10 20:18:34,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:34,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934413822] [2020-02-10 20:18:34,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:34,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934413822] [2020-02-10 20:18:34,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:34,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:34,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023083245] [2020-02-10 20:18:34,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:34,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:34,848 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:18:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:34,950 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-02-10 20:18:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:34,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:34,952 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:18:34,952 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:18:34,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:18:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 386. [2020-02-10 20:18:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 20:18:34,961 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 20:18:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:34,961 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 20:18:34,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 20:18:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:34,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:34,962 INFO L415 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] [2020-02-10 20:18:34,962 INFO L427 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 670882712, now seen corresponding path program 978 times [2020-02-10 20:18:34,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:34,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147169196] [2020-02-10 20:18:34,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:35,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147169196] [2020-02-10 20:18:35,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:35,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:35,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675184532] [2020-02-10 20:18:35,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:35,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:35,229 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:18:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:35,343 INFO L93 Difference]: Finished difference Result 619 states and 1809 transitions. [2020-02-10 20:18:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:35,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:35,345 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:18:35,345 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:18:35,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:18:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 382. [2020-02-10 20:18:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-02-10 20:18:35,355 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:35,356 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-02-10 20:18:35,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-02-10 20:18:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:35,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:35,356 INFO L415 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] [2020-02-10 20:18:35,356 INFO L427 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash -958010236, now seen corresponding path program 979 times [2020-02-10 20:18:35,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:35,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785210019] [2020-02-10 20:18:35,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:35,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785210019] [2020-02-10 20:18:35,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:35,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:35,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252466057] [2020-02-10 20:18:35,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:35,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:35,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:35,632 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:35,751 INFO L93 Difference]: Finished difference Result 600 states and 1772 transitions. [2020-02-10 20:18:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:35,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:35,753 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:18:35,753 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:18:35,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:18:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 384. [2020-02-10 20:18:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-02-10 20:18:35,762 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-02-10 20:18:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:35,762 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-02-10 20:18:35,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-02-10 20:18:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:35,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:35,763 INFO L415 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] [2020-02-10 20:18:35,763 INFO L427 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1891440050, now seen corresponding path program 980 times [2020-02-10 20:18:35,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:35,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842086531] [2020-02-10 20:18:35,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:36,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842086531] [2020-02-10 20:18:36,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:36,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:36,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471967546] [2020-02-10 20:18:36,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:36,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:36,044 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:18:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,130 INFO L93 Difference]: Finished difference Result 598 states and 1767 transitions. [2020-02-10 20:18:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:36,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,132 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:18:36,132 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:18:36,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:18:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 20:18:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 20:18:36,141 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 20:18:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,141 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 20:18:36,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 20:18:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:36,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,142 INFO L415 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] [2020-02-10 20:18:36,142 INFO L427 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash 54682296, now seen corresponding path program 981 times [2020-02-10 20:18:36,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457126247] [2020-02-10 20:18:36,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:36,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457126247] [2020-02-10 20:18:36,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:36,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:36,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213864226] [2020-02-10 20:18:36,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:36,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:36,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:36,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:36,446 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:18:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,562 INFO L93 Difference]: Finished difference Result 607 states and 1787 transitions. [2020-02-10 20:18:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:36,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,564 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:18:36,564 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:18:36,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:18:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-02-10 20:18:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 20:18:36,574 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 20:18:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,574 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 20:18:36,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 20:18:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:36,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,575 INFO L415 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] [2020-02-10 20:18:36,575 INFO L427 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717426, now seen corresponding path program 982 times [2020-02-10 20:18:36,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144286809] [2020-02-10 20:18:36,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:36,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144286809] [2020-02-10 20:18:36,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:36,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:36,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96278301] [2020-02-10 20:18:36,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:36,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:36,848 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:18:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,969 INFO L93 Difference]: Finished difference Result 610 states and 1790 transitions. [2020-02-10 20:18:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:36,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,971 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:18:36,971 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:18:36,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:18:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 383. [2020-02-10 20:18:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1319 transitions. [2020-02-10 20:18:36,979 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1319 transitions. Word has length 22 [2020-02-10 20:18:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,979 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1319 transitions. [2020-02-10 20:18:36,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1319 transitions. [2020-02-10 20:18:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:36,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,980 INFO L415 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] [2020-02-10 20:18:36,980 INFO L427 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1303694728, now seen corresponding path program 983 times [2020-02-10 20:18:36,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402498264] [2020-02-10 20:18:36,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:37,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402498264] [2020-02-10 20:18:37,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:37,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:37,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107268570] [2020-02-10 20:18:37,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:37,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:37,249 INFO L87 Difference]: Start difference. First operand 383 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:18:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:37,341 INFO L93 Difference]: Finished difference Result 601 states and 1772 transitions. [2020-02-10 20:18:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:37,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:37,343 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:18:37,343 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:18:37,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:18:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 384. [2020-02-10 20:18:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-02-10 20:18:37,352 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-02-10 20:18:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:37,353 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-02-10 20:18:37,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-02-10 20:18:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:37,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:37,353 INFO L415 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] [2020-02-10 20:18:37,353 INFO L427 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash 227983572, now seen corresponding path program 984 times [2020-02-10 20:18:37,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:37,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095464742] [2020-02-10 20:18:37,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:37,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095464742] [2020-02-10 20:18:37,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:37,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:37,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653133108] [2020-02-10 20:18:37,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:37,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:37,619 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:18:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:37,731 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-02-10 20:18:37,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:37,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:37,733 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:18:37,733 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:18:37,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:18:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 379. [2020-02-10 20:18:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:18:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1312 transitions. [2020-02-10 20:18:37,742 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1312 transitions. Word has length 22 [2020-02-10 20:18:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:37,742 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1312 transitions. [2020-02-10 20:18:37,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1312 transitions. [2020-02-10 20:18:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:37,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:37,743 INFO L415 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] [2020-02-10 20:18:37,743 INFO L427 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1067964948, now seen corresponding path program 985 times [2020-02-10 20:18:37,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:37,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769596033] [2020-02-10 20:18:37,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:38,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769596033] [2020-02-10 20:18:38,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:38,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:38,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996116357] [2020-02-10 20:18:38,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:38,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:38,012 INFO L87 Difference]: Start difference. First operand 379 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:18:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:38,102 INFO L93 Difference]: Finished difference Result 610 states and 1793 transitions. [2020-02-10 20:18:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:38,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:38,104 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:18:38,104 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:18:38,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:18:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 20:18:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1332 transitions. [2020-02-10 20:18:38,113 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1332 transitions. Word has length 22 [2020-02-10 20:18:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:38,113 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1332 transitions. [2020-02-10 20:18:38,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1332 transitions. [2020-02-10 20:18:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:38,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:38,113 INFO L415 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] [2020-02-10 20:18:38,114 INFO L427 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1636736462, now seen corresponding path program 986 times [2020-02-10 20:18:38,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:38,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86126073] [2020-02-10 20:18:38,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:38,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86126073] [2020-02-10 20:18:38,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:38,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:38,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938229043] [2020-02-10 20:18:38,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:38,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:38,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:38,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:38,383 INFO L87 Difference]: Start difference. First operand 387 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:18:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:38,510 INFO L93 Difference]: Finished difference Result 605 states and 1780 transitions. [2020-02-10 20:18:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:38,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:38,512 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:18:38,512 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:18:38,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:18:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 383. [2020-02-10 20:18:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 20:18:38,521 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 20:18:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:38,521 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 20:18:38,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 20:18:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:38,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:38,522 INFO L415 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] [2020-02-10 20:18:38,522 INFO L427 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1874452028, now seen corresponding path program 987 times [2020-02-10 20:18:38,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:38,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609969670] [2020-02-10 20:18:38,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:38,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609969670] [2020-02-10 20:18:38,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:38,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:38,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775783167] [2020-02-10 20:18:38,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:38,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:38,786 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:18:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:38,867 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-02-10 20:18:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:38,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:38,869 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:18:38,869 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:18:38,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:18:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 20:18:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-02-10 20:18:38,878 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-02-10 20:18:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:38,879 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-02-10 20:18:38,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-02-10 20:18:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:38,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:38,879 INFO L415 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] [2020-02-10 20:18:38,879 INFO L427 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1313383536, now seen corresponding path program 988 times [2020-02-10 20:18:38,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:38,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643241408] [2020-02-10 20:18:38,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:39,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643241408] [2020-02-10 20:18:39,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:39,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085654599] [2020-02-10 20:18:39,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:39,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:39,139 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:18:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:39,233 INFO L93 Difference]: Finished difference Result 599 states and 1766 transitions. [2020-02-10 20:18:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:39,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:39,235 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:18:39,235 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:18:39,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:18:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 20:18:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-02-10 20:18:39,244 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-02-10 20:18:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:39,245 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-02-10 20:18:39,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-02-10 20:18:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:39,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:39,245 INFO L415 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] [2020-02-10 20:18:39,245 INFO L427 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1226225062, now seen corresponding path program 989 times [2020-02-10 20:18:39,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:39,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526377142] [2020-02-10 20:18:39,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:39,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526377142] [2020-02-10 20:18:39,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:39,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715087372] [2020-02-10 20:18:39,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:39,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:39,520 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:18:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:39,635 INFO L93 Difference]: Finished difference Result 595 states and 1759 transitions. [2020-02-10 20:18:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:39,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:39,636 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:18:39,637 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:18:39,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:18:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 20:18:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:18:39,646 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:39,646 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:18:39,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:18:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:39,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:39,646 INFO L415 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] [2020-02-10 20:18:39,646 INFO L427 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash -219291948, now seen corresponding path program 990 times [2020-02-10 20:18:39,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:39,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615793850] [2020-02-10 20:18:39,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:39,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615793850] [2020-02-10 20:18:39,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:39,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225480820] [2020-02-10 20:18:39,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:39,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:39,918 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,018 INFO L93 Difference]: Finished difference Result 593 states and 1754 transitions. [2020-02-10 20:18:40,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:40,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,020 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:18:40,020 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:18:40,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:18:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 381. [2020-02-10 20:18:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1318 transitions. [2020-02-10 20:18:40,030 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,030 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1318 transitions. [2020-02-10 20:18:40,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1318 transitions. [2020-02-10 20:18:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:40,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,030 INFO L415 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] [2020-02-10 20:18:40,031 INFO L427 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1114573718, now seen corresponding path program 991 times [2020-02-10 20:18:40,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286045130] [2020-02-10 20:18:40,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:40,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286045130] [2020-02-10 20:18:40,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:40,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:40,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166192028] [2020-02-10 20:18:40,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:40,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:40,308 INFO L87 Difference]: Start difference. First operand 381 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,388 INFO L93 Difference]: Finished difference Result 616 states and 1810 transitions. [2020-02-10 20:18:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:40,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,389 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:18:40,390 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:18:40,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:18:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2020-02-10 20:18:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:18:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 20:18:40,399 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 20:18:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,399 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 20:18:40,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 20:18:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:40,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,400 INFO L415 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] [2020-02-10 20:18:40,400 INFO L427 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,400 INFO L82 PathProgramCache]: Analyzing trace with hash 475692168, now seen corresponding path program 992 times [2020-02-10 20:18:40,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654556544] [2020-02-10 20:18:40,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:40,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654556544] [2020-02-10 20:18:40,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:40,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:40,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005577720] [2020-02-10 20:18:40,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:40,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:40,667 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:18:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,776 INFO L93 Difference]: Finished difference Result 611 states and 1797 transitions. [2020-02-10 20:18:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:40,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,778 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:18:40,778 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:18:40,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:18:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-02-10 20:18:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1328 transitions. [2020-02-10 20:18:40,787 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1328 transitions. Word has length 22 [2020-02-10 20:18:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,788 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1328 transitions. [2020-02-10 20:18:40,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1328 transitions. [2020-02-10 20:18:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:40,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,788 INFO L415 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] [2020-02-10 20:18:40,788 INFO L427 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1831716826, now seen corresponding path program 993 times [2020-02-10 20:18:40,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485732117] [2020-02-10 20:18:40,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:41,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485732117] [2020-02-10 20:18:41,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:41,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:41,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077738865] [2020-02-10 20:18:41,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:41,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:41,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:41,066 INFO L87 Difference]: Start difference. First operand 385 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:18:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:41,153 INFO L93 Difference]: Finished difference Result 610 states and 1797 transitions. [2020-02-10 20:18:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:41,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:41,155 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:18:41,155 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:18:41,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:18:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 390. [2020-02-10 20:18:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-02-10 20:18:41,164 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-02-10 20:18:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:41,164 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-02-10 20:18:41,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-02-10 20:18:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:41,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:41,164 INFO L415 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] [2020-02-10 20:18:41,165 INFO L427 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash 130388924, now seen corresponding path program 994 times [2020-02-10 20:18:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:41,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330668064] [2020-02-10 20:18:41,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:41,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330668064] [2020-02-10 20:18:41,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:41,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:41,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780246383] [2020-02-10 20:18:41,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:41,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:41,441 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:18:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:41,561 INFO L93 Difference]: Finished difference Result 597 states and 1777 transitions. [2020-02-10 20:18:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:41,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:41,563 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:18:41,563 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:18:41,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:18:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-02-10 20:18:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 20:18:41,573 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 20:18:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:41,573 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 20:18:41,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 20:18:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:41,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:41,574 INFO L415 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] [2020-02-10 20:18:41,574 INFO L427 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 616420412, now seen corresponding path program 995 times [2020-02-10 20:18:41,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:41,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982128004] [2020-02-10 20:18:41,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:41,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982128004] [2020-02-10 20:18:41,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:41,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:41,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531925165] [2020-02-10 20:18:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:41,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:41,850 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:18:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:41,963 INFO L93 Difference]: Finished difference Result 603 states and 1779 transitions. [2020-02-10 20:18:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:41,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:41,965 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:18:41,965 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:18:41,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:18:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 388. [2020-02-10 20:18:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1329 transitions. [2020-02-10 20:18:41,975 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1329 transitions. Word has length 22 [2020-02-10 20:18:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:41,975 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1329 transitions. [2020-02-10 20:18:41,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1329 transitions. [2020-02-10 20:18:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:41,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:41,976 INFO L415 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] [2020-02-10 20:18:41,976 INFO L427 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1490161092, now seen corresponding path program 996 times [2020-02-10 20:18:41,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:41,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135427020] [2020-02-10 20:18:41,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:42,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135427020] [2020-02-10 20:18:42,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:42,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:42,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012706755] [2020-02-10 20:18:42,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:42,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:42,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:42,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:42,258 INFO L87 Difference]: Start difference. First operand 388 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:18:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:42,375 INFO L93 Difference]: Finished difference Result 595 states and 1770 transitions. [2020-02-10 20:18:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:42,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:42,377 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:18:42,377 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:18:42,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:18:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 381. [2020-02-10 20:18:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-02-10 20:18:42,386 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-02-10 20:18:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:42,386 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-02-10 20:18:42,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-02-10 20:18:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:42,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:42,387 INFO L415 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] [2020-02-10 20:18:42,387 INFO L427 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1970571844, now seen corresponding path program 997 times [2020-02-10 20:18:42,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:42,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70302083] [2020-02-10 20:18:42,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:42,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70302083] [2020-02-10 20:18:42,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:42,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:42,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649310343] [2020-02-10 20:18:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:42,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:42,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:42,648 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:18:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:42,726 INFO L93 Difference]: Finished difference Result 606 states and 1780 transitions. [2020-02-10 20:18:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:42,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:42,728 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:18:42,728 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:18:42,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:18:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 20:18:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 20:18:42,738 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 20:18:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:42,738 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 20:18:42,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 20:18:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:42,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:42,739 INFO L415 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] [2020-02-10 20:18:42,739 INFO L427 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1763326960, now seen corresponding path program 998 times [2020-02-10 20:18:42,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:42,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461247104] [2020-02-10 20:18:42,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:43,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461247104] [2020-02-10 20:18:43,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:43,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:43,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492860402] [2020-02-10 20:18:43,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:43,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:43,004 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:18:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:43,087 INFO L93 Difference]: Finished difference Result 599 states and 1765 transitions. [2020-02-10 20:18:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:43,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:43,089 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:18:43,089 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:18:43,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:18:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 20:18:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 20:18:43,099 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 20:18:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:43,099 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 20:18:43,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 20:18:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:43,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:43,100 INFO L415 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] [2020-02-10 20:18:43,100 INFO L427 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:43,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1382826522, now seen corresponding path program 999 times [2020-02-10 20:18:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:43,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343276938] [2020-02-10 20:18:43,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:43,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343276938] [2020-02-10 20:18:43,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:43,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:43,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400575466] [2020-02-10 20:18:43,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:43,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:43,372 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:18:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:43,455 INFO L93 Difference]: Finished difference Result 604 states and 1779 transitions. [2020-02-10 20:18:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:43,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:43,457 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:18:43,457 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:18:43,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:18:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 388. [2020-02-10 20:18:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 20:18:43,466 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 20:18:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:43,466 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 20:18:43,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 20:18:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:43,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:43,466 INFO L415 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] [2020-02-10 20:18:43,467 INFO L427 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -890224116, now seen corresponding path program 1000 times [2020-02-10 20:18:43,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:43,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266769078] [2020-02-10 20:18:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:43,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266769078] [2020-02-10 20:18:43,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:43,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:43,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601896607] [2020-02-10 20:18:43,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:43,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:43,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:43,732 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:18:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:43,850 INFO L93 Difference]: Finished difference Result 591 states and 1759 transitions. [2020-02-10 20:18:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:43,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:43,852 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:18:43,852 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:18:43,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:18:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-02-10 20:18:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:18:43,861 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:43,862 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:18:43,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:18:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:43,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:43,862 INFO L415 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] [2020-02-10 20:18:43,862 INFO L427 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1437548748, now seen corresponding path program 1001 times [2020-02-10 20:18:43,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:43,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533080543] [2020-02-10 20:18:43,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:44,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533080543] [2020-02-10 20:18:44,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:44,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403930228] [2020-02-10 20:18:44,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:44,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:44,134 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:44,214 INFO L93 Difference]: Finished difference Result 593 states and 1753 transitions. [2020-02-10 20:18:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:44,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:44,216 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:18:44,216 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:18:44,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:18:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 20:18:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 20:18:44,225 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 20:18:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:44,225 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 20:18:44,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 20:18:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:44,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:44,226 INFO L415 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] [2020-02-10 20:18:44,226 INFO L427 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1972778550, now seen corresponding path program 1002 times [2020-02-10 20:18:44,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:44,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517837725] [2020-02-10 20:18:44,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:44,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517837725] [2020-02-10 20:18:44,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:44,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666979221] [2020-02-10 20:18:44,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:44,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:44,492 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:18:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:44,611 INFO L93 Difference]: Finished difference Result 587 states and 1750 transitions. [2020-02-10 20:18:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:44,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:44,613 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:18:44,613 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:18:44,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:18:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-02-10 20:18:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:18:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 20:18:44,622 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 20:18:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:44,623 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 20:18:44,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 20:18:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:44,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:44,623 INFO L415 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] [2020-02-10 20:18:44,623 INFO L427 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 333382498, now seen corresponding path program 1003 times [2020-02-10 20:18:44,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:44,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226173517] [2020-02-10 20:18:44,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:44,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226173517] [2020-02-10 20:18:44,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:44,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139755233] [2020-02-10 20:18:44,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:44,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:44,901 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:18:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:45,015 INFO L93 Difference]: Finished difference Result 587 states and 1741 transitions. [2020-02-10 20:18:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:45,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:45,017 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:18:45,017 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:18:45,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:18:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 20:18:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:18:45,025 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:18:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,026 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:18:45,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:18:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:45,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,026 INFO L415 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] [2020-02-10 20:18:45,026 INFO L427 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1112134512, now seen corresponding path program 1004 times [2020-02-10 20:18:45,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059133626] [2020-02-10 20:18:45,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:45,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059133626] [2020-02-10 20:18:45,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:45,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:45,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730572299] [2020-02-10 20:18:45,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:45,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:45,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:45,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:45,299 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:18:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:45,388 INFO L93 Difference]: Finished difference Result 585 states and 1736 transitions. [2020-02-10 20:18:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:45,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:45,390 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:18:45,390 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:18:45,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:18:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 20:18:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-02-10 20:18:45,398 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-02-10 20:18:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,398 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-02-10 20:18:45,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-02-10 20:18:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:45,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,399 INFO L415 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] [2020-02-10 20:18:45,399 INFO L427 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash -254362824, now seen corresponding path program 1005 times [2020-02-10 20:18:45,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619203563] [2020-02-10 20:18:45,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:45,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619203563] [2020-02-10 20:18:45,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:45,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:45,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620256842] [2020-02-10 20:18:45,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:45,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:45,673 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:18:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:45,772 INFO L93 Difference]: Finished difference Result 589 states and 1747 transitions. [2020-02-10 20:18:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:45,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:45,774 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:18:45,774 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:18:45,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:18:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-02-10 20:18:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 20:18:45,784 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 20:18:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,784 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 20:18:45,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 20:18:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:45,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,785 INFO L415 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] [2020-02-10 20:18:45,785 INFO L427 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash 47655120, now seen corresponding path program 1006 times [2020-02-10 20:18:45,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10297842] [2020-02-10 20:18:45,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:46,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10297842] [2020-02-10 20:18:46,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:46,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:46,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221608195] [2020-02-10 20:18:46,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:46,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:46,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:46,057 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:18:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:46,180 INFO L93 Difference]: Finished difference Result 581 states and 1738 transitions. [2020-02-10 20:18:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:46,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:46,182 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:18:46,182 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:18:46,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:18:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 20:18:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:18:46,191 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:18:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:46,191 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:18:46,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:18:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:46,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:46,192 INFO L415 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] [2020-02-10 20:18:46,192 INFO L427 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash 994649608, now seen corresponding path program 1007 times [2020-02-10 20:18:46,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:46,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629098014] [2020-02-10 20:18:46,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:46,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629098014] [2020-02-10 20:18:46,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:46,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:46,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612313790] [2020-02-10 20:18:46,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:46,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:46,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:46,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:46,470 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:18:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:46,568 INFO L93 Difference]: Finished difference Result 585 states and 1736 transitions. [2020-02-10 20:18:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:46,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:46,570 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:18:46,570 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:18:46,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:18:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 20:18:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:18:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 20:18:46,579 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 20:18:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:46,579 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 20:18:46,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 20:18:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:46,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:46,580 INFO L415 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] [2020-02-10 20:18:46,580 INFO L427 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1529879410, now seen corresponding path program 1008 times [2020-02-10 20:18:46,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:46,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96898634] [2020-02-10 20:18:46,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:46,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96898634] [2020-02-10 20:18:46,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:46,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:46,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548505445] [2020-02-10 20:18:46,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:46,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:46,862 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:18:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:46,976 INFO L93 Difference]: Finished difference Result 579 states and 1733 transitions. [2020-02-10 20:18:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:46,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:46,978 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:18:46,978 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:18:46,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:18:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 379. [2020-02-10 20:18:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:18:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1310 transitions. [2020-02-10 20:18:46,987 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1310 transitions. Word has length 22 [2020-02-10 20:18:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:46,987 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1310 transitions. [2020-02-10 20:18:46,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1310 transitions. [2020-02-10 20:18:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:46,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:46,988 INFO L415 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] [2020-02-10 20:18:46,988 INFO L427 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 580845716, now seen corresponding path program 1009 times [2020-02-10 20:18:46,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:46,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799954944] [2020-02-10 20:18:46,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:47,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799954944] [2020-02-10 20:18:47,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:47,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:47,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756387178] [2020-02-10 20:18:47,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:47,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:47,263 INFO L87 Difference]: Start difference. First operand 379 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:18:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:47,358 INFO L93 Difference]: Finished difference Result 651 states and 1909 transitions. [2020-02-10 20:18:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:47,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:47,360 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:18:47,360 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:18:47,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:18:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 393. [2020-02-10 20:18:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:18:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-02-10 20:18:47,370 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-02-10 20:18:47,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:47,370 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-02-10 20:18:47,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-02-10 20:18:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:47,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:47,371 INFO L415 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] [2020-02-10 20:18:47,371 INFO L427 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2123855694, now seen corresponding path program 1010 times [2020-02-10 20:18:47,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:47,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758072707] [2020-02-10 20:18:47,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:47,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758072707] [2020-02-10 20:18:47,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:47,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:47,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480044855] [2020-02-10 20:18:47,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:47,650 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:18:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:47,765 INFO L93 Difference]: Finished difference Result 646 states and 1896 transitions. [2020-02-10 20:18:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:47,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:47,767 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:18:47,767 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:18:47,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:18:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 389. [2020-02-10 20:18:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:18:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 20:18:47,777 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 20:18:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:47,777 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 20:18:47,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 20:18:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:47,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:47,778 INFO L415 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] [2020-02-10 20:18:47,778 INFO L427 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash 845896580, now seen corresponding path program 1011 times [2020-02-10 20:18:47,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:47,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096817483] [2020-02-10 20:18:47,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096817483] [2020-02-10 20:18:48,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:48,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311821962] [2020-02-10 20:18:48,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:48,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:48,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:48,060 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:18:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:48,139 INFO L93 Difference]: Finished difference Result 658 states and 1921 transitions. [2020-02-10 20:18:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:48,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:48,141 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:18:48,141 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:18:48,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:18:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 20:18:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:18:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1356 transitions. [2020-02-10 20:18:48,152 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1356 transitions. Word has length 22 [2020-02-10 20:18:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:48,152 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1356 transitions. [2020-02-10 20:18:48,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1356 transitions. [2020-02-10 20:18:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:48,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:48,152 INFO L415 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] [2020-02-10 20:18:48,153 INFO L427 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash -651674970, now seen corresponding path program 1012 times [2020-02-10 20:18:48,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:48,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048263739] [2020-02-10 20:18:48,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048263739] [2020-02-10 20:18:48,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:48,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685617003] [2020-02-10 20:18:48,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:48,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:48,447 INFO L87 Difference]: Start difference. First operand 397 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:18:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:48,565 INFO L93 Difference]: Finished difference Result 656 states and 1911 transitions. [2020-02-10 20:18:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:48,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:48,567 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:18:48,567 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:18:48,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:18:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 389. [2020-02-10 20:18:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:18:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 20:18:48,576 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 20:18:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:48,576 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 20:18:48,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 20:18:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:48,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:48,577 INFO L415 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] [2020-02-10 20:18:48,577 INFO L427 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -369399834, now seen corresponding path program 1013 times [2020-02-10 20:18:48,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:48,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139773917] [2020-02-10 20:18:48,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139773917] [2020-02-10 20:18:48,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:48,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953085809] [2020-02-10 20:18:48,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:48,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:48,852 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:18:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:49,001 INFO L93 Difference]: Finished difference Result 643 states and 1886 transitions. [2020-02-10 20:18:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:49,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:49,002 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:18:49,003 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:18:49,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:18:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 392. [2020-02-10 20:18:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:18:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1343 transitions. [2020-02-10 20:18:49,012 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1343 transitions. Word has length 22 [2020-02-10 20:18:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:49,012 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1343 transitions. [2020-02-10 20:18:49,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1343 transitions. [2020-02-10 20:18:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:49,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:49,013 INFO L415 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] [2020-02-10 20:18:49,013 INFO L427 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -350965808, now seen corresponding path program 1014 times [2020-02-10 20:18:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:49,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097135685] [2020-02-10 20:18:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:49,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097135685] [2020-02-10 20:18:49,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:49,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:49,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414195806] [2020-02-10 20:18:49,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:49,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:49,294 INFO L87 Difference]: Start difference. First operand 392 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:18:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:49,406 INFO L93 Difference]: Finished difference Result 646 states and 1889 transitions. [2020-02-10 20:18:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:49,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:49,408 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:18:49,408 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:18:49,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:18:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 384. [2020-02-10 20:18:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1326 transitions. [2020-02-10 20:18:49,418 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1326 transitions. Word has length 22 [2020-02-10 20:18:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:49,418 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1326 transitions. [2020-02-10 20:18:49,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1326 transitions. [2020-02-10 20:18:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:49,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:49,419 INFO L415 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] [2020-02-10 20:18:49,419 INFO L427 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:49,419 INFO L82 PathProgramCache]: Analyzing trace with hash 158359990, now seen corresponding path program 1015 times [2020-02-10 20:18:49,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:49,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622931862] [2020-02-10 20:18:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:49,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622931862] [2020-02-10 20:18:49,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:49,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:49,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528876531] [2020-02-10 20:18:49,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:49,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:49,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:49,694 INFO L87 Difference]: Start difference. First operand 384 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:18:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:49,792 INFO L93 Difference]: Finished difference Result 641 states and 1881 transitions. [2020-02-10 20:18:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:49,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:49,794 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:18:49,794 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:18:49,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:18:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 392. [2020-02-10 20:18:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:18:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1346 transitions. [2020-02-10 20:18:49,804 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1346 transitions. Word has length 22 [2020-02-10 20:18:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:49,804 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1346 transitions. [2020-02-10 20:18:49,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1346 transitions. [2020-02-10 20:18:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:49,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:49,805 INFO L415 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] [2020-02-10 20:18:49,805 INFO L427 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1748625876, now seen corresponding path program 1016 times [2020-02-10 20:18:49,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:49,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096563300] [2020-02-10 20:18:49,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:50,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096563300] [2020-02-10 20:18:50,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:50,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:50,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218904617] [2020-02-10 20:18:50,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:50,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:50,075 INFO L87 Difference]: Start difference. First operand 392 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:18:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:50,200 INFO L93 Difference]: Finished difference Result 636 states and 1868 transitions. [2020-02-10 20:18:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:50,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:50,201 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:18:50,202 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:18:50,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:18:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-02-10 20:18:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 20:18:50,211 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 20:18:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,211 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 20:18:50,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 20:18:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:50,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:50,212 INFO L415 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] [2020-02-10 20:18:50,212 INFO L427 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1190316762, now seen corresponding path program 1017 times [2020-02-10 20:18:50,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243900613] [2020-02-10 20:18:50,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:50,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243900613] [2020-02-10 20:18:50,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:50,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:50,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992414397] [2020-02-10 20:18:50,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:50,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:50,490 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:18:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:50,579 INFO L93 Difference]: Finished difference Result 635 states and 1868 transitions. [2020-02-10 20:18:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:50,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:50,580 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:18:50,581 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:18:50,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:18:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2020-02-10 20:18:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:18:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1344 transitions. [2020-02-10 20:18:50,590 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1344 transitions. Word has length 22 [2020-02-10 20:18:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,590 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1344 transitions. [2020-02-10 20:18:50,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1344 transitions. [2020-02-10 20:18:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:50,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:50,591 INFO L415 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] [2020-02-10 20:18:50,591 INFO L427 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1403322632, now seen corresponding path program 1018 times [2020-02-10 20:18:50,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805895010] [2020-02-10 20:18:50,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:50,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805895010] [2020-02-10 20:18:50,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:50,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:50,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126810889] [2020-02-10 20:18:50,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:50,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:50,864 INFO L87 Difference]: Start difference. First operand 393 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:18:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:50,976 INFO L93 Difference]: Finished difference Result 622 states and 1848 transitions. [2020-02-10 20:18:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:50,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:50,978 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:18:50,978 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:18:50,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:18:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 388. [2020-02-10 20:18:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:18:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-02-10 20:18:50,988 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-02-10 20:18:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,988 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-02-10 20:18:50,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-02-10 20:18:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:50,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:50,989 INFO L415 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] [2020-02-10 20:18:50,989 INFO L427 AbstractCegarLoop]: === Iteration 1025 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1889354120, now seen corresponding path program 1019 times [2020-02-10 20:18:50,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142152606] [2020-02-10 20:18:50,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:51,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142152606] [2020-02-10 20:18:51,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:51,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:51,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725522039] [2020-02-10 20:18:51,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:51,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:51,268 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:18:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:51,372 INFO L93 Difference]: Finished difference Result 628 states and 1850 transitions. [2020-02-10 20:18:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:51,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:51,374 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:18:51,374 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:18:51,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:18:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 391. [2020-02-10 20:18:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:18:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2020-02-10 20:18:51,383 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1337 transitions. Word has length 22 [2020-02-10 20:18:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:51,384 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1337 transitions. [2020-02-10 20:18:51,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1337 transitions. [2020-02-10 20:18:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:51,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:51,384 INFO L415 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] [2020-02-10 20:18:51,384 INFO L427 AbstractCegarLoop]: === Iteration 1026 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1531872496, now seen corresponding path program 1020 times [2020-02-10 20:18:51,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:51,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109893813] [2020-02-10 20:18:51,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:51,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109893813] [2020-02-10 20:18:51,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:51,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:51,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541625971] [2020-02-10 20:18:51,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:51,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:51,659 INFO L87 Difference]: Start difference. First operand 391 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:18:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:51,768 INFO L93 Difference]: Finished difference Result 620 states and 1841 transitions. [2020-02-10 20:18:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:51,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:51,770 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:18:51,770 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:18:51,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:18:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-02-10 20:18:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-02-10 20:18:51,779 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-02-10 20:18:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:51,779 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-02-10 20:18:51,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-02-10 20:18:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:51,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:51,780 INFO L415 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] [2020-02-10 20:18:51,780 INFO L427 AbstractCegarLoop]: === Iteration 1027 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1986590228, now seen corresponding path program 1021 times [2020-02-10 20:18:51,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:51,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959980760] [2020-02-10 20:18:51,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959980760] [2020-02-10 20:18:52,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:52,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271509613] [2020-02-10 20:18:52,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:52,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:52,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:52,083 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:18:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:52,176 INFO L93 Difference]: Finished difference Result 654 states and 1908 transitions. [2020-02-10 20:18:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:52,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:52,178 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:18:52,178 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:18:52,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:18:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 398. [2020-02-10 20:18:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:18:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1355 transitions. [2020-02-10 20:18:52,188 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1355 transitions. Word has length 22 [2020-02-10 20:18:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:52,188 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1355 transitions. [2020-02-10 20:18:52,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1355 transitions. [2020-02-10 20:18:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:52,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:52,189 INFO L415 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] [2020-02-10 20:18:52,189 INFO L427 AbstractCegarLoop]: === Iteration 1028 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 489018678, now seen corresponding path program 1022 times [2020-02-10 20:18:52,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:52,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340975106] [2020-02-10 20:18:52,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340975106] [2020-02-10 20:18:52,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:52,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549161243] [2020-02-10 20:18:52,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:52,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:52,471 INFO L87 Difference]: Start difference. First operand 398 states and 1355 transitions. Second operand 9 states. [2020-02-10 20:18:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:52,585 INFO L93 Difference]: Finished difference Result 652 states and 1898 transitions. [2020-02-10 20:18:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:52,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:52,587 INFO L225 Difference]: With dead ends: 652 [2020-02-10 20:18:52,587 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:18:52,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:18:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 390. [2020-02-10 20:18:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-02-10 20:18:52,596 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-02-10 20:18:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:52,596 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-02-10 20:18:52,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-02-10 20:18:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:52,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:52,597 INFO L415 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] [2020-02-10 20:18:52,597 INFO L427 AbstractCegarLoop]: === Iteration 1029 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1563674570, now seen corresponding path program 1023 times [2020-02-10 20:18:52,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:52,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675938599] [2020-02-10 20:18:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675938599] [2020-02-10 20:18:52,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:52,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531900450] [2020-02-10 20:18:52,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:52,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:52,879 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:18:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:52,978 INFO L93 Difference]: Finished difference Result 641 states and 1877 transitions. [2020-02-10 20:18:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:52,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:52,980 INFO L225 Difference]: With dead ends: 641 [2020-02-10 20:18:52,980 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:18:52,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:18:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 20:18:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:18:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1344 transitions. [2020-02-10 20:18:52,989 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1344 transitions. Word has length 22 [2020-02-10 20:18:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:52,989 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1344 transitions. [2020-02-10 20:18:52,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1344 transitions. [2020-02-10 20:18:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:52,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:52,990 INFO L415 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] [2020-02-10 20:18:52,990 INFO L427 AbstractCegarLoop]: === Iteration 1030 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1029964824, now seen corresponding path program 1024 times [2020-02-10 20:18:52,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:52,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401998521] [2020-02-10 20:18:52,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:53,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401998521] [2020-02-10 20:18:53,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:53,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:53,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330457784] [2020-02-10 20:18:53,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:53,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:53,273 INFO L87 Difference]: Start difference. First operand 395 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:18:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:53,391 INFO L93 Difference]: Finished difference Result 628 states and 1857 transitions. [2020-02-10 20:18:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:53,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:53,392 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:18:53,392 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:18:53,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:18:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-02-10 20:18:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1331 transitions. [2020-02-10 20:18:53,401 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1331 transitions. Word has length 22 [2020-02-10 20:18:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:53,401 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1331 transitions. [2020-02-10 20:18:53,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1331 transitions. [2020-02-10 20:18:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:53,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:53,401 INFO L415 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] [2020-02-10 20:18:53,402 INFO L427 AbstractCegarLoop]: === Iteration 1031 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:53,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:53,402 INFO L82 PathProgramCache]: Analyzing trace with hash 115948978, now seen corresponding path program 1025 times [2020-02-10 20:18:53,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:53,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625668298] [2020-02-10 20:18:53,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:53,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625668298] [2020-02-10 20:18:53,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:53,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:53,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979826803] [2020-02-10 20:18:53,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:53,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:53,665 INFO L87 Difference]: Start difference. First operand 390 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:18:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:53,776 INFO L93 Difference]: Finished difference Result 638 states and 1867 transitions. [2020-02-10 20:18:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:53,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:53,778 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:18:53,778 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:18:53,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:18:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 394. [2020-02-10 20:18:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:18:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1338 transitions. [2020-02-10 20:18:53,787 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1338 transitions. Word has length 22 [2020-02-10 20:18:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:53,787 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1338 transitions. [2020-02-10 20:18:53,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1338 transitions. [2020-02-10 20:18:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:53,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:53,788 INFO L415 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] [2020-02-10 20:18:53,788 INFO L427 AbstractCegarLoop]: === Iteration 1032 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash 974823508, now seen corresponding path program 1026 times [2020-02-10 20:18:53,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:53,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729600479] [2020-02-10 20:18:53,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:54,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729600479] [2020-02-10 20:18:54,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:54,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:54,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531961004] [2020-02-10 20:18:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:54,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:54,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:54,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:54,061 INFO L87 Difference]: Start difference. First operand 394 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:18:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:54,186 INFO L93 Difference]: Finished difference Result 627 states and 1851 transitions. [2020-02-10 20:18:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:54,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:54,188 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:18:54,188 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:18:54,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:18:54,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 384. [2020-02-10 20:18:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:18:54,198 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:18:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:54,198 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:18:54,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:18:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:54,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,199 INFO L415 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] [2020-02-10 20:18:54,199 INFO L427 AbstractCegarLoop]: === Iteration 1033 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash -301791566, now seen corresponding path program 1027 times [2020-02-10 20:18:54,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301930486] [2020-02-10 20:18:54,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:54,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301930486] [2020-02-10 20:18:54,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:54,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:54,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261646920] [2020-02-10 20:18:54,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:54,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:54,462 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:18:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:54,580 INFO L93 Difference]: Finished difference Result 629 states and 1850 transitions. [2020-02-10 20:18:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:54,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:54,582 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:18:54,582 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:18:54,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:18:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 390. [2020-02-10 20:18:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-02-10 20:18:54,590 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-02-10 20:18:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:54,590 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-02-10 20:18:54,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-02-10 20:18:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:54,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,591 INFO L415 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] [2020-02-10 20:18:54,591 INFO L427 AbstractCegarLoop]: === Iteration 1034 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash -283357540, now seen corresponding path program 1028 times [2020-02-10 20:18:54,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763034219] [2020-02-10 20:18:54,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:54,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763034219] [2020-02-10 20:18:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:54,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826584589] [2020-02-10 20:18:54,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:54,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:54,859 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:18:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:54,974 INFO L93 Difference]: Finished difference Result 632 states and 1853 transitions. [2020-02-10 20:18:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:54,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:54,976 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:18:54,976 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:18:54,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:18:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 387. [2020-02-10 20:18:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-02-10 20:18:54,984 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-02-10 20:18:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:54,984 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-02-10 20:18:54,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-02-10 20:18:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:54,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,985 INFO L415 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] [2020-02-10 20:18:54,985 INFO L427 AbstractCegarLoop]: === Iteration 1035 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash 442910932, now seen corresponding path program 1029 times [2020-02-10 20:18:54,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030192537] [2020-02-10 20:18:54,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:55,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030192537] [2020-02-10 20:18:55,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:55,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:55,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721695945] [2020-02-10 20:18:55,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:55,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:55,254 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:18:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:55,367 INFO L93 Difference]: Finished difference Result 624 states and 1838 transitions. [2020-02-10 20:18:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:55,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:55,369 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:18:55,369 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:18:55,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:18:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 390. [2020-02-10 20:18:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:18:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1330 transitions. [2020-02-10 20:18:55,378 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1330 transitions. Word has length 22 [2020-02-10 20:18:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:55,378 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1330 transitions. [2020-02-10 20:18:55,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1330 transitions. [2020-02-10 20:18:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:55,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:55,378 INFO L415 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] [2020-02-10 20:18:55,378 INFO L427 AbstractCegarLoop]: === Iteration 1036 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1316651612, now seen corresponding path program 1030 times [2020-02-10 20:18:55,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:55,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785435268] [2020-02-10 20:18:55,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:55,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785435268] [2020-02-10 20:18:55,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:55,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:55,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126624756] [2020-02-10 20:18:55,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:55,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:55,647 INFO L87 Difference]: Start difference. First operand 390 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:18:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:55,754 INFO L93 Difference]: Finished difference Result 616 states and 1829 transitions. [2020-02-10 20:18:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:55,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:55,756 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:18:55,756 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:18:55,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:18:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 387. [2020-02-10 20:18:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-02-10 20:18:55,765 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-02-10 20:18:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:55,765 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-02-10 20:18:55,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-02-10 20:18:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:55,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:55,765 INFO L415 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] [2020-02-10 20:18:55,765 INFO L427 AbstractCegarLoop]: === Iteration 1037 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1032799764, now seen corresponding path program 1031 times [2020-02-10 20:18:55,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:55,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425996053] [2020-02-10 20:18:55,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425996053] [2020-02-10 20:18:56,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:56,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233738008] [2020-02-10 20:18:56,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:56,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:56,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:56,039 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:18:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:56,148 INFO L93 Difference]: Finished difference Result 628 states and 1844 transitions. [2020-02-10 20:18:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:56,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:56,150 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:18:56,150 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:18:56,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:18:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 391. [2020-02-10 20:18:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:18:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1329 transitions. [2020-02-10 20:18:56,158 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1329 transitions. Word has length 22 [2020-02-10 20:18:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:56,159 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1329 transitions. [2020-02-10 20:18:56,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1329 transitions. [2020-02-10 20:18:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:56,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:56,159 INFO L415 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] [2020-02-10 20:18:56,159 INFO L427 AbstractCegarLoop]: === Iteration 1038 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1888106418, now seen corresponding path program 1032 times [2020-02-10 20:18:56,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:56,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334502816] [2020-02-10 20:18:56,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334502816] [2020-02-10 20:18:56,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:56,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901111021] [2020-02-10 20:18:56,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:56,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:56,424 INFO L87 Difference]: Start difference. First operand 391 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:18:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:56,546 INFO L93 Difference]: Finished difference Result 617 states and 1828 transitions. [2020-02-10 20:18:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:56,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:56,548 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:18:56,548 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:18:56,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:18:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 379. [2020-02-10 20:18:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:18:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1307 transitions. [2020-02-10 20:18:56,557 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1307 transitions. Word has length 22 [2020-02-10 20:18:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:56,557 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1307 transitions. [2020-02-10 20:18:56,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1307 transitions. [2020-02-10 20:18:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:56,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:56,558 INFO L415 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] [2020-02-10 20:18:56,558 INFO L427 AbstractCegarLoop]: === Iteration 1039 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -384165146, now seen corresponding path program 1033 times [2020-02-10 20:18:56,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:56,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749076221] [2020-02-10 20:18:56,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749076221] [2020-02-10 20:18:56,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:56,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337758374] [2020-02-10 20:18:56,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:56,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:56,816 INFO L87 Difference]: Start difference. First operand 379 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:18:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:56,897 INFO L93 Difference]: Finished difference Result 625 states and 1824 transitions. [2020-02-10 20:18:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:56,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:56,899 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:18:56,899 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:18:56,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:18:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 387. [2020-02-10 20:18:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:18:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 20:18:56,909 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 20:18:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:56,909 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 20:18:56,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 20:18:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:56,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:56,910 INFO L415 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] [2020-02-10 20:18:56,910 INFO L427 AbstractCegarLoop]: === Iteration 1040 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 176903346, now seen corresponding path program 1034 times [2020-02-10 20:18:56,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:56,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350919984] [2020-02-10 20:18:56,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:57,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350919984] [2020-02-10 20:18:57,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:57,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:57,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245549582] [2020-02-10 20:18:57,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:57,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:57,165 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:18:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,246 INFO L93 Difference]: Finished difference Result 618 states and 1809 transitions. [2020-02-10 20:18:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:57,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,248 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:18:57,248 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:18:57,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:18:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 385. [2020-02-10 20:18:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 20:18:57,258 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 20:18:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:57,258 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 20:18:57,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 20:18:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:57,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:57,259 INFO L415 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] [2020-02-10 20:18:57,259 INFO L427 AbstractCegarLoop]: === Iteration 1041 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 628527386, now seen corresponding path program 1035 times [2020-02-10 20:18:57,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:57,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779581500] [2020-02-10 20:18:57,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:57,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779581500] [2020-02-10 20:18:57,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:57,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:57,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456191310] [2020-02-10 20:18:57,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:57,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:57,525 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:18:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,610 INFO L93 Difference]: Finished difference Result 636 states and 1848 transitions. [2020-02-10 20:18:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:57,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,612 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:18:57,612 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:18:57,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:18:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 393. [2020-02-10 20:18:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:18:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1337 transitions. [2020-02-10 20:18:57,621 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1337 transitions. Word has length 22 [2020-02-10 20:18:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:57,621 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1337 transitions. [2020-02-10 20:18:57,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1337 transitions. [2020-02-10 20:18:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:57,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:57,621 INFO L415 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] [2020-02-10 20:18:57,622 INFO L427 AbstractCegarLoop]: === Iteration 1042 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash 498556940, now seen corresponding path program 1036 times [2020-02-10 20:18:57,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:57,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122628175] [2020-02-10 20:18:57,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:57,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122628175] [2020-02-10 20:18:57,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:57,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:57,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729466615] [2020-02-10 20:18:57,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:57,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:57,893 INFO L87 Difference]: Start difference. First operand 393 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:18:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,998 INFO L93 Difference]: Finished difference Result 634 states and 1838 transitions. [2020-02-10 20:18:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:57,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,999 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:18:57,999 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:18:58,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:18:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 385. [2020-02-10 20:18:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:18:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 20:18:58,009 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 20:18:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:58,009 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 20:18:58,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 20:18:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:58,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:58,010 INFO L415 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] [2020-02-10 20:18:58,010 INFO L427 AbstractCegarLoop]: === Iteration 1043 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash 683249612, now seen corresponding path program 1037 times [2020-02-10 20:18:58,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:58,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399903589] [2020-02-10 20:18:58,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:58,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399903589] [2020-02-10 20:18:58,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:58,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:58,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097163265] [2020-02-10 20:18:58,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:58,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:58,271 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:18:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:58,357 INFO L93 Difference]: Finished difference Result 615 states and 1801 transitions. [2020-02-10 20:18:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:58,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:58,358 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:18:58,358 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:18:58,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:18:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 386. [2020-02-10 20:18:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 20:18:58,367 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 20:18:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:58,367 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 20:18:58,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 20:18:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:58,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:58,368 INFO L415 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] [2020-02-10 20:18:58,368 INFO L427 AbstractCegarLoop]: === Iteration 1044 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash -392461544, now seen corresponding path program 1038 times [2020-02-10 20:18:58,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:58,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902552558] [2020-02-10 20:18:58,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:58,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902552558] [2020-02-10 20:18:58,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:58,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:58,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968199703] [2020-02-10 20:18:58,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:58,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:58,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:58,620 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:18:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:58,733 INFO L93 Difference]: Finished difference Result 620 states and 1810 transitions. [2020-02-10 20:18:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:58,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:58,735 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:18:58,735 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:18:58,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:18:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 382. [2020-02-10 20:18:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:18:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:18:58,745 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:18:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:58,745 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:18:58,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:18:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:58,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:58,746 INFO L415 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] [2020-02-10 20:18:58,746 INFO L427 AbstractCegarLoop]: === Iteration 1045 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:58,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1541868932, now seen corresponding path program 1039 times [2020-02-10 20:18:58,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:58,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576137975] [2020-02-10 20:18:58,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:59,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576137975] [2020-02-10 20:18:59,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:59,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:59,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295555743] [2020-02-10 20:18:59,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:59,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:59,006 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:18:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:59,088 INFO L93 Difference]: Finished difference Result 617 states and 1804 transitions. [2020-02-10 20:18:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:59,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:59,090 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:18:59,090 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:18:59,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:18:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 386. [2020-02-10 20:18:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:18:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 20:18:59,098 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 20:18:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:59,099 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 20:18:59,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 20:18:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:59,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:59,099 INFO L415 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] [2020-02-10 20:18:59,099 INFO L427 AbstractCegarLoop]: === Iteration 1046 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2102937424, now seen corresponding path program 1040 times [2020-02-10 20:18:59,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:59,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287657423] [2020-02-10 20:18:59,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:59,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287657423] [2020-02-10 20:18:59,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:59,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:59,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752302503] [2020-02-10 20:18:59,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:59,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:59,364 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:18:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:59,463 INFO L93 Difference]: Finished difference Result 610 states and 1789 transitions. [2020-02-10 20:18:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:59,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:59,465 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:18:59,465 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:18:59,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:18:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 384. [2020-02-10 20:18:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:18:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 20:18:59,475 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 20:18:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:59,475 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 20:18:59,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 20:18:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:59,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:59,476 INFO L415 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] [2020-02-10 20:18:59,476 INFO L427 AbstractCegarLoop]: === Iteration 1047 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 954123610, now seen corresponding path program 1041 times [2020-02-10 20:18:59,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:59,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094387818] [2020-02-10 20:18:59,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:59,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094387818] [2020-02-10 20:18:59,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:59,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:18:59,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995520380] [2020-02-10 20:18:59,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:18:59,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:18:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:18:59,760 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:18:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:59,857 INFO L93 Difference]: Finished difference Result 615 states and 1803 transitions. [2020-02-10 20:18:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:18:59,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:18:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:59,859 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:18:59,859 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:18:59,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:18:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-02-10 20:18:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:18:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1327 transitions. [2020-02-10 20:18:59,869 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1327 transitions. Word has length 22 [2020-02-10 20:18:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:59,869 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1327 transitions. [2020-02-10 20:18:59,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:18:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1327 transitions. [2020-02-10 20:18:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:18:59,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:59,869 INFO L415 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] [2020-02-10 20:18:59,870 INFO L427 AbstractCegarLoop]: === Iteration 1048 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:59,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1318927028, now seen corresponding path program 1042 times [2020-02-10 20:18:59,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:59,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827690695] [2020-02-10 20:18:59,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827690695] [2020-02-10 20:19:00,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:00,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184578539] [2020-02-10 20:19:00,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:00,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:00,153 INFO L87 Difference]: Start difference. First operand 389 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:19:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:00,255 INFO L93 Difference]: Finished difference Result 602 states and 1783 transitions. [2020-02-10 20:19:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:00,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:00,256 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:19:00,256 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:19:00,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:19:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-02-10 20:19:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:19:00,265 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:19:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:00,265 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:19:00,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:19:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:00,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:00,266 INFO L415 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] [2020-02-10 20:19:00,266 INFO L427 AbstractCegarLoop]: === Iteration 1049 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1008845836, now seen corresponding path program 1043 times [2020-02-10 20:19:00,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:00,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096685238] [2020-02-10 20:19:00,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096685238] [2020-02-10 20:19:00,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:00,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292225098] [2020-02-10 20:19:00,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:00,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:00,537 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:19:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:00,637 INFO L93 Difference]: Finished difference Result 604 states and 1777 transitions. [2020-02-10 20:19:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:00,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:00,639 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:19:00,639 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:19:00,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:19:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 385. [2020-02-10 20:19:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 20:19:00,648 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 20:19:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:00,648 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 20:19:00,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 20:19:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:00,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:00,649 INFO L415 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] [2020-02-10 20:19:00,649 INFO L427 AbstractCegarLoop]: === Iteration 1050 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:00,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:00,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1544075638, now seen corresponding path program 1044 times [2020-02-10 20:19:00,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:00,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018677967] [2020-02-10 20:19:00,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018677967] [2020-02-10 20:19:00,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:00,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465519542] [2020-02-10 20:19:00,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:00,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:00,915 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:19:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:01,013 INFO L93 Difference]: Finished difference Result 598 states and 1774 transitions. [2020-02-10 20:19:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:01,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:01,015 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:19:01,015 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:19:01,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:19:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 382. [2020-02-10 20:19:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-02-10 20:19:01,024 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-02-10 20:19:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,024 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-02-10 20:19:01,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-02-10 20:19:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:01,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,025 INFO L415 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] [2020-02-10 20:19:01,025 INFO L427 AbstractCegarLoop]: === Iteration 1051 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -411708412, now seen corresponding path program 1045 times [2020-02-10 20:19:01,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214403294] [2020-02-10 20:19:01,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:01,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214403294] [2020-02-10 20:19:01,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:01,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:01,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194421817] [2020-02-10 20:19:01,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:01,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:01,311 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:19:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:01,406 INFO L93 Difference]: Finished difference Result 640 states and 1861 transitions. [2020-02-10 20:19:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:01,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:01,407 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:19:01,408 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:19:01,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:19:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 396. [2020-02-10 20:19:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:19:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1346 transitions. [2020-02-10 20:19:01,416 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1346 transitions. Word has length 22 [2020-02-10 20:19:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,416 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1346 transitions. [2020-02-10 20:19:01,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1346 transitions. [2020-02-10 20:19:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:01,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,417 INFO L415 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] [2020-02-10 20:19:01,417 INFO L427 AbstractCegarLoop]: === Iteration 1052 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -541678858, now seen corresponding path program 1046 times [2020-02-10 20:19:01,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347256278] [2020-02-10 20:19:01,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:01,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347256278] [2020-02-10 20:19:01,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:01,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:01,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171131553] [2020-02-10 20:19:01,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:01,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:01,699 INFO L87 Difference]: Start difference. First operand 396 states and 1346 transitions. Second operand 9 states. [2020-02-10 20:19:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:01,799 INFO L93 Difference]: Finished difference Result 638 states and 1851 transitions. [2020-02-10 20:19:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:01,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:01,801 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:19:01,801 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:19:01,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:19:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 388. [2020-02-10 20:19:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1327 transitions. [2020-02-10 20:19:01,810 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1327 transitions. Word has length 22 [2020-02-10 20:19:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,810 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1327 transitions. [2020-02-10 20:19:01,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1327 transitions. [2020-02-10 20:19:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:01,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,810 INFO L415 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] [2020-02-10 20:19:01,811 INFO L427 AbstractCegarLoop]: === Iteration 1053 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2012146266, now seen corresponding path program 1047 times [2020-02-10 20:19:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935541020] [2020-02-10 20:19:01,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:02,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935541020] [2020-02-10 20:19:02,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:02,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:02,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330312063] [2020-02-10 20:19:02,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:02,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:02,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:02,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:02,085 INFO L87 Difference]: Start difference. First operand 388 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:19:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:02,164 INFO L93 Difference]: Finished difference Result 627 states and 1830 transitions. [2020-02-10 20:19:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:02,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:02,166 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:19:02,166 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:19:02,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:19:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 393. [2020-02-10 20:19:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:19:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1335 transitions. [2020-02-10 20:19:02,176 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1335 transitions. Word has length 22 [2020-02-10 20:19:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:02,176 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1335 transitions. [2020-02-10 20:19:02,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1335 transitions. [2020-02-10 20:19:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:02,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:02,177 INFO L415 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] [2020-02-10 20:19:02,177 INFO L427 AbstractCegarLoop]: === Iteration 1054 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 9770392, now seen corresponding path program 1048 times [2020-02-10 20:19:02,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:02,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513846357] [2020-02-10 20:19:02,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:02,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513846357] [2020-02-10 20:19:02,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:02,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:02,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973914652] [2020-02-10 20:19:02,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:02,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:02,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:02,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:02,450 INFO L87 Difference]: Start difference. First operand 393 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:19:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:02,552 INFO L93 Difference]: Finished difference Result 614 states and 1810 transitions. [2020-02-10 20:19:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:02,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:02,554 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:19:02,554 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:19:02,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:19:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 388. [2020-02-10 20:19:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2020-02-10 20:19:02,563 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 22 [2020-02-10 20:19:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:02,563 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2020-02-10 20:19:02,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2020-02-10 20:19:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:02,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:02,564 INFO L415 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] [2020-02-10 20:19:02,564 INFO L427 AbstractCegarLoop]: === Iteration 1055 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1458284190, now seen corresponding path program 1049 times [2020-02-10 20:19:02,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:02,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710626518] [2020-02-10 20:19:02,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:02,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710626518] [2020-02-10 20:19:02,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:02,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:02,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123996620] [2020-02-10 20:19:02,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:02,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:02,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:02,826 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:19:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:02,935 INFO L93 Difference]: Finished difference Result 624 states and 1820 transitions. [2020-02-10 20:19:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:02,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:02,936 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:19:02,937 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:19:02,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:19:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-02-10 20:19:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:19:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1329 transitions. [2020-02-10 20:19:02,946 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1329 transitions. Word has length 22 [2020-02-10 20:19:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:02,946 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1329 transitions. [2020-02-10 20:19:02,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1329 transitions. [2020-02-10 20:19:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:02,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:02,946 INFO L415 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] [2020-02-10 20:19:02,947 INFO L427 AbstractCegarLoop]: === Iteration 1056 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash -599409660, now seen corresponding path program 1050 times [2020-02-10 20:19:02,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:02,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027237272] [2020-02-10 20:19:02,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:03,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027237272] [2020-02-10 20:19:03,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:03,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688758249] [2020-02-10 20:19:03,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:03,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:03,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:03,219 INFO L87 Difference]: Start difference. First operand 392 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:19:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:03,343 INFO L93 Difference]: Finished difference Result 613 states and 1804 transitions. [2020-02-10 20:19:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:03,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:03,344 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:19:03,345 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:19:03,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:19:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 382. [2020-02-10 20:19:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 20:19:03,353 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 20:19:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:03,354 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 20:19:03,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 20:19:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:03,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:03,354 INFO L415 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] [2020-02-10 20:19:03,354 INFO L427 AbstractCegarLoop]: === Iteration 1057 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1126148752, now seen corresponding path program 1051 times [2020-02-10 20:19:03,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:03,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283130430] [2020-02-10 20:19:03,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:03,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283130430] [2020-02-10 20:19:03,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:03,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910946611] [2020-02-10 20:19:03,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:03,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:03,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:03,612 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:19:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:03,697 INFO L93 Difference]: Finished difference Result 603 states and 1773 transitions. [2020-02-10 20:19:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:03,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:03,699 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:19:03,699 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:19:03,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:19:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 384. [2020-02-10 20:19:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 20:19:03,708 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 20:19:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:03,708 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 20:19:03,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 20:19:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:03,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:03,709 INFO L415 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] [2020-02-10 20:19:03,709 INFO L427 AbstractCegarLoop]: === Iteration 1058 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 50437596, now seen corresponding path program 1052 times [2020-02-10 20:19:03,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:03,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656665444] [2020-02-10 20:19:03,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:03,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656665444] [2020-02-10 20:19:03,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:03,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385386672] [2020-02-10 20:19:03,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:03,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:03,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:03,983 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:19:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,123 INFO L93 Difference]: Finished difference Result 608 states and 1782 transitions. [2020-02-10 20:19:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:04,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:04,125 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:19:04,125 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:19:04,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:19:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 383. [2020-02-10 20:19:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1312 transitions. [2020-02-10 20:19:04,135 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1312 transitions. Word has length 22 [2020-02-10 20:19:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:04,135 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1312 transitions. [2020-02-10 20:19:04,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1312 transitions. [2020-02-10 20:19:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:04,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:04,136 INFO L415 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] [2020-02-10 20:19:04,136 INFO L427 AbstractCegarLoop]: === Iteration 1059 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash -474289102, now seen corresponding path program 1053 times [2020-02-10 20:19:04,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:04,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903108007] [2020-02-10 20:19:04,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:04,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903108007] [2020-02-10 20:19:04,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:04,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:04,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357855432] [2020-02-10 20:19:04,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:04,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:04,397 INFO L87 Difference]: Start difference. First operand 383 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:19:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,478 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-02-10 20:19:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:04,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:04,480 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:19:04,480 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:19:04,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:19:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-02-10 20:19:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 20:19:04,489 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 20:19:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:04,490 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 20:19:04,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 20:19:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:04,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:04,490 INFO L415 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] [2020-02-10 20:19:04,490 INFO L427 AbstractCegarLoop]: === Iteration 1060 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash 60940700, now seen corresponding path program 1054 times [2020-02-10 20:19:04,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:04,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092178047] [2020-02-10 20:19:04,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:04,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092178047] [2020-02-10 20:19:04,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:04,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:04,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971985068] [2020-02-10 20:19:04,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:04,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:04,751 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:19:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,872 INFO L93 Difference]: Finished difference Result 594 states and 1764 transitions. [2020-02-10 20:19:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:04,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:04,874 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:19:04,874 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:19:04,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:19:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 383. [2020-02-10 20:19:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 20:19:04,883 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 20:19:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:04,883 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 20:19:04,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 20:19:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:04,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:04,884 INFO L415 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] [2020-02-10 20:19:04,884 INFO L427 AbstractCegarLoop]: === Iteration 1061 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash -537307726, now seen corresponding path program 1055 times [2020-02-10 20:19:04,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:04,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511205913] [2020-02-10 20:19:04,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:05,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511205913] [2020-02-10 20:19:05,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:05,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:05,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066986968] [2020-02-10 20:19:05,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:05,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:05,151 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:19:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:05,261 INFO L93 Difference]: Finished difference Result 608 states and 1785 transitions. [2020-02-10 20:19:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:05,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:05,263 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:19:05,263 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:19:05,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:19:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 20:19:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1318 transitions. [2020-02-10 20:19:05,272 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1318 transitions. Word has length 22 [2020-02-10 20:19:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:05,272 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1318 transitions. [2020-02-10 20:19:05,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1318 transitions. [2020-02-10 20:19:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:05,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:05,273 INFO L415 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] [2020-02-10 20:19:05,273 INFO L427 AbstractCegarLoop]: === Iteration 1062 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1073633232, now seen corresponding path program 1056 times [2020-02-10 20:19:05,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:05,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543276836] [2020-02-10 20:19:05,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:05,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543276836] [2020-02-10 20:19:05,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:05,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:05,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965936653] [2020-02-10 20:19:05,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:05,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:05,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:05,529 INFO L87 Difference]: Start difference. First operand 387 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:19:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:05,639 INFO L93 Difference]: Finished difference Result 597 states and 1769 transitions. [2020-02-10 20:19:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:05,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:05,641 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:19:05,641 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:19:05,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:19:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 20:19:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:19:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1304 transitions. [2020-02-10 20:19:05,650 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1304 transitions. Word has length 22 [2020-02-10 20:19:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:05,650 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1304 transitions. [2020-02-10 20:19:05,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1304 transitions. [2020-02-10 20:19:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:05,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:05,651 INFO L415 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] [2020-02-10 20:19:05,651 INFO L427 AbstractCegarLoop]: === Iteration 1063 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1428641352, now seen corresponding path program 1057 times [2020-02-10 20:19:05,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:05,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16731350] [2020-02-10 20:19:05,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:05,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16731350] [2020-02-10 20:19:05,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:05,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:05,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173349186] [2020-02-10 20:19:05,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:05,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:05,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:05,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:05,908 INFO L87 Difference]: Start difference. First operand 379 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:19:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:06,030 INFO L93 Difference]: Finished difference Result 582 states and 1726 transitions. [2020-02-10 20:19:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:06,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:06,032 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:19:06,032 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:19:06,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:19:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 382. [2020-02-10 20:19:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 20:19:06,041 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 20:19:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:06,041 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 20:19:06,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 20:19:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:06,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:06,042 INFO L415 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] [2020-02-10 20:19:06,042 INFO L427 AbstractCegarLoop]: === Iteration 1064 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash -16875658, now seen corresponding path program 1058 times [2020-02-10 20:19:06,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:06,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264899675] [2020-02-10 20:19:06,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:06,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264899675] [2020-02-10 20:19:06,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:06,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:06,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961590445] [2020-02-10 20:19:06,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:06,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:06,313 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:19:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:06,395 INFO L93 Difference]: Finished difference Result 580 states and 1721 transitions. [2020-02-10 20:19:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:06,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:06,397 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:19:06,397 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:19:06,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:19:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2020-02-10 20:19:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:19:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 20:19:06,407 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 20:19:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:06,407 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 20:19:06,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 20:19:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:06,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:06,408 INFO L415 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] [2020-02-10 20:19:06,408 INFO L427 AbstractCegarLoop]: === Iteration 1065 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1853633412, now seen corresponding path program 1059 times [2020-02-10 20:19:06,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:06,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403205119] [2020-02-10 20:19:06,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:06,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403205119] [2020-02-10 20:19:06,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:06,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:06,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880334719] [2020-02-10 20:19:06,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:06,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:06,666 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:19:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:06,790 INFO L93 Difference]: Finished difference Result 589 states and 1741 transitions. [2020-02-10 20:19:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:06,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:06,792 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:19:06,792 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:19:06,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:19:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-02-10 20:19:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 20:19:06,801 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 20:19:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:06,801 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 20:19:06,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 20:19:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:06,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:06,802 INFO L415 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] [2020-02-10 20:19:06,802 INFO L427 AbstractCegarLoop]: === Iteration 1066 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash -467598282, now seen corresponding path program 1060 times [2020-02-10 20:19:06,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:06,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059774891] [2020-02-10 20:19:06,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:07,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059774891] [2020-02-10 20:19:07,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:07,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585223375] [2020-02-10 20:19:07,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:07,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:07,065 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:19:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:07,182 INFO L93 Difference]: Finished difference Result 592 states and 1744 transitions. [2020-02-10 20:19:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:07,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:07,184 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:19:07,184 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:19:07,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:19:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2020-02-10 20:19:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:19:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-02-10 20:19:07,193 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-02-10 20:19:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:07,194 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-02-10 20:19:07,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-02-10 20:19:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:07,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:07,195 INFO L415 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] [2020-02-10 20:19:07,195 INFO L427 AbstractCegarLoop]: === Iteration 1067 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash -604620980, now seen corresponding path program 1061 times [2020-02-10 20:19:07,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:07,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004912110] [2020-02-10 20:19:07,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:07,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004912110] [2020-02-10 20:19:07,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:07,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281442837] [2020-02-10 20:19:07,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:07,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:07,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:07,453 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:19:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:07,542 INFO L93 Difference]: Finished difference Result 583 states and 1726 transitions. [2020-02-10 20:19:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:07,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:07,544 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:19:07,544 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:19:07,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:19:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 382. [2020-02-10 20:19:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 20:19:07,553 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 20:19:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:07,553 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 20:19:07,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 20:19:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:07,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:07,554 INFO L415 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] [2020-02-10 20:19:07,554 INFO L427 AbstractCegarLoop]: === Iteration 1068 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1680332136, now seen corresponding path program 1062 times [2020-02-10 20:19:07,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:07,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689322896] [2020-02-10 20:19:07,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:07,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689322896] [2020-02-10 20:19:07,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:07,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181948667] [2020-02-10 20:19:07,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:07,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:07,825 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:19:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:07,938 INFO L93 Difference]: Finished difference Result 588 states and 1735 transitions. [2020-02-10 20:19:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:07,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:07,940 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:19:07,940 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:19:07,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:19:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 380. [2020-02-10 20:19:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-02-10 20:19:07,949 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-02-10 20:19:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:07,949 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-02-10 20:19:07,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-02-10 20:19:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:07,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:07,950 INFO L415 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] [2020-02-10 20:19:07,950 INFO L427 AbstractCegarLoop]: === Iteration 1069 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:07,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash -940291866, now seen corresponding path program 1063 times [2020-02-10 20:19:07,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:07,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266018609] [2020-02-10 20:19:07,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:08,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266018609] [2020-02-10 20:19:08,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:08,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:08,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529391150] [2020-02-10 20:19:08,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:08,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:08,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:08,209 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:19:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:08,343 INFO L93 Difference]: Finished difference Result 579 states and 1719 transitions. [2020-02-10 20:19:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:08,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:08,345 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:19:08,345 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:19:08,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:19:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-02-10 20:19:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1311 transitions. [2020-02-10 20:19:08,355 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1311 transitions. Word has length 22 [2020-02-10 20:19:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:08,355 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1311 transitions. [2020-02-10 20:19:08,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1311 transitions. [2020-02-10 20:19:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:08,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:08,356 INFO L415 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] [2020-02-10 20:19:08,356 INFO L427 AbstractCegarLoop]: === Iteration 1070 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1909158420, now seen corresponding path program 1064 times [2020-02-10 20:19:08,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:08,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203764048] [2020-02-10 20:19:08,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:08,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203764048] [2020-02-10 20:19:08,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:08,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:08,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143453075] [2020-02-10 20:19:08,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:08,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:08,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:08,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:08,626 INFO L87 Difference]: Start difference. First operand 382 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:19:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:08,721 INFO L93 Difference]: Finished difference Result 577 states and 1714 transitions. [2020-02-10 20:19:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:08,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:08,723 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:19:08,723 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:19:08,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:19:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 381. [2020-02-10 20:19:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:19:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-02-10 20:19:08,732 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-02-10 20:19:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:08,732 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-02-10 20:19:08,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-02-10 20:19:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:08,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:08,733 INFO L415 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] [2020-02-10 20:19:08,733 INFO L427 AbstractCegarLoop]: === Iteration 1071 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1528037188, now seen corresponding path program 1065 times [2020-02-10 20:19:08,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:08,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902768076] [2020-02-10 20:19:08,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:08,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902768076] [2020-02-10 20:19:08,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:08,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:08,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503963004] [2020-02-10 20:19:08,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:08,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:08,995 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:19:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:09,130 INFO L93 Difference]: Finished difference Result 581 states and 1725 transitions. [2020-02-10 20:19:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:09,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:09,132 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:19:09,132 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:19:09,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:19:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 384. [2020-02-10 20:19:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 20:19:09,141 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 20:19:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:09,141 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 20:19:09,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 20:19:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:09,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:09,142 INFO L415 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] [2020-02-10 20:19:09,142 INFO L427 AbstractCegarLoop]: === Iteration 1072 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1226019244, now seen corresponding path program 1066 times [2020-02-10 20:19:09,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:09,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74291314] [2020-02-10 20:19:09,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:09,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74291314] [2020-02-10 20:19:09,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:09,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:09,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632450768] [2020-02-10 20:19:09,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:09,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:09,410 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:19:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:09,547 INFO L93 Difference]: Finished difference Result 573 states and 1716 transitions. [2020-02-10 20:19:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:09,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:09,549 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:19:09,549 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:19:09,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:19:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 381. [2020-02-10 20:19:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:19:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-02-10 20:19:09,558 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-02-10 20:19:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:09,558 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-02-10 20:19:09,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-02-10 20:19:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:09,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:09,559 INFO L415 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] [2020-02-10 20:19:09,559 INFO L427 AbstractCegarLoop]: === Iteration 1073 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash -279024756, now seen corresponding path program 1067 times [2020-02-10 20:19:09,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:09,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070179165] [2020-02-10 20:19:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:09,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070179165] [2020-02-10 20:19:09,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:09,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:09,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029947721] [2020-02-10 20:19:09,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:09,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:09,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:09,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:09,822 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:19:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:09,932 INFO L93 Difference]: Finished difference Result 577 states and 1714 transitions. [2020-02-10 20:19:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:09,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:09,934 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:19:09,934 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:19:09,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:19:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-02-10 20:19:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 20:19:09,942 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 20:19:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:09,942 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 20:19:09,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 20:19:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:09,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:09,943 INFO L415 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] [2020-02-10 20:19:09,943 INFO L427 AbstractCegarLoop]: === Iteration 1074 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash 256205046, now seen corresponding path program 1068 times [2020-02-10 20:19:09,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:09,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172308523] [2020-02-10 20:19:09,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:10,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172308523] [2020-02-10 20:19:10,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:10,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:10,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961906582] [2020-02-10 20:19:10,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:10,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:10,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:10,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:10,229 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:19:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:10,346 INFO L93 Difference]: Finished difference Result 571 states and 1711 transitions. [2020-02-10 20:19:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:10,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:10,347 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:19:10,347 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:19:10,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:19:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 380. [2020-02-10 20:19:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1306 transitions. [2020-02-10 20:19:10,357 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1306 transitions. Word has length 22 [2020-02-10 20:19:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:10,357 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1306 transitions. [2020-02-10 20:19:10,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1306 transitions. [2020-02-10 20:19:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:10,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:10,358 INFO L415 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] [2020-02-10 20:19:10,358 INFO L427 AbstractCegarLoop]: === Iteration 1075 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1401098086, now seen corresponding path program 1069 times [2020-02-10 20:19:10,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:10,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338956367] [2020-02-10 20:19:10,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:10,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338956367] [2020-02-10 20:19:10,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:10,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:10,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763501148] [2020-02-10 20:19:10,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:10,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:10,613 INFO L87 Difference]: Start difference. First operand 380 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:19:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:10,744 INFO L93 Difference]: Finished difference Result 596 states and 1761 transitions. [2020-02-10 20:19:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:10,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:10,746 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:19:10,746 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:19:10,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:19:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-02-10 20:19:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 20:19:10,756 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 20:19:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:10,756 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 20:19:10,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 20:19:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:10,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:10,757 INFO L415 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] [2020-02-10 20:19:10,757 INFO L427 AbstractCegarLoop]: === Iteration 1076 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1507834080, now seen corresponding path program 1070 times [2020-02-10 20:19:10,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:10,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666974356] [2020-02-10 20:19:10,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:11,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666974356] [2020-02-10 20:19:11,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:11,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:11,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242507462] [2020-02-10 20:19:11,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:11,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:11,017 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:19:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,126 INFO L93 Difference]: Finished difference Result 599 states and 1764 transitions. [2020-02-10 20:19:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:11,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,128 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:19:11,128 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:19:11,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:19:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 383. [2020-02-10 20:19:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 20:19:11,137 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 20:19:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,137 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 20:19:11,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 20:19:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:11,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:11,138 INFO L415 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] [2020-02-10 20:19:11,138 INFO L427 AbstractCegarLoop]: === Iteration 1077 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash -199339768, now seen corresponding path program 1071 times [2020-02-10 20:19:11,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845512447] [2020-02-10 20:19:11,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:11,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845512447] [2020-02-10 20:19:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:11,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:11,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776583089] [2020-02-10 20:19:11,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:11,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:11,401 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:19:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,509 INFO L93 Difference]: Finished difference Result 591 states and 1749 transitions. [2020-02-10 20:19:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:11,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,511 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:19:11,511 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:19:11,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:19:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-02-10 20:19:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1319 transitions. [2020-02-10 20:19:11,521 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1319 transitions. Word has length 22 [2020-02-10 20:19:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,521 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1319 transitions. [2020-02-10 20:19:11,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1319 transitions. [2020-02-10 20:19:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:11,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:11,521 INFO L415 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] [2020-02-10 20:19:11,521 INFO L427 AbstractCegarLoop]: === Iteration 1078 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash 102678176, now seen corresponding path program 1072 times [2020-02-10 20:19:11,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039374174] [2020-02-10 20:19:11,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:11,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039374174] [2020-02-10 20:19:11,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:11,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:11,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474042981] [2020-02-10 20:19:11,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:11,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:11,785 INFO L87 Difference]: Start difference. First operand 386 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:19:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,919 INFO L93 Difference]: Finished difference Result 583 states and 1740 transitions. [2020-02-10 20:19:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:11,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,921 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:19:11,921 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:19:11,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:19:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 383. [2020-02-10 20:19:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 20:19:11,931 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 20:19:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,931 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 20:19:11,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 20:19:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:11,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:11,931 INFO L415 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] [2020-02-10 20:19:11,932 INFO L427 AbstractCegarLoop]: === Iteration 1079 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash -735212408, now seen corresponding path program 1073 times [2020-02-10 20:19:11,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289042804] [2020-02-10 20:19:11,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:12,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289042804] [2020-02-10 20:19:12,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:12,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:12,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921724747] [2020-02-10 20:19:12,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:12,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:12,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:12,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:12,179 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:19:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:12,310 INFO L93 Difference]: Finished difference Result 595 states and 1755 transitions. [2020-02-10 20:19:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:12,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:12,312 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:19:12,312 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:19:12,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:19:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 387. [2020-02-10 20:19:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1318 transitions. [2020-02-10 20:19:12,322 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1318 transitions. Word has length 22 [2020-02-10 20:19:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:12,322 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1318 transitions. [2020-02-10 20:19:12,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1318 transitions. [2020-02-10 20:19:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:12,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:12,323 INFO L415 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] [2020-02-10 20:19:12,323 INFO L427 AbstractCegarLoop]: === Iteration 1080 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 120094246, now seen corresponding path program 1074 times [2020-02-10 20:19:12,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:12,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308382302] [2020-02-10 20:19:12,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:12,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308382302] [2020-02-10 20:19:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250408557] [2020-02-10 20:19:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:12,581 INFO L87 Difference]: Start difference. First operand 387 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:19:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:12,697 INFO L93 Difference]: Finished difference Result 584 states and 1739 transitions. [2020-02-10 20:19:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:12,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:12,699 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:19:12,699 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:19:12,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:19:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 380. [2020-02-10 20:19:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1305 transitions. [2020-02-10 20:19:12,709 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1305 transitions. Word has length 22 [2020-02-10 20:19:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:12,709 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1305 transitions. [2020-02-10 20:19:12,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1305 transitions. [2020-02-10 20:19:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:12,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:12,710 INFO L415 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] [2020-02-10 20:19:12,710 INFO L427 AbstractCegarLoop]: === Iteration 1081 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:12,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash 281177300, now seen corresponding path program 1075 times [2020-02-10 20:19:12,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:12,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092186072] [2020-02-10 20:19:12,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:12,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092186072] [2020-02-10 20:19:12,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:12,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:12,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306078444] [2020-02-10 20:19:12,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:12,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:12,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:12,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:12,956 INFO L87 Difference]: Start difference. First operand 380 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:19:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:13,061 INFO L93 Difference]: Finished difference Result 584 states and 1728 transitions. [2020-02-10 20:19:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:13,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:13,063 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:19:13,063 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:19:13,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:19:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 20:19:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 20:19:13,072 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 20:19:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:13,073 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 20:19:13,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 20:19:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:13,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:13,073 INFO L415 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] [2020-02-10 20:19:13,073 INFO L427 AbstractCegarLoop]: === Iteration 1082 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -794533856, now seen corresponding path program 1076 times [2020-02-10 20:19:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:13,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744606414] [2020-02-10 20:19:13,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:13,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744606414] [2020-02-10 20:19:13,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:13,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:13,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734261184] [2020-02-10 20:19:13,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:13,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:13,315 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:19:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:13,444 INFO L93 Difference]: Finished difference Result 589 states and 1737 transitions. [2020-02-10 20:19:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:13,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:13,446 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:19:13,446 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:19:13,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:19:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 381. [2020-02-10 20:19:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:19:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1307 transitions. [2020-02-10 20:19:13,455 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1307 transitions. Word has length 22 [2020-02-10 20:19:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:13,455 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1307 transitions. [2020-02-10 20:19:13,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1307 transitions. [2020-02-10 20:19:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:13,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:13,456 INFO L415 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] [2020-02-10 20:19:13,456 INFO L427 AbstractCegarLoop]: === Iteration 1083 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:13,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1319260554, now seen corresponding path program 1077 times [2020-02-10 20:19:13,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:13,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862852109] [2020-02-10 20:19:13,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:13,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862852109] [2020-02-10 20:19:13,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:13,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:13,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436188523] [2020-02-10 20:19:13,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:13,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:13,717 INFO L87 Difference]: Start difference. First operand 381 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:19:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:13,828 INFO L93 Difference]: Finished difference Result 581 states and 1722 transitions. [2020-02-10 20:19:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:13,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:13,829 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:19:13,830 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:19:13,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:19:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 382. [2020-02-10 20:19:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 20:19:13,839 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 20:19:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:13,839 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 20:19:13,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 20:19:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:13,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:13,840 INFO L415 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] [2020-02-10 20:19:13,840 INFO L427 AbstractCegarLoop]: === Iteration 1084 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash -784030752, now seen corresponding path program 1078 times [2020-02-10 20:19:13,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:13,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001666176] [2020-02-10 20:19:13,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:14,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001666176] [2020-02-10 20:19:14,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:14,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:14,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511260400] [2020-02-10 20:19:14,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:14,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:14,090 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:19:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:14,222 INFO L93 Difference]: Finished difference Result 575 states and 1719 transitions. [2020-02-10 20:19:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:14,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:14,223 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:19:14,224 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:19:14,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:19:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 20:19:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:19:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 20:19:14,233 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 20:19:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:14,233 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 20:19:14,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 20:19:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:14,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:14,234 INFO L415 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] [2020-02-10 20:19:14,234 INFO L427 AbstractCegarLoop]: === Iteration 1085 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1382279178, now seen corresponding path program 1079 times [2020-02-10 20:19:14,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:14,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721321535] [2020-02-10 20:19:14,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:14,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721321535] [2020-02-10 20:19:14,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:14,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:14,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532759804] [2020-02-10 20:19:14,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:14,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:14,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:14,486 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:19:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:14,621 INFO L93 Difference]: Finished difference Result 589 states and 1740 transitions. [2020-02-10 20:19:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:14,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:14,622 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:19:14,622 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:19:14,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:19:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2020-02-10 20:19:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1313 transitions. [2020-02-10 20:19:14,632 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1313 transitions. Word has length 22 [2020-02-10 20:19:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:14,632 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1313 transitions. [2020-02-10 20:19:14,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1313 transitions. [2020-02-10 20:19:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:14,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:14,633 INFO L415 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] [2020-02-10 20:19:14,633 INFO L427 AbstractCegarLoop]: === Iteration 1086 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 228661780, now seen corresponding path program 1080 times [2020-02-10 20:19:14,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:14,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546660801] [2020-02-10 20:19:14,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:14,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546660801] [2020-02-10 20:19:14,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:14,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:14,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942891728] [2020-02-10 20:19:14,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:14,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:14,884 INFO L87 Difference]: Start difference. First operand 385 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:19:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,023 INFO L93 Difference]: Finished difference Result 578 states and 1724 transitions. [2020-02-10 20:19:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:15,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,024 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:19:15,025 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:19:15,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:19:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 376. [2020-02-10 20:19:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:19:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1298 transitions. [2020-02-10 20:19:15,033 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1298 transitions. Word has length 22 [2020-02-10 20:19:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,033 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1298 transitions. [2020-02-10 20:19:15,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1298 transitions. [2020-02-10 20:19:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:15,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,034 INFO L415 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] [2020-02-10 20:19:15,034 INFO L427 AbstractCegarLoop]: === Iteration 1087 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1636377640, now seen corresponding path program 1081 times [2020-02-10 20:19:15,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804013227] [2020-02-10 20:19:15,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:15,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804013227] [2020-02-10 20:19:15,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:15,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:15,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201483541] [2020-02-10 20:19:15,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:15,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:15,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:15,306 INFO L87 Difference]: Start difference. First operand 376 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:19:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,408 INFO L93 Difference]: Finished difference Result 647 states and 1916 transitions. [2020-02-10 20:19:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:15,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,410 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:19:15,410 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:19:15,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:19:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2020-02-10 20:19:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1350 transitions. [2020-02-10 20:19:15,420 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1350 transitions. Word has length 22 [2020-02-10 20:19:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,420 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1350 transitions. [2020-02-10 20:19:15,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1350 transitions. [2020-02-10 20:19:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:15,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,421 INFO L415 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] [2020-02-10 20:19:15,421 INFO L427 AbstractCegarLoop]: === Iteration 1088 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash -46111754, now seen corresponding path program 1082 times [2020-02-10 20:19:15,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636780078] [2020-02-10 20:19:15,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:15,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636780078] [2020-02-10 20:19:15,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:15,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:15,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203302857] [2020-02-10 20:19:15,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:15,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:15,693 INFO L87 Difference]: Start difference. First operand 391 states and 1350 transitions. Second operand 9 states. [2020-02-10 20:19:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,821 INFO L93 Difference]: Finished difference Result 642 states and 1903 transitions. [2020-02-10 20:19:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:15,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,823 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:19:15,823 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:19:15,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:19:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 387. [2020-02-10 20:19:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1341 transitions. [2020-02-10 20:19:15,833 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1341 transitions. Word has length 22 [2020-02-10 20:19:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,833 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1341 transitions. [2020-02-10 20:19:15,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1341 transitions. [2020-02-10 20:19:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:15,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,834 INFO L415 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] [2020-02-10 20:19:15,834 INFO L427 AbstractCegarLoop]: === Iteration 1089 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1535465468, now seen corresponding path program 1083 times [2020-02-10 20:19:15,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838991462] [2020-02-10 20:19:15,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:16,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838991462] [2020-02-10 20:19:16,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:16,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:16,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591971592] [2020-02-10 20:19:16,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:16,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:16,112 INFO L87 Difference]: Start difference. First operand 387 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:19:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:16,215 INFO L93 Difference]: Finished difference Result 645 states and 1908 transitions. [2020-02-10 20:19:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:16,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:16,217 INFO L225 Difference]: With dead ends: 645 [2020-02-10 20:19:16,217 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:19:16,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:19:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 390. [2020-02-10 20:19:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 20:19:16,227 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 20:19:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:16,227 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 20:19:16,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 20:19:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:16,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:16,227 INFO L415 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] [2020-02-10 20:19:16,228 INFO L427 AbstractCegarLoop]: === Iteration 1090 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1408829094, now seen corresponding path program 1084 times [2020-02-10 20:19:16,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:16,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181128562] [2020-02-10 20:19:16,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:16,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181128562] [2020-02-10 20:19:16,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:16,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:16,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309960881] [2020-02-10 20:19:16,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:16,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:16,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:16,502 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:19:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:16,639 INFO L93 Difference]: Finished difference Result 639 states and 1894 transitions. [2020-02-10 20:19:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:16,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:16,641 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:19:16,641 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:19:16,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:19:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 387. [2020-02-10 20:19:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 20:19:16,650 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 20:19:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:16,650 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 20:19:16,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 20:19:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:16,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:16,651 INFO L415 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] [2020-02-10 20:19:16,651 INFO L427 AbstractCegarLoop]: === Iteration 1091 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash 471120034, now seen corresponding path program 1085 times [2020-02-10 20:19:16,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:16,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581301671] [2020-02-10 20:19:16,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:16,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581301671] [2020-02-10 20:19:16,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:16,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816521491] [2020-02-10 20:19:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:16,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:16,924 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:19:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:17,052 INFO L93 Difference]: Finished difference Result 634 states and 1885 transitions. [2020-02-10 20:19:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:17,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:17,054 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:19:17,054 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:19:17,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:19:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 389. [2020-02-10 20:19:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 20:19:17,063 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 20:19:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:17,063 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 20:19:17,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 20:19:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:17,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:17,064 INFO L415 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] [2020-02-10 20:19:17,064 INFO L427 AbstractCegarLoop]: === Iteration 1092 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1813052822, now seen corresponding path program 1086 times [2020-02-10 20:19:17,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:17,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077275223] [2020-02-10 20:19:17,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:17,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077275223] [2020-02-10 20:19:17,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:17,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:17,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354972882] [2020-02-10 20:19:17,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:17,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:17,336 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 20:19:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:17,455 INFO L93 Difference]: Finished difference Result 633 states and 1881 transitions. [2020-02-10 20:19:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:17,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:17,457 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:19:17,457 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:19:17,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:19:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 384. [2020-02-10 20:19:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 20:19:17,467 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 20:19:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:17,467 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 20:19:17,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 20:19:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:17,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:17,468 INFO L415 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] [2020-02-10 20:19:17,468 INFO L427 AbstractCegarLoop]: === Iteration 1093 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1321022442, now seen corresponding path program 1087 times [2020-02-10 20:19:17,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:17,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351489716] [2020-02-10 20:19:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:17,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351489716] [2020-02-10 20:19:17,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:17,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:17,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280558961] [2020-02-10 20:19:17,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:17,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:17,756 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:19:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:17,859 INFO L93 Difference]: Finished difference Result 659 states and 1943 transitions. [2020-02-10 20:19:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:17,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:17,861 INFO L225 Difference]: With dead ends: 659 [2020-02-10 20:19:17,861 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 20:19:17,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 20:19:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 393. [2020-02-10 20:19:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:19:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-02-10 20:19:17,871 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-02-10 20:19:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:17,871 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-02-10 20:19:17,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-02-10 20:19:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:17,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:17,872 INFO L415 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] [2020-02-10 20:19:17,872 INFO L427 AbstractCegarLoop]: === Iteration 1094 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1383678968, now seen corresponding path program 1088 times [2020-02-10 20:19:17,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:17,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86503833] [2020-02-10 20:19:17,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86503833] [2020-02-10 20:19:18,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:18,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456138208] [2020-02-10 20:19:18,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:18,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:18,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:18,152 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-02-10 20:19:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:18,276 INFO L93 Difference]: Finished difference Result 654 states and 1930 transitions. [2020-02-10 20:19:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:18,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:18,278 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:19:18,278 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:19:18,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:19:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 389. [2020-02-10 20:19:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 20:19:18,287 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 20:19:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:18,287 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 20:19:18,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 20:19:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:18,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:18,288 INFO L415 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] [2020-02-10 20:19:18,288 INFO L427 AbstractCegarLoop]: === Iteration 1095 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1586073306, now seen corresponding path program 1089 times [2020-02-10 20:19:18,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:18,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509410004] [2020-02-10 20:19:18,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509410004] [2020-02-10 20:19:18,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:18,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769131053] [2020-02-10 20:19:18,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:18,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:18,572 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:19:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:18,678 INFO L93 Difference]: Finished difference Result 666 states and 1955 transitions. [2020-02-10 20:19:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:18,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:18,680 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:19:18,680 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:19:18,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:19:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 397. [2020-02-10 20:19:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:19:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1356 transitions. [2020-02-10 20:19:18,690 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1356 transitions. Word has length 22 [2020-02-10 20:19:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:18,690 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1356 transitions. [2020-02-10 20:19:18,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1356 transitions. [2020-02-10 20:19:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:18,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:18,691 INFO L415 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] [2020-02-10 20:19:18,691 INFO L427 AbstractCegarLoop]: === Iteration 1096 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash 88501756, now seen corresponding path program 1090 times [2020-02-10 20:19:18,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:18,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282246594] [2020-02-10 20:19:18,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282246594] [2020-02-10 20:19:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:18,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76741618] [2020-02-10 20:19:18,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:18,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:18,985 INFO L87 Difference]: Start difference. First operand 397 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:19:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:19,115 INFO L93 Difference]: Finished difference Result 664 states and 1945 transitions. [2020-02-10 20:19:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:19,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,117 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:19:19,117 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:19:19,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:19:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 389. [2020-02-10 20:19:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 20:19:19,127 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 20:19:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:19,127 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 20:19:19,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 20:19:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:19,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:19,128 INFO L415 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] [2020-02-10 20:19:19,128 INFO L427 AbstractCegarLoop]: === Iteration 1097 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash 370776892, now seen corresponding path program 1091 times [2020-02-10 20:19:19,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:19,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637873633] [2020-02-10 20:19:19,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:19,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637873633] [2020-02-10 20:19:19,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:19,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:19,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956264685] [2020-02-10 20:19:19,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:19,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:19,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:19,402 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:19:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:19,531 INFO L93 Difference]: Finished difference Result 651 states and 1920 transitions. [2020-02-10 20:19:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:19,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,533 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:19:19,533 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 20:19:19,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 20:19:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 392. [2020-02-10 20:19:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:19:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1343 transitions. [2020-02-10 20:19:19,542 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1343 transitions. Word has length 22 [2020-02-10 20:19:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:19,543 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1343 transitions. [2020-02-10 20:19:19,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1343 transitions. [2020-02-10 20:19:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:19,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:19,543 INFO L415 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] [2020-02-10 20:19:19,543 INFO L427 AbstractCegarLoop]: === Iteration 1098 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash 389210918, now seen corresponding path program 1092 times [2020-02-10 20:19:19,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:19,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971786932] [2020-02-10 20:19:19,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:19,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971786932] [2020-02-10 20:19:19,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:19,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:19,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975558530] [2020-02-10 20:19:19,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:19,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:19,817 INFO L87 Difference]: Start difference. First operand 392 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:19:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:19,948 INFO L93 Difference]: Finished difference Result 654 states and 1923 transitions. [2020-02-10 20:19:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:19,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,950 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:19:19,950 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:19:19,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:19:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 384. [2020-02-10 20:19:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 20:19:19,958 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 20:19:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:19,958 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 20:19:19,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 20:19:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:19,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:19,959 INFO L415 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] [2020-02-10 20:19:19,959 INFO L427 AbstractCegarLoop]: === Iteration 1099 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2037057798, now seen corresponding path program 1093 times [2020-02-10 20:19:19,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:19,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643714100] [2020-02-10 20:19:19,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:20,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643714100] [2020-02-10 20:19:20,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:20,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:20,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075502784] [2020-02-10 20:19:20,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:20,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:20,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:20,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:20,245 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:19:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:20,346 INFO L93 Difference]: Finished difference Result 653 states and 1922 transitions. [2020-02-10 20:19:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:20,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:20,348 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:19:20,348 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:19:20,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:19:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 20:19:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1343 transitions. [2020-02-10 20:19:20,358 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1343 transitions. Word has length 22 [2020-02-10 20:19:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:20,358 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1343 transitions. [2020-02-10 20:19:20,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1343 transitions. [2020-02-10 20:19:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:20,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:20,359 INFO L415 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] [2020-02-10 20:19:20,359 INFO L427 AbstractCegarLoop]: === Iteration 1100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1910421424, now seen corresponding path program 1094 times [2020-02-10 20:19:20,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:20,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242356346] [2020-02-10 20:19:20,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:20,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242356346] [2020-02-10 20:19:20,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:20,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:20,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293215951] [2020-02-10 20:19:20,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:20,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:20,638 INFO L87 Difference]: Start difference. First operand 391 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:19:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:20,766 INFO L93 Difference]: Finished difference Result 647 states and 1908 transitions. [2020-02-10 20:19:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:20,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:20,767 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:19:20,768 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:19:20,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:19:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 388. [2020-02-10 20:19:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 20:19:20,776 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 20:19:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:20,776 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 20:19:20,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 20:19:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:20,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:20,777 INFO L415 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] [2020-02-10 20:19:20,777 INFO L427 AbstractCegarLoop]: === Iteration 1101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash -428742616, now seen corresponding path program 1095 times [2020-02-10 20:19:20,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:20,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885010522] [2020-02-10 20:19:20,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:21,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885010522] [2020-02-10 20:19:21,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:21,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:21,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670809083] [2020-02-10 20:19:21,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:21,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:21,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:21,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:21,057 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:19:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:21,166 INFO L93 Difference]: Finished difference Result 662 states and 1940 transitions. [2020-02-10 20:19:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:21,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:21,167 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:19:21,168 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:19:21,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:19:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 396. [2020-02-10 20:19:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:19:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1349 transitions. [2020-02-10 20:19:21,177 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1349 transitions. Word has length 22 [2020-02-10 20:19:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:21,177 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1349 transitions. [2020-02-10 20:19:21,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1349 transitions. [2020-02-10 20:19:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:21,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:21,178 INFO L415 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] [2020-02-10 20:19:21,178 INFO L427 AbstractCegarLoop]: === Iteration 1102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1078188208, now seen corresponding path program 1096 times [2020-02-10 20:19:21,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:21,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322876316] [2020-02-10 20:19:21,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:21,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322876316] [2020-02-10 20:19:21,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050369814] [2020-02-10 20:19:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:21,460 INFO L87 Difference]: Start difference. First operand 396 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:19:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:21,586 INFO L93 Difference]: Finished difference Result 660 states and 1930 transitions. [2020-02-10 20:19:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:21,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:21,588 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:19:21,588 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:19:21,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:19:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 388. [2020-02-10 20:19:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-02-10 20:19:21,597 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-02-10 20:19:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:21,597 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-02-10 20:19:21,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-02-10 20:19:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:21,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:21,598 INFO L415 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] [2020-02-10 20:19:21,598 INFO L427 AbstractCegarLoop]: === Iteration 1103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1846690294, now seen corresponding path program 1097 times [2020-02-10 20:19:21,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:21,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219565867] [2020-02-10 20:19:21,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:21,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219565867] [2020-02-10 20:19:21,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:21,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:21,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473305489] [2020-02-10 20:19:21,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:21,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:21,866 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:19:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:21,996 INFO L93 Difference]: Finished difference Result 644 states and 1899 transitions. [2020-02-10 20:19:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:21,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:21,998 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:19:21,998 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:19:21,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:19:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 390. [2020-02-10 20:19:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1335 transitions. [2020-02-10 20:19:22,008 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1335 transitions. Word has length 22 [2020-02-10 20:19:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:22,008 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1335 transitions. [2020-02-10 20:19:22,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1335 transitions. [2020-02-10 20:19:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:22,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:22,009 INFO L415 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] [2020-02-10 20:19:22,009 INFO L427 AbstractCegarLoop]: === Iteration 1104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash 928740104, now seen corresponding path program 1098 times [2020-02-10 20:19:22,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:22,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414626214] [2020-02-10 20:19:22,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:22,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414626214] [2020-02-10 20:19:22,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:22,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:22,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92201617] [2020-02-10 20:19:22,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:22,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:22,285 INFO L87 Difference]: Start difference. First operand 390 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:19:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:22,394 INFO L93 Difference]: Finished difference Result 648 states and 1905 transitions. [2020-02-10 20:19:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:22,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:22,396 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:19:22,396 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:19:22,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:19:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 384. [2020-02-10 20:19:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 20:19:22,405 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 20:19:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:22,405 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 20:19:22,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 20:19:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:22,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:22,406 INFO L415 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] [2020-02-10 20:19:22,406 INFO L427 AbstractCegarLoop]: === Iteration 1105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1063619292, now seen corresponding path program 1099 times [2020-02-10 20:19:22,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:22,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611878547] [2020-02-10 20:19:22,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:22,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611878547] [2020-02-10 20:19:22,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:22,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:22,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197202914] [2020-02-10 20:19:22,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:22,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:22,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:22,687 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:19:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:22,806 INFO L93 Difference]: Finished difference Result 629 states and 1870 transitions. [2020-02-10 20:19:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:22,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:22,808 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:19:22,808 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:19:22,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:19:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 388. [2020-02-10 20:19:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1333 transitions. [2020-02-10 20:19:22,818 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1333 transitions. Word has length 22 [2020-02-10 20:19:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:22,818 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1333 transitions. [2020-02-10 20:19:22,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1333 transitions. [2020-02-10 20:19:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:22,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:22,818 INFO L415 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] [2020-02-10 20:19:22,819 INFO L427 AbstractCegarLoop]: === Iteration 1106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1889415216, now seen corresponding path program 1100 times [2020-02-10 20:19:22,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:22,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153866688] [2020-02-10 20:19:22,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:23,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153866688] [2020-02-10 20:19:23,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:23,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:23,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721787611] [2020-02-10 20:19:23,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:23,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:23,092 INFO L87 Difference]: Start difference. First operand 388 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:19:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:23,232 INFO L93 Difference]: Finished difference Result 628 states and 1866 transitions. [2020-02-10 20:19:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:23,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:23,234 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:19:23,234 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:19:23,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:19:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 386. [2020-02-10 20:19:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 20:19:23,243 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 20:19:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:23,243 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 20:19:23,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 20:19:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:23,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:23,243 INFO L415 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] [2020-02-10 20:19:23,244 INFO L427 AbstractCegarLoop]: === Iteration 1107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1623032822, now seen corresponding path program 1101 times [2020-02-10 20:19:23,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:23,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534080123] [2020-02-10 20:19:23,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:23,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534080123] [2020-02-10 20:19:23,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:23,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:23,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124260134] [2020-02-10 20:19:23,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:23,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:23,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:23,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:23,516 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:19:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:23,646 INFO L93 Difference]: Finished difference Result 634 states and 1879 transitions. [2020-02-10 20:19:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:23,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:23,648 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:19:23,648 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:19:23,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:19:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 389. [2020-02-10 20:19:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1333 transitions. [2020-02-10 20:19:23,658 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1333 transitions. Word has length 22 [2020-02-10 20:19:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:23,658 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1333 transitions. [2020-02-10 20:19:23,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1333 transitions. [2020-02-10 20:19:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:23,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:23,659 INFO L415 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] [2020-02-10 20:19:23,659 INFO L427 AbstractCegarLoop]: === Iteration 1108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash -756472838, now seen corresponding path program 1102 times [2020-02-10 20:19:23,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:23,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964337777] [2020-02-10 20:19:23,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:23,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964337777] [2020-02-10 20:19:23,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:23,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:23,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466849313] [2020-02-10 20:19:23,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:23,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:23,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:23,929 INFO L87 Difference]: Start difference. First operand 389 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:19:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,059 INFO L93 Difference]: Finished difference Result 637 states and 1882 transitions. [2020-02-10 20:19:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:24,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,061 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:19:24,061 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:19:24,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:19:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 386. [2020-02-10 20:19:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1326 transitions. [2020-02-10 20:19:24,070 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1326 transitions. Word has length 22 [2020-02-10 20:19:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,070 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1326 transitions. [2020-02-10 20:19:24,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1326 transitions. [2020-02-10 20:19:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:24,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,071 INFO L415 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] [2020-02-10 20:19:24,071 INFO L427 AbstractCegarLoop]: === Iteration 1109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1354185414, now seen corresponding path program 1103 times [2020-02-10 20:19:24,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158423429] [2020-02-10 20:19:24,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:24,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158423429] [2020-02-10 20:19:24,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:24,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:24,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957058973] [2020-02-10 20:19:24,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:24,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:24,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:24,345 INFO L87 Difference]: Start difference. First operand 386 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:19:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,475 INFO L93 Difference]: Finished difference Result 631 states and 1870 transitions. [2020-02-10 20:19:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:24,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,477 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:19:24,477 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:19:24,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:19:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-02-10 20:19:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1329 transitions. [2020-02-10 20:19:24,486 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1329 transitions. Word has length 22 [2020-02-10 20:19:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,486 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1329 transitions. [2020-02-10 20:19:24,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1329 transitions. [2020-02-10 20:19:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:24,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,487 INFO L415 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] [2020-02-10 20:19:24,487 INFO L427 AbstractCegarLoop]: === Iteration 1110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2022831692, now seen corresponding path program 1104 times [2020-02-10 20:19:24,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828872018] [2020-02-10 20:19:24,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:24,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828872018] [2020-02-10 20:19:24,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:24,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:24,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907327664] [2020-02-10 20:19:24,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:24,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:24,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:24,752 INFO L87 Difference]: Start difference. First operand 388 states and 1329 transitions. Second operand 9 states. [2020-02-10 20:19:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,873 INFO L93 Difference]: Finished difference Result 635 states and 1876 transitions. [2020-02-10 20:19:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:24,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,875 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:19:24,875 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:19:24,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:19:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 380. [2020-02-10 20:19:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1314 transitions. [2020-02-10 20:19:24,884 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1314 transitions. Word has length 22 [2020-02-10 20:19:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,885 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1314 transitions. [2020-02-10 20:19:24,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1314 transitions. [2020-02-10 20:19:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:24,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,885 INFO L415 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] [2020-02-10 20:19:24,885 INFO L427 AbstractCegarLoop]: === Iteration 1111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1848533258, now seen corresponding path program 1105 times [2020-02-10 20:19:24,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442195523] [2020-02-10 20:19:24,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:25,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442195523] [2020-02-10 20:19:25,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:25,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:25,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958112190] [2020-02-10 20:19:25,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:25,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:25,153 INFO L87 Difference]: Start difference. First operand 380 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:19:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:25,238 INFO L93 Difference]: Finished difference Result 636 states and 1884 transitions. [2020-02-10 20:19:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:25,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:25,240 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:19:25,240 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:19:25,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:19:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 390. [2020-02-10 20:19:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 20:19:25,250 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 20:19:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:25,250 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 20:19:25,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 20:19:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:25,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:25,250 INFO L415 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] [2020-02-10 20:19:25,251 INFO L427 AbstractCegarLoop]: === Iteration 1112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash -258267372, now seen corresponding path program 1106 times [2020-02-10 20:19:25,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:25,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716245564] [2020-02-10 20:19:25,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:25,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716245564] [2020-02-10 20:19:25,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:25,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:25,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382094685] [2020-02-10 20:19:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:25,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:25,518 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:19:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:25,650 INFO L93 Difference]: Finished difference Result 631 states and 1871 transitions. [2020-02-10 20:19:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:25,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:25,651 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:19:25,652 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:19:25,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:19:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 386. [2020-02-10 20:19:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 20:19:25,661 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 20:19:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:25,661 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 20:19:25,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 20:19:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:25,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:25,662 INFO L415 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] [2020-02-10 20:19:25,662 INFO L427 AbstractCegarLoop]: === Iteration 1113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1747621086, now seen corresponding path program 1107 times [2020-02-10 20:19:25,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:25,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76130188] [2020-02-10 20:19:25,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:25,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76130188] [2020-02-10 20:19:25,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:25,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:25,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663040502] [2020-02-10 20:19:25,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:25,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:25,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:25,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:25,936 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:19:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:26,045 INFO L93 Difference]: Finished difference Result 634 states and 1876 transitions. [2020-02-10 20:19:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:26,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:26,047 INFO L225 Difference]: With dead ends: 634 [2020-02-10 20:19:26,047 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:19:26,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:19:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 389. [2020-02-10 20:19:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 20:19:26,056 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 20:19:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:26,056 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 20:19:26,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 20:19:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:26,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:26,057 INFO L415 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] [2020-02-10 20:19:26,057 INFO L427 AbstractCegarLoop]: === Iteration 1114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1620984712, now seen corresponding path program 1108 times [2020-02-10 20:19:26,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:26,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713807765] [2020-02-10 20:19:26,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:26,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713807765] [2020-02-10 20:19:26,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:26,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:26,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655475352] [2020-02-10 20:19:26,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:26,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:26,332 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:19:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:26,470 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-02-10 20:19:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:26,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:26,472 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:19:26,472 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:19:26,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:19:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 386. [2020-02-10 20:19:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-02-10 20:19:26,481 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-02-10 20:19:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:26,482 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-02-10 20:19:26,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-02-10 20:19:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:26,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:26,482 INFO L415 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] [2020-02-10 20:19:26,482 INFO L427 AbstractCegarLoop]: === Iteration 1115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash 258964416, now seen corresponding path program 1109 times [2020-02-10 20:19:26,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:26,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118388608] [2020-02-10 20:19:26,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:26,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118388608] [2020-02-10 20:19:26,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:26,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:26,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954604044] [2020-02-10 20:19:26,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:26,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:26,751 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:19:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:26,882 INFO L93 Difference]: Finished difference Result 623 states and 1853 transitions. [2020-02-10 20:19:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:26,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:26,884 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:19:26,884 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:19:26,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:19:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 388. [2020-02-10 20:19:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1334 transitions. [2020-02-10 20:19:26,894 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1334 transitions. Word has length 22 [2020-02-10 20:19:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:26,894 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1334 transitions. [2020-02-10 20:19:26,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1334 transitions. [2020-02-10 20:19:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:26,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:26,894 INFO L415 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] [2020-02-10 20:19:26,895 INFO L427 AbstractCegarLoop]: === Iteration 1116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1600897204, now seen corresponding path program 1110 times [2020-02-10 20:19:26,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:26,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696342446] [2020-02-10 20:19:26,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:27,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696342446] [2020-02-10 20:19:27,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:27,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:27,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918811184] [2020-02-10 20:19:27,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:27,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:27,164 INFO L87 Difference]: Start difference. First operand 388 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:19:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:27,264 INFO L93 Difference]: Finished difference Result 622 states and 1849 transitions. [2020-02-10 20:19:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:27,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:27,265 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:19:27,266 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:19:27,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:19:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 383. [2020-02-10 20:19:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 20:19:27,275 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 20:19:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:27,275 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 20:19:27,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 20:19:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:27,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:27,276 INFO L415 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] [2020-02-10 20:19:27,276 INFO L427 AbstractCegarLoop]: === Iteration 1117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash 686381098, now seen corresponding path program 1111 times [2020-02-10 20:19:27,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:27,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594702162] [2020-02-10 20:19:27,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:27,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594702162] [2020-02-10 20:19:27,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:27,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:27,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268101302] [2020-02-10 20:19:27,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:27,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:27,554 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:19:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:27,630 INFO L93 Difference]: Finished difference Result 638 states and 1888 transitions. [2020-02-10 20:19:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:27,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:27,631 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:19:27,632 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:19:27,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:19:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 391. [2020-02-10 20:19:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1344 transitions. [2020-02-10 20:19:27,640 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1344 transitions. Word has length 22 [2020-02-10 20:19:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:27,640 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1344 transitions. [2020-02-10 20:19:27,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1344 transitions. [2020-02-10 20:19:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:27,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:27,641 INFO L415 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] [2020-02-10 20:19:27,641 INFO L427 AbstractCegarLoop]: === Iteration 1118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2018320312, now seen corresponding path program 1112 times [2020-02-10 20:19:27,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:27,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090737536] [2020-02-10 20:19:27,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:27,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090737536] [2020-02-10 20:19:27,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:27,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:27,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623620071] [2020-02-10 20:19:27,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:27,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:27,913 INFO L87 Difference]: Start difference. First operand 391 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:19:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:28,018 INFO L93 Difference]: Finished difference Result 633 states and 1875 transitions. [2020-02-10 20:19:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:28,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:28,019 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:19:28,019 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:19:28,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:19:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 387. [2020-02-10 20:19:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 20:19:28,029 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 20:19:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,029 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 20:19:28,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 20:19:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:28,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,030 INFO L415 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] [2020-02-10 20:19:28,030 INFO L427 AbstractCegarLoop]: === Iteration 1119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash -662295654, now seen corresponding path program 1113 times [2020-02-10 20:19:28,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705932677] [2020-02-10 20:19:28,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:28,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705932677] [2020-02-10 20:19:28,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:28,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:28,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458110553] [2020-02-10 20:19:28,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:28,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:28,302 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:19:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:28,376 INFO L93 Difference]: Finished difference Result 632 states and 1875 transitions. [2020-02-10 20:19:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:28,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:28,378 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:19:28,378 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:19:28,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:19:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 392. [2020-02-10 20:19:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:19:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1342 transitions. [2020-02-10 20:19:28,387 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1342 transitions. Word has length 22 [2020-02-10 20:19:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,387 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1342 transitions. [2020-02-10 20:19:28,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1342 transitions. [2020-02-10 20:19:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:28,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,388 INFO L415 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] [2020-02-10 20:19:28,388 INFO L427 AbstractCegarLoop]: === Iteration 1120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1931343740, now seen corresponding path program 1114 times [2020-02-10 20:19:28,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944274312] [2020-02-10 20:19:28,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:28,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944274312] [2020-02-10 20:19:28,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:28,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:28,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934576591] [2020-02-10 20:19:28,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:28,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:28,672 INFO L87 Difference]: Start difference. First operand 392 states and 1342 transitions. Second operand 9 states. [2020-02-10 20:19:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:28,771 INFO L93 Difference]: Finished difference Result 619 states and 1855 transitions. [2020-02-10 20:19:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:28,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:28,772 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:19:28,773 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:19:28,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:19:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 387. [2020-02-10 20:19:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-02-10 20:19:28,782 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-02-10 20:19:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,782 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-02-10 20:19:28,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-02-10 20:19:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:28,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,783 INFO L415 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] [2020-02-10 20:19:28,783 INFO L427 AbstractCegarLoop]: === Iteration 1121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1877592068, now seen corresponding path program 1115 times [2020-02-10 20:19:28,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155907971] [2020-02-10 20:19:28,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:29,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155907971] [2020-02-10 20:19:29,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:29,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:29,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432380395] [2020-02-10 20:19:29,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:29,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:29,054 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:19:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:29,152 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-02-10 20:19:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:29,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:29,154 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:19:29,154 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:19:29,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:19:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 390. [2020-02-10 20:19:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1335 transitions. [2020-02-10 20:19:29,164 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1335 transitions. Word has length 22 [2020-02-10 20:19:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:29,164 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1335 transitions. [2020-02-10 20:19:29,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1335 transitions. [2020-02-10 20:19:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:29,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:29,165 INFO L415 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] [2020-02-10 20:19:29,165 INFO L427 AbstractCegarLoop]: === Iteration 1122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1003851388, now seen corresponding path program 1116 times [2020-02-10 20:19:29,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:29,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130431814] [2020-02-10 20:19:29,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:29,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130431814] [2020-02-10 20:19:29,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:29,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:29,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056129571] [2020-02-10 20:19:29,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:29,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:29,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:29,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:29,441 INFO L87 Difference]: Start difference. First operand 390 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:19:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:29,541 INFO L93 Difference]: Finished difference Result 617 states and 1848 transitions. [2020-02-10 20:19:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:29,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:29,542 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:19:29,543 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:19:29,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:19:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 383. [2020-02-10 20:19:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1321 transitions. [2020-02-10 20:19:29,551 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1321 transitions. Word has length 22 [2020-02-10 20:19:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:29,552 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1321 transitions. [2020-02-10 20:19:29,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1321 transitions. [2020-02-10 20:19:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:29,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:29,552 INFO L415 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] [2020-02-10 20:19:29,552 INFO L427 AbstractCegarLoop]: === Iteration 1123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1948864378, now seen corresponding path program 1117 times [2020-02-10 20:19:29,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:29,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476080154] [2020-02-10 20:19:29,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:29,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476080154] [2020-02-10 20:19:29,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:29,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:29,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863726828] [2020-02-10 20:19:29,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:29,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:29,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:29,818 INFO L87 Difference]: Start difference. First operand 383 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:19:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:29,904 INFO L93 Difference]: Finished difference Result 633 states and 1871 transitions. [2020-02-10 20:19:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:29,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:29,906 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:19:29,906 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:19:29,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:19:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 389. [2020-02-10 20:19:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1335 transitions. [2020-02-10 20:19:29,916 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1335 transitions. Word has length 22 [2020-02-10 20:19:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:29,916 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1335 transitions. [2020-02-10 20:19:29,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1335 transitions. [2020-02-10 20:19:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:29,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:29,917 INFO L415 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] [2020-02-10 20:19:29,917 INFO L427 AbstractCegarLoop]: === Iteration 1124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2075500752, now seen corresponding path program 1118 times [2020-02-10 20:19:29,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:29,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772109551] [2020-02-10 20:19:29,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772109551] [2020-02-10 20:19:30,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:30,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138912020] [2020-02-10 20:19:30,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:30,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:30,179 INFO L87 Difference]: Start difference. First operand 389 states and 1335 transitions. Second operand 9 states. [2020-02-10 20:19:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:30,276 INFO L93 Difference]: Finished difference Result 627 states and 1857 transitions. [2020-02-10 20:19:30,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:30,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:30,278 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:19:30,278 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:19:30,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:19:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 386. [2020-02-10 20:19:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 20:19:30,288 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 20:19:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:30,288 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 20:19:30,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 20:19:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:30,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:30,288 INFO L415 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] [2020-02-10 20:19:30,289 INFO L427 AbstractCegarLoop]: === Iteration 1125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash 873153222, now seen corresponding path program 1119 times [2020-02-10 20:19:30,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:30,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467923470] [2020-02-10 20:19:30,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467923470] [2020-02-10 20:19:30,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:30,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028822634] [2020-02-10 20:19:30,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:30,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:30,574 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:19:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:30,663 INFO L93 Difference]: Finished difference Result 629 states and 1864 transitions. [2020-02-10 20:19:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:30,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:30,665 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:19:30,665 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:19:30,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:19:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 391. [2020-02-10 20:19:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1336 transitions. [2020-02-10 20:19:30,674 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1336 transitions. Word has length 22 [2020-02-10 20:19:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:30,674 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1336 transitions. [2020-02-10 20:19:30,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1336 transitions. [2020-02-10 20:19:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:30,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:30,674 INFO L415 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] [2020-02-10 20:19:30,675 INFO L427 AbstractCegarLoop]: === Iteration 1126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 764653776, now seen corresponding path program 1120 times [2020-02-10 20:19:30,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:30,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294759477] [2020-02-10 20:19:30,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294759477] [2020-02-10 20:19:30,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:30,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020187978] [2020-02-10 20:19:30,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:30,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:30,939 INFO L87 Difference]: Start difference. First operand 391 states and 1336 transitions. Second operand 9 states. [2020-02-10 20:19:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,036 INFO L93 Difference]: Finished difference Result 616 states and 1844 transitions. [2020-02-10 20:19:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:31,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,038 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:19:31,038 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:19:31,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:19:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-02-10 20:19:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 20:19:31,047 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 20:19:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,047 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 20:19:31,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 20:19:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:31,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,048 INFO L415 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] [2020-02-10 20:19:31,048 INFO L427 AbstractCegarLoop]: === Iteration 1127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1146381164, now seen corresponding path program 1121 times [2020-02-10 20:19:31,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626728588] [2020-02-10 20:19:31,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:31,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626728588] [2020-02-10 20:19:31,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:31,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:31,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653266451] [2020-02-10 20:19:31,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:31,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:31,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:31,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:31,322 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:19:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,421 INFO L93 Difference]: Finished difference Result 620 states and 1842 transitions. [2020-02-10 20:19:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:31,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,423 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:19:31,423 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:19:31,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:19:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 388. [2020-02-10 20:19:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 20:19:31,432 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 20:19:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,432 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 20:19:31,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 20:19:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:31,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,433 INFO L415 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] [2020-02-10 20:19:31,433 INFO L427 AbstractCegarLoop]: === Iteration 1128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1319628856, now seen corresponding path program 1122 times [2020-02-10 20:19:31,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478519509] [2020-02-10 20:19:31,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:31,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478519509] [2020-02-10 20:19:31,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:31,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:31,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525990021] [2020-02-10 20:19:31,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:31,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:31,694 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:19:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,793 INFO L93 Difference]: Finished difference Result 613 states and 1836 transitions. [2020-02-10 20:19:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:31,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,794 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:19:31,795 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:19:31,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:19:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 383. [2020-02-10 20:19:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:19:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:19:31,803 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:19:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,804 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:19:31,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:19:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:31,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,804 INFO L415 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] [2020-02-10 20:19:31,804 INFO L427 AbstractCegarLoop]: === Iteration 1129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash 754574172, now seen corresponding path program 1123 times [2020-02-10 20:19:31,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953690639] [2020-02-10 20:19:31,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:32,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953690639] [2020-02-10 20:19:32,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:32,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:32,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782021649] [2020-02-10 20:19:32,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:32,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:32,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:32,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:32,083 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:19:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:32,189 INFO L93 Difference]: Finished difference Result 614 states and 1831 transitions. [2020-02-10 20:19:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:32,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:32,191 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:19:32,191 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:19:32,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:19:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 387. [2020-02-10 20:19:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 20:19:32,201 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 20:19:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:32,201 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 20:19:32,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 20:19:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:32,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:32,202 INFO L415 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] [2020-02-10 20:19:32,202 INFO L427 AbstractCegarLoop]: === Iteration 1130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2096506960, now seen corresponding path program 1124 times [2020-02-10 20:19:32,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:32,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657013227] [2020-02-10 20:19:32,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:32,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657013227] [2020-02-10 20:19:32,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:32,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:32,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216928160] [2020-02-10 20:19:32,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:32,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:32,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:32,476 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:19:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:32,576 INFO L93 Difference]: Finished difference Result 613 states and 1827 transitions. [2020-02-10 20:19:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:32,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:32,577 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:19:32,578 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:19:32,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:19:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 385. [2020-02-10 20:19:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 20:19:32,586 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 20:19:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:32,587 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 20:19:32,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 20:19:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:32,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:32,587 INFO L415 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] [2020-02-10 20:19:32,587 INFO L427 AbstractCegarLoop]: === Iteration 1131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:32,588 INFO L82 PathProgramCache]: Analyzing trace with hash -321136984, now seen corresponding path program 1125 times [2020-02-10 20:19:32,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:32,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087499998] [2020-02-10 20:19:32,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:32,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087499998] [2020-02-10 20:19:32,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:32,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476350793] [2020-02-10 20:19:32,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:32,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:32,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:32,862 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:19:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:32,967 INFO L93 Difference]: Finished difference Result 614 states and 1831 transitions. [2020-02-10 20:19:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:32,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:32,969 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:19:32,969 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:19:32,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:19:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 388. [2020-02-10 20:19:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 20:19:32,978 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 20:19:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:32,978 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 20:19:32,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 20:19:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:32,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:32,979 INFO L415 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] [2020-02-10 20:19:32,979 INFO L427 AbstractCegarLoop]: === Iteration 1132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2145432152, now seen corresponding path program 1126 times [2020-02-10 20:19:32,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:32,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649970477] [2020-02-10 20:19:32,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:33,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649970477] [2020-02-10 20:19:33,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:33,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:33,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921581407] [2020-02-10 20:19:33,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:33,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:33,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:33,255 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:19:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:33,353 INFO L93 Difference]: Finished difference Result 606 states and 1822 transitions. [2020-02-10 20:19:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:33,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:33,355 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:19:33,355 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:19:33,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:19:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 385. [2020-02-10 20:19:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 20:19:33,365 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 20:19:33,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:33,365 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 20:19:33,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 20:19:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:33,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:33,365 INFO L415 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] [2020-02-10 20:19:33,365 INFO L427 AbstractCegarLoop]: === Iteration 1133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash -52289576, now seen corresponding path program 1127 times [2020-02-10 20:19:33,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382723557] [2020-02-10 20:19:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:33,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382723557] [2020-02-10 20:19:33,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:33,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:33,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851884194] [2020-02-10 20:19:33,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:33,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:33,637 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:19:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:33,742 INFO L93 Difference]: Finished difference Result 612 states and 1824 transitions. [2020-02-10 20:19:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:33,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:33,743 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:19:33,743 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:19:33,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:19:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 387. [2020-02-10 20:19:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1324 transitions. [2020-02-10 20:19:33,752 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1324 transitions. Word has length 22 [2020-02-10 20:19:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:33,752 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1324 transitions. [2020-02-10 20:19:33,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1324 transitions. [2020-02-10 20:19:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:33,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:33,752 INFO L415 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] [2020-02-10 20:19:33,753 INFO L427 AbstractCegarLoop]: === Iteration 1134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash -225537268, now seen corresponding path program 1128 times [2020-02-10 20:19:33,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:33,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031723640] [2020-02-10 20:19:33,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:34,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031723640] [2020-02-10 20:19:34,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:34,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:34,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59969430] [2020-02-10 20:19:34,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:34,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:34,022 INFO L87 Difference]: Start difference. First operand 387 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:19:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:34,120 INFO L93 Difference]: Finished difference Result 605 states and 1818 transitions. [2020-02-10 20:19:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:34,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:34,122 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:19:34,122 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:19:34,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:19:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 380. [2020-02-10 20:19:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 20:19:34,131 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 20:19:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:34,131 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 20:19:34,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 20:19:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:34,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:34,132 INFO L415 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] [2020-02-10 20:19:34,132 INFO L427 AbstractCegarLoop]: === Iteration 1135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1701011146, now seen corresponding path program 1129 times [2020-02-10 20:19:34,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:34,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249222871] [2020-02-10 20:19:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:34,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249222871] [2020-02-10 20:19:34,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:34,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:34,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107950638] [2020-02-10 20:19:34,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:34,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:34,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:34,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:34,406 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:19:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:34,479 INFO L93 Difference]: Finished difference Result 666 states and 1963 transitions. [2020-02-10 20:19:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:34,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:34,481 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:19:34,481 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:19:34,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:19:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 394. [2020-02-10 20:19:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:19:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1354 transitions. [2020-02-10 20:19:34,491 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1354 transitions. Word has length 22 [2020-02-10 20:19:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:34,491 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1354 transitions. [2020-02-10 20:19:34,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1354 transitions. [2020-02-10 20:19:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:34,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:34,492 INFO L415 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] [2020-02-10 20:19:34,492 INFO L427 AbstractCegarLoop]: === Iteration 1136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:34,492 INFO L82 PathProgramCache]: Analyzing trace with hash -110745260, now seen corresponding path program 1130 times [2020-02-10 20:19:34,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:34,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983859671] [2020-02-10 20:19:34,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:34,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983859671] [2020-02-10 20:19:34,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:34,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:34,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910457292] [2020-02-10 20:19:34,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:34,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:34,771 INFO L87 Difference]: Start difference. First operand 394 states and 1354 transitions. Second operand 9 states. [2020-02-10 20:19:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:34,868 INFO L93 Difference]: Finished difference Result 661 states and 1950 transitions. [2020-02-10 20:19:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:34,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:34,872 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:19:34,873 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:19:34,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:19:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 390. [2020-02-10 20:19:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-02-10 20:19:34,882 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-02-10 20:19:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:34,882 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-02-10 20:19:34,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-02-10 20:19:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:34,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:34,883 INFO L415 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] [2020-02-10 20:19:34,883 INFO L427 AbstractCegarLoop]: === Iteration 1137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1435960282, now seen corresponding path program 1131 times [2020-02-10 20:19:34,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:34,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693485369] [2020-02-10 20:19:34,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:35,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693485369] [2020-02-10 20:19:35,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:35,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:35,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870512258] [2020-02-10 20:19:35,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:35,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:35,170 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:19:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:35,239 INFO L93 Difference]: Finished difference Result 673 states and 1975 transitions. [2020-02-10 20:19:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:35,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:35,241 INFO L225 Difference]: With dead ends: 673 [2020-02-10 20:19:35,241 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:19:35,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:19:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 398. [2020-02-10 20:19:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:19:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1357 transitions. [2020-02-10 20:19:35,250 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1357 transitions. Word has length 22 [2020-02-10 20:19:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:35,251 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1357 transitions. [2020-02-10 20:19:35,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1357 transitions. [2020-02-10 20:19:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:35,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:35,251 INFO L415 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] [2020-02-10 20:19:35,251 INFO L427 AbstractCegarLoop]: === Iteration 1138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1361435464, now seen corresponding path program 1132 times [2020-02-10 20:19:35,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:35,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782911128] [2020-02-10 20:19:35,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:35,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782911128] [2020-02-10 20:19:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:35,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368758171] [2020-02-10 20:19:35,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:35,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:35,534 INFO L87 Difference]: Start difference. First operand 398 states and 1357 transitions. Second operand 9 states. [2020-02-10 20:19:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:35,642 INFO L93 Difference]: Finished difference Result 671 states and 1965 transitions. [2020-02-10 20:19:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:35,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:35,643 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:19:35,644 INFO L226 Difference]: Without dead ends: 649 [2020-02-10 20:19:35,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-02-10 20:19:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 390. [2020-02-10 20:19:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1339 transitions. [2020-02-10 20:19:35,653 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1339 transitions. Word has length 22 [2020-02-10 20:19:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:35,653 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1339 transitions. [2020-02-10 20:19:35,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1339 transitions. [2020-02-10 20:19:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:35,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:35,654 INFO L415 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] [2020-02-10 20:19:35,654 INFO L427 AbstractCegarLoop]: === Iteration 1139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1643710600, now seen corresponding path program 1133 times [2020-02-10 20:19:35,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:35,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300750168] [2020-02-10 20:19:35,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:35,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300750168] [2020-02-10 20:19:35,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:35,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:35,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310795307] [2020-02-10 20:19:35,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:35,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:35,924 INFO L87 Difference]: Start difference. First operand 390 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:19:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:36,023 INFO L93 Difference]: Finished difference Result 658 states and 1940 transitions. [2020-02-10 20:19:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:36,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:36,025 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:19:36,025 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 20:19:36,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 20:19:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 393. [2020-02-10 20:19:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:19:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1344 transitions. [2020-02-10 20:19:36,035 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1344 transitions. Word has length 22 [2020-02-10 20:19:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:36,035 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1344 transitions. [2020-02-10 20:19:36,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1344 transitions. [2020-02-10 20:19:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:36,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:36,036 INFO L415 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] [2020-02-10 20:19:36,036 INFO L427 AbstractCegarLoop]: === Iteration 1140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1662144626, now seen corresponding path program 1134 times [2020-02-10 20:19:36,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:36,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438037814] [2020-02-10 20:19:36,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:36,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438037814] [2020-02-10 20:19:36,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:36,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:36,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337176917] [2020-02-10 20:19:36,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:36,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:36,314 INFO L87 Difference]: Start difference. First operand 393 states and 1344 transitions. Second operand 9 states. [2020-02-10 20:19:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:36,410 INFO L93 Difference]: Finished difference Result 661 states and 1943 transitions. [2020-02-10 20:19:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:36,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:36,412 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:19:36,412 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:19:36,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:19:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 385. [2020-02-10 20:19:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 20:19:36,421 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 20:19:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:36,421 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 20:19:36,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 20:19:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:36,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:36,422 INFO L415 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] [2020-02-10 20:19:36,422 INFO L427 AbstractCegarLoop]: === Iteration 1141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2123496872, now seen corresponding path program 1135 times [2020-02-10 20:19:36,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:36,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674078534] [2020-02-10 20:19:36,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:36,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674078534] [2020-02-10 20:19:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:36,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:36,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360255538] [2020-02-10 20:19:36,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:36,698 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:19:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:36,776 INFO L93 Difference]: Finished difference Result 656 states and 1935 transitions. [2020-02-10 20:19:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:36,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:36,778 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:19:36,778 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 20:19:36,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 20:19:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 393. [2020-02-10 20:19:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:19:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1347 transitions. [2020-02-10 20:19:36,787 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1347 transitions. Word has length 22 [2020-02-10 20:19:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:36,787 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1347 transitions. [2020-02-10 20:19:36,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1347 transitions. [2020-02-10 20:19:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:36,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:36,788 INFO L415 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] [2020-02-10 20:19:36,788 INFO L427 AbstractCegarLoop]: === Iteration 1142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -533230986, now seen corresponding path program 1136 times [2020-02-10 20:19:36,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:36,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984882392] [2020-02-10 20:19:36,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:37,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984882392] [2020-02-10 20:19:37,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:37,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557047833] [2020-02-10 20:19:37,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:37,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:37,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:37,061 INFO L87 Difference]: Start difference. First operand 393 states and 1347 transitions. Second operand 9 states. [2020-02-10 20:19:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:37,163 INFO L93 Difference]: Finished difference Result 651 states and 1922 transitions. [2020-02-10 20:19:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:37,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:37,165 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:19:37,165 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 20:19:37,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 20:19:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 389. [2020-02-10 20:19:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1337 transitions. [2020-02-10 20:19:37,174 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1337 transitions. Word has length 22 [2020-02-10 20:19:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:37,174 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1337 transitions. [2020-02-10 20:19:37,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1337 transitions. [2020-02-10 20:19:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:37,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:37,175 INFO L415 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] [2020-02-10 20:19:37,175 INFO L427 AbstractCegarLoop]: === Iteration 1143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 822793672, now seen corresponding path program 1137 times [2020-02-10 20:19:37,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:37,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579349295] [2020-02-10 20:19:37,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:37,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579349295] [2020-02-10 20:19:37,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:37,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832802015] [2020-02-10 20:19:37,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:37,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:37,453 INFO L87 Difference]: Start difference. First operand 389 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:19:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:37,526 INFO L93 Difference]: Finished difference Result 650 states and 1922 transitions. [2020-02-10 20:19:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:37,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:37,528 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:19:37,528 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:19:37,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:19:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 394. [2020-02-10 20:19:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:19:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1345 transitions. [2020-02-10 20:19:37,538 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1345 transitions. Word has length 22 [2020-02-10 20:19:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:37,538 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1345 transitions. [2020-02-10 20:19:37,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1345 transitions. [2020-02-10 20:19:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:37,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:37,539 INFO L415 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] [2020-02-10 20:19:37,539 INFO L427 AbstractCegarLoop]: === Iteration 1144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash -878534230, now seen corresponding path program 1138 times [2020-02-10 20:19:37,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:37,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090072427] [2020-02-10 20:19:37,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:37,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090072427] [2020-02-10 20:19:37,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:37,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898689974] [2020-02-10 20:19:37,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:37,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:37,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:37,818 INFO L87 Difference]: Start difference. First operand 394 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:19:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:37,918 INFO L93 Difference]: Finished difference Result 637 states and 1902 transitions. [2020-02-10 20:19:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:37,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:37,920 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:19:37,920 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:19:37,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:19:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 389. [2020-02-10 20:19:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1333 transitions. [2020-02-10 20:19:37,930 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1333 transitions. Word has length 22 [2020-02-10 20:19:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:37,930 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1333 transitions. [2020-02-10 20:19:37,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1333 transitions. [2020-02-10 20:19:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:37,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:37,931 INFO L415 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] [2020-02-10 20:19:37,931 INFO L427 AbstractCegarLoop]: === Iteration 1145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash -392502742, now seen corresponding path program 1139 times [2020-02-10 20:19:37,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:37,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122288006] [2020-02-10 20:19:37,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:38,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122288006] [2020-02-10 20:19:38,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:38,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:38,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550718302] [2020-02-10 20:19:38,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:38,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:38,209 INFO L87 Difference]: Start difference. First operand 389 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:19:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:38,322 INFO L93 Difference]: Finished difference Result 643 states and 1904 transitions. [2020-02-10 20:19:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:38,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:38,324 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:19:38,324 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:19:38,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:19:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 392. [2020-02-10 20:19:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:19:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1338 transitions. [2020-02-10 20:19:38,332 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1338 transitions. Word has length 22 [2020-02-10 20:19:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:38,332 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1338 transitions. [2020-02-10 20:19:38,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1338 transitions. [2020-02-10 20:19:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:38,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:38,333 INFO L415 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] [2020-02-10 20:19:38,333 INFO L427 AbstractCegarLoop]: === Iteration 1146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash 481237938, now seen corresponding path program 1140 times [2020-02-10 20:19:38,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:38,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152288964] [2020-02-10 20:19:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:38,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152288964] [2020-02-10 20:19:38,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:38,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:38,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294627896] [2020-02-10 20:19:38,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:38,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:38,628 INFO L87 Difference]: Start difference. First operand 392 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:19:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:38,727 INFO L93 Difference]: Finished difference Result 635 states and 1895 transitions. [2020-02-10 20:19:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:38,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:38,729 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:19:38,729 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:19:38,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:19:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 385. [2020-02-10 20:19:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 20:19:38,738 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 20:19:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:38,738 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 20:19:38,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 20:19:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:38,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:38,739 INFO L415 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] [2020-02-10 20:19:38,739 INFO L427 AbstractCegarLoop]: === Iteration 1147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:38,739 INFO L82 PathProgramCache]: Analyzing trace with hash -295266634, now seen corresponding path program 1141 times [2020-02-10 20:19:38,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:38,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563808252] [2020-02-10 20:19:38,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:39,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563808252] [2020-02-10 20:19:39,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:39,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:39,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273467079] [2020-02-10 20:19:39,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:39,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:39,024 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:19:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:39,099 INFO L93 Difference]: Finished difference Result 669 states and 1962 transitions. [2020-02-10 20:19:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:39,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:39,101 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:19:39,101 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:19:39,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:19:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 399. [2020-02-10 20:19:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 20:19:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1356 transitions. [2020-02-10 20:19:39,111 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1356 transitions. Word has length 22 [2020-02-10 20:19:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,111 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1356 transitions. [2020-02-10 20:19:39,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1356 transitions. [2020-02-10 20:19:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:39,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,112 INFO L415 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] [2020-02-10 20:19:39,112 INFO L427 AbstractCegarLoop]: === Iteration 1148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1792838184, now seen corresponding path program 1142 times [2020-02-10 20:19:39,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088868263] [2020-02-10 20:19:39,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:39,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088868263] [2020-02-10 20:19:39,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:39,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:39,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846066455] [2020-02-10 20:19:39,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:39,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:39,394 INFO L87 Difference]: Start difference. First operand 399 states and 1356 transitions. Second operand 9 states. [2020-02-10 20:19:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:39,493 INFO L93 Difference]: Finished difference Result 667 states and 1952 transitions. [2020-02-10 20:19:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:39,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:39,495 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:19:39,495 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:19:39,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:19:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 391. [2020-02-10 20:19:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2020-02-10 20:19:39,505 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1337 transitions. Word has length 22 [2020-02-10 20:19:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,506 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1337 transitions. [2020-02-10 20:19:39,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1337 transitions. [2020-02-10 20:19:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:39,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,506 INFO L415 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] [2020-02-10 20:19:39,506 INFO L427 AbstractCegarLoop]: === Iteration 1149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash 449435864, now seen corresponding path program 1143 times [2020-02-10 20:19:39,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814848148] [2020-02-10 20:19:39,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:39,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814848148] [2020-02-10 20:19:39,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:39,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:39,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729700719] [2020-02-10 20:19:39,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:39,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:39,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:39,788 INFO L87 Difference]: Start difference. First operand 391 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:19:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:39,876 INFO L93 Difference]: Finished difference Result 656 states and 1931 transitions. [2020-02-10 20:19:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:39,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:39,878 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:19:39,878 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 20:19:39,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 20:19:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 396. [2020-02-10 20:19:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:19:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1345 transitions. [2020-02-10 20:19:39,888 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1345 transitions. Word has length 22 [2020-02-10 20:19:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,888 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1345 transitions. [2020-02-10 20:19:39,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1345 transitions. [2020-02-10 20:19:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:39,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,889 INFO L415 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] [2020-02-10 20:19:39,889 INFO L427 AbstractCegarLoop]: === Iteration 1150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1251892038, now seen corresponding path program 1144 times [2020-02-10 20:19:39,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630191407] [2020-02-10 20:19:39,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:40,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630191407] [2020-02-10 20:19:40,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:40,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:40,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577708857] [2020-02-10 20:19:40,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:40,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:40,182 INFO L87 Difference]: Start difference. First operand 396 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:19:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:40,295 INFO L93 Difference]: Finished difference Result 643 states and 1911 transitions. [2020-02-10 20:19:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:40,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:40,297 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:19:40,297 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:19:40,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:19:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 391. [2020-02-10 20:19:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1332 transitions. [2020-02-10 20:19:40,307 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1332 transitions. Word has length 22 [2020-02-10 20:19:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:40,307 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1332 transitions. [2020-02-10 20:19:40,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1332 transitions. [2020-02-10 20:19:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:40,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:40,308 INFO L415 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] [2020-02-10 20:19:40,308 INFO L427 AbstractCegarLoop]: === Iteration 1151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2129059412, now seen corresponding path program 1145 times [2020-02-10 20:19:40,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:40,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957130986] [2020-02-10 20:19:40,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:40,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957130986] [2020-02-10 20:19:40,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:40,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:40,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126102178] [2020-02-10 20:19:40,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:40,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:40,577 INFO L87 Difference]: Start difference. First operand 391 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:19:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:40,676 INFO L93 Difference]: Finished difference Result 653 states and 1921 transitions. [2020-02-10 20:19:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:40,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:40,678 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:19:40,678 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:19:40,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:19:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 395. [2020-02-10 20:19:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:19:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1339 transitions. [2020-02-10 20:19:40,688 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1339 transitions. Word has length 22 [2020-02-10 20:19:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:40,688 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1339 transitions. [2020-02-10 20:19:40,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1339 transitions. [2020-02-10 20:19:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:40,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:40,689 INFO L415 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] [2020-02-10 20:19:40,689 INFO L427 AbstractCegarLoop]: === Iteration 1152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1307033354, now seen corresponding path program 1146 times [2020-02-10 20:19:40,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:40,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61174290] [2020-02-10 20:19:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:40,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61174290] [2020-02-10 20:19:40,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:40,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:40,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002380680] [2020-02-10 20:19:40,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:40,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:40,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:40,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:40,960 INFO L87 Difference]: Start difference. First operand 395 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:19:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:41,075 INFO L93 Difference]: Finished difference Result 642 states and 1905 transitions. [2020-02-10 20:19:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:41,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:41,076 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:19:41,077 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:19:41,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:19:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 385. [2020-02-10 20:19:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 20:19:41,086 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 20:19:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:41,086 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 20:19:41,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 20:19:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:41,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:41,087 INFO L415 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] [2020-02-10 20:19:41,087 INFO L427 AbstractCegarLoop]: === Iteration 1153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1711318868, now seen corresponding path program 1147 times [2020-02-10 20:19:41,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:41,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315020927] [2020-02-10 20:19:41,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:41,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315020927] [2020-02-10 20:19:41,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:41,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:41,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251246532] [2020-02-10 20:19:41,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:41,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:41,355 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:19:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:41,453 INFO L93 Difference]: Finished difference Result 644 states and 1904 transitions. [2020-02-10 20:19:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:41,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:41,455 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:19:41,455 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:19:41,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:19:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 391. [2020-02-10 20:19:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1334 transitions. [2020-02-10 20:19:41,464 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1334 transitions. Word has length 22 [2020-02-10 20:19:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:41,465 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1334 transitions. [2020-02-10 20:19:41,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1334 transitions. [2020-02-10 20:19:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:41,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:41,465 INFO L415 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] [2020-02-10 20:19:41,465 INFO L427 AbstractCegarLoop]: === Iteration 1154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1729752894, now seen corresponding path program 1148 times [2020-02-10 20:19:41,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:41,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969042026] [2020-02-10 20:19:41,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:41,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969042026] [2020-02-10 20:19:41,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:41,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:41,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403536016] [2020-02-10 20:19:41,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:41,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:41,731 INFO L87 Difference]: Start difference. First operand 391 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:19:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:41,834 INFO L93 Difference]: Finished difference Result 647 states and 1907 transitions. [2020-02-10 20:19:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:41,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:41,836 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:19:41,836 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:19:41,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:19:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 388. [2020-02-10 20:19:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-02-10 20:19:41,846 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-02-10 20:19:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:41,846 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-02-10 20:19:41,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-02-10 20:19:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:41,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:41,847 INFO L415 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] [2020-02-10 20:19:41,847 INFO L427 AbstractCegarLoop]: === Iteration 1155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1838945930, now seen corresponding path program 1149 times [2020-02-10 20:19:41,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:41,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120160368] [2020-02-10 20:19:41,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:42,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120160368] [2020-02-10 20:19:42,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:42,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:42,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455262897] [2020-02-10 20:19:42,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:42,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:42,120 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:19:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,222 INFO L93 Difference]: Finished difference Result 639 states and 1892 transitions. [2020-02-10 20:19:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:42,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,224 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:19:42,224 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:19:42,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:19:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 391. [2020-02-10 20:19:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1331 transitions. [2020-02-10 20:19:42,232 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1331 transitions. Word has length 22 [2020-02-10 20:19:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,232 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1331 transitions. [2020-02-10 20:19:42,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1331 transitions. [2020-02-10 20:19:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:42,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,233 INFO L415 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] [2020-02-10 20:19:42,233 INFO L427 AbstractCegarLoop]: === Iteration 1156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash -965205250, now seen corresponding path program 1150 times [2020-02-10 20:19:42,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701969168] [2020-02-10 20:19:42,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:42,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701969168] [2020-02-10 20:19:42,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:42,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:42,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217885816] [2020-02-10 20:19:42,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:42,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:42,503 INFO L87 Difference]: Start difference. First operand 391 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:19:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,602 INFO L93 Difference]: Finished difference Result 631 states and 1883 transitions. [2020-02-10 20:19:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:42,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,604 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:19:42,604 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:19:42,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:19:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 388. [2020-02-10 20:19:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1323 transitions. [2020-02-10 20:19:42,613 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1323 transitions. Word has length 22 [2020-02-10 20:19:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,613 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1323 transitions. [2020-02-10 20:19:42,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1323 transitions. [2020-02-10 20:19:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:42,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,614 INFO L415 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] [2020-02-10 20:19:42,614 INFO L427 AbstractCegarLoop]: === Iteration 1157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1249057098, now seen corresponding path program 1151 times [2020-02-10 20:19:42,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121006227] [2020-02-10 20:19:42,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:42,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121006227] [2020-02-10 20:19:42,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:42,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:42,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584156550] [2020-02-10 20:19:42,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:42,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:42,885 INFO L87 Difference]: Start difference. First operand 388 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:19:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,982 INFO L93 Difference]: Finished difference Result 643 states and 1898 transitions. [2020-02-10 20:19:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:42,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,984 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:19:42,984 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:19:42,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:19:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 392. [2020-02-10 20:19:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:19:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1330 transitions. [2020-02-10 20:19:42,992 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1330 transitions. Word has length 22 [2020-02-10 20:19:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,992 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1330 transitions. [2020-02-10 20:19:42,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1330 transitions. [2020-02-10 20:19:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:42,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,993 INFO L415 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] [2020-02-10 20:19:42,993 INFO L427 AbstractCegarLoop]: === Iteration 1158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash -393750444, now seen corresponding path program 1152 times [2020-02-10 20:19:42,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774531703] [2020-02-10 20:19:42,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:43,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774531703] [2020-02-10 20:19:43,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:43,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:43,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522745397] [2020-02-10 20:19:43,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:43,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:43,259 INFO L87 Difference]: Start difference. First operand 392 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:19:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:43,363 INFO L93 Difference]: Finished difference Result 632 states and 1882 transitions. [2020-02-10 20:19:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:43,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:43,365 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:19:43,365 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:19:43,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:19:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 380. [2020-02-10 20:19:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-02-10 20:19:43,374 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-02-10 20:19:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:43,374 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-02-10 20:19:43,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-02-10 20:19:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:43,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:43,375 INFO L415 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] [2020-02-10 20:19:43,375 INFO L427 AbstractCegarLoop]: === Iteration 1159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash 884841890, now seen corresponding path program 1153 times [2020-02-10 20:19:43,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:43,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707566838] [2020-02-10 20:19:43,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:43,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707566838] [2020-02-10 20:19:43,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:43,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:43,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125556441] [2020-02-10 20:19:43,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:43,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:43,637 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:19:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:43,710 INFO L93 Difference]: Finished difference Result 653 states and 1918 transitions. [2020-02-10 20:19:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:43,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:43,711 INFO L225 Difference]: With dead ends: 653 [2020-02-10 20:19:43,712 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:19:43,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:19:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 20:19:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:19:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1339 transitions. [2020-02-10 20:19:43,722 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1339 transitions. Word has length 22 [2020-02-10 20:19:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:43,722 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1339 transitions. [2020-02-10 20:19:43,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1339 transitions. [2020-02-10 20:19:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:43,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:43,723 INFO L415 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] [2020-02-10 20:19:43,723 INFO L427 AbstractCegarLoop]: === Iteration 1160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1011478264, now seen corresponding path program 1154 times [2020-02-10 20:19:43,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:43,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235831535] [2020-02-10 20:19:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:43,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235831535] [2020-02-10 20:19:43,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:43,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:43,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872766741] [2020-02-10 20:19:43,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:43,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:43,970 INFO L87 Difference]: Start difference. First operand 391 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:19:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:44,070 INFO L93 Difference]: Finished difference Result 647 states and 1904 transitions. [2020-02-10 20:19:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:44,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:44,072 INFO L225 Difference]: With dead ends: 647 [2020-02-10 20:19:44,072 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:19:44,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:19:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 388. [2020-02-10 20:19:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-02-10 20:19:44,080 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-02-10 20:19:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:44,081 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-02-10 20:19:44,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-02-10 20:19:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:44,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:44,081 INFO L415 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] [2020-02-10 20:19:44,081 INFO L427 AbstractCegarLoop]: === Iteration 1161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1801810224, now seen corresponding path program 1155 times [2020-02-10 20:19:44,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:44,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823678449] [2020-02-10 20:19:44,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:44,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823678449] [2020-02-10 20:19:44,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:44,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:44,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693255060] [2020-02-10 20:19:44,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:44,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:44,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:44,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:44,348 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:19:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:44,422 INFO L93 Difference]: Finished difference Result 662 states and 1936 transitions. [2020-02-10 20:19:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:44,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:44,424 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:19:44,424 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:19:44,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:19:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 396. [2020-02-10 20:19:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:19:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1345 transitions. [2020-02-10 20:19:44,433 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1345 transitions. Word has length 22 [2020-02-10 20:19:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:44,434 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1345 transitions. [2020-02-10 20:19:44,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1345 transitions. [2020-02-10 20:19:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:44,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:44,440 INFO L415 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] [2020-02-10 20:19:44,440 INFO L427 AbstractCegarLoop]: === Iteration 1162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1843711480, now seen corresponding path program 1156 times [2020-02-10 20:19:44,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:44,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34613394] [2020-02-10 20:19:44,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:44,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34613394] [2020-02-10 20:19:44,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:44,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:44,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664933881] [2020-02-10 20:19:44,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:44,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:44,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:44,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:44,695 INFO L87 Difference]: Start difference. First operand 396 states and 1345 transitions. Second operand 9 states. [2020-02-10 20:19:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:44,798 INFO L93 Difference]: Finished difference Result 660 states and 1926 transitions. [2020-02-10 20:19:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:44,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:44,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:44,800 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:19:44,800 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:19:44,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:19:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 388. [2020-02-10 20:19:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 20:19:44,810 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 20:19:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:44,810 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 20:19:44,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 20:19:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:44,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:44,811 INFO L415 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] [2020-02-10 20:19:44,811 INFO L427 AbstractCegarLoop]: === Iteration 1163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 473622686, now seen corresponding path program 1157 times [2020-02-10 20:19:44,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:44,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181789881] [2020-02-10 20:19:44,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181789881] [2020-02-10 20:19:45,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:45,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554692272] [2020-02-10 20:19:45,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:45,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:45,056 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:19:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:45,157 INFO L93 Difference]: Finished difference Result 644 states and 1895 transitions. [2020-02-10 20:19:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:45,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:45,159 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:19:45,159 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:19:45,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:19:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 390. [2020-02-10 20:19:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1331 transitions. [2020-02-10 20:19:45,168 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1331 transitions. Word has length 22 [2020-02-10 20:19:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:45,168 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1331 transitions. [2020-02-10 20:19:45,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1331 transitions. [2020-02-10 20:19:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:45,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:45,169 INFO L415 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] [2020-02-10 20:19:45,169 INFO L427 AbstractCegarLoop]: === Iteration 1164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash -444327504, now seen corresponding path program 1158 times [2020-02-10 20:19:45,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:45,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384632882] [2020-02-10 20:19:45,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384632882] [2020-02-10 20:19:45,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:45,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555365986] [2020-02-10 20:19:45,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:45,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:45,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:45,419 INFO L87 Difference]: Start difference. First operand 390 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:19:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:45,523 INFO L93 Difference]: Finished difference Result 648 states and 1901 transitions. [2020-02-10 20:19:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:45,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:45,525 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:19:45,525 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:19:45,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:19:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 384. [2020-02-10 20:19:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 20:19:45,535 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 20:19:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:45,535 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 20:19:45,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 20:19:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:45,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:45,536 INFO L415 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] [2020-02-10 20:19:45,536 INFO L427 AbstractCegarLoop]: === Iteration 1165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:45,536 INFO L82 PathProgramCache]: Analyzing trace with hash -715595964, now seen corresponding path program 1159 times [2020-02-10 20:19:45,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:45,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914903155] [2020-02-10 20:19:45,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914903155] [2020-02-10 20:19:45,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:45,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779465473] [2020-02-10 20:19:45,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:45,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:45,785 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:19:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:45,862 INFO L93 Difference]: Finished difference Result 644 states and 1894 transitions. [2020-02-10 20:19:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:45,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:45,864 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:19:45,864 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 20:19:45,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 20:19:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 390. [2020-02-10 20:19:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-02-10 20:19:45,874 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-02-10 20:19:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:45,874 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-02-10 20:19:45,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-02-10 20:19:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:45,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:45,875 INFO L415 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] [2020-02-10 20:19:45,875 INFO L427 AbstractCegarLoop]: === Iteration 1166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash -588959590, now seen corresponding path program 1160 times [2020-02-10 20:19:45,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:45,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902703256] [2020-02-10 20:19:45,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:46,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902703256] [2020-02-10 20:19:46,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:46,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:46,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749847571] [2020-02-10 20:19:46,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:46,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:46,121 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:19:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,229 INFO L93 Difference]: Finished difference Result 638 states and 1880 transitions. [2020-02-10 20:19:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:46,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,231 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:19:46,231 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:19:46,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:19:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 387. [2020-02-10 20:19:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-02-10 20:19:46,240 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-02-10 20:19:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,241 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-02-10 20:19:46,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-02-10 20:19:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:46,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,241 INFO L415 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] [2020-02-10 20:19:46,241 INFO L427 AbstractCegarLoop]: === Iteration 1167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1791307120, now seen corresponding path program 1161 times [2020-02-10 20:19:46,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410829477] [2020-02-10 20:19:46,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:46,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410829477] [2020-02-10 20:19:46,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:46,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:46,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453620029] [2020-02-10 20:19:46,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:46,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:46,502 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:19:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,582 INFO L93 Difference]: Finished difference Result 640 states and 1887 transitions. [2020-02-10 20:19:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:46,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,583 INFO L225 Difference]: With dead ends: 640 [2020-02-10 20:19:46,583 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:19:46,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:19:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 392. [2020-02-10 20:19:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:19:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1334 transitions. [2020-02-10 20:19:46,592 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1334 transitions. Word has length 22 [2020-02-10 20:19:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,592 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1334 transitions. [2020-02-10 20:19:46,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1334 transitions. [2020-02-10 20:19:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:46,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,593 INFO L415 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] [2020-02-10 20:19:46,593 INFO L427 AbstractCegarLoop]: === Iteration 1168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1899806566, now seen corresponding path program 1162 times [2020-02-10 20:19:46,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116295249] [2020-02-10 20:19:46,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:46,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116295249] [2020-02-10 20:19:46,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:46,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:46,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824623046] [2020-02-10 20:19:46,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:46,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:46,840 INFO L87 Difference]: Start difference. First operand 392 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:19:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,970 INFO L93 Difference]: Finished difference Result 627 states and 1867 transitions. [2020-02-10 20:19:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:46,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,972 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:19:46,972 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:19:46,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:19:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-02-10 20:19:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1323 transitions. [2020-02-10 20:19:46,981 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1323 transitions. Word has length 22 [2020-02-10 20:19:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,982 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1323 transitions. [2020-02-10 20:19:46,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1323 transitions. [2020-02-10 20:19:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:46,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,982 INFO L415 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] [2020-02-10 20:19:46,982 INFO L427 AbstractCegarLoop]: === Iteration 1169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash 484125790, now seen corresponding path program 1163 times [2020-02-10 20:19:46,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620738640] [2020-02-10 20:19:46,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:47,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620738640] [2020-02-10 20:19:47,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:47,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:47,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152710024] [2020-02-10 20:19:47,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:47,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:47,231 INFO L87 Difference]: Start difference. First operand 387 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:19:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:47,332 INFO L93 Difference]: Finished difference Result 631 states and 1865 transitions. [2020-02-10 20:19:47,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:47,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:47,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:47,334 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:19:47,334 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:19:47,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:19:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 389. [2020-02-10 20:19:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1326 transitions. [2020-02-10 20:19:47,343 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1326 transitions. Word has length 22 [2020-02-10 20:19:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:47,343 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1326 transitions. [2020-02-10 20:19:47,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1326 transitions. [2020-02-10 20:19:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:47,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:47,343 INFO L415 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] [2020-02-10 20:19:47,344 INFO L427 AbstractCegarLoop]: === Iteration 1170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash 310878098, now seen corresponding path program 1164 times [2020-02-10 20:19:47,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:47,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265789309] [2020-02-10 20:19:47,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:47,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265789309] [2020-02-10 20:19:47,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:47,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:47,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713413774] [2020-02-10 20:19:47,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:47,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:47,597 INFO L87 Difference]: Start difference. First operand 389 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:19:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:47,729 INFO L93 Difference]: Finished difference Result 624 states and 1859 transitions. [2020-02-10 20:19:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:47,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:47,730 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:19:47,730 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:19:47,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:19:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 384. [2020-02-10 20:19:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-02-10 20:19:47,738 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-02-10 20:19:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:47,738 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-02-10 20:19:47,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-02-10 20:19:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:47,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:47,739 INFO L415 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] [2020-02-10 20:19:47,739 INFO L427 AbstractCegarLoop]: === Iteration 1171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash -789117692, now seen corresponding path program 1165 times [2020-02-10 20:19:47,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:47,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965017765] [2020-02-10 20:19:47,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965017765] [2020-02-10 20:19:48,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:48,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602132447] [2020-02-10 20:19:48,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:48,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:48,014 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:19:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:48,095 INFO L93 Difference]: Finished difference Result 662 states and 1936 transitions. [2020-02-10 20:19:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:48,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:48,097 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:19:48,097 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:19:48,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:19:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 398. [2020-02-10 20:19:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 20:19:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1349 transitions. [2020-02-10 20:19:48,106 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1349 transitions. Word has length 22 [2020-02-10 20:19:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:48,106 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1349 transitions. [2020-02-10 20:19:48,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1349 transitions. [2020-02-10 20:19:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:48,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:48,107 INFO L415 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] [2020-02-10 20:19:48,107 INFO L427 AbstractCegarLoop]: === Iteration 1172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1438563284, now seen corresponding path program 1166 times [2020-02-10 20:19:48,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:48,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489485495] [2020-02-10 20:19:48,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489485495] [2020-02-10 20:19:48,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:48,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356271712] [2020-02-10 20:19:48,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:48,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:48,378 INFO L87 Difference]: Start difference. First operand 398 states and 1349 transitions. Second operand 9 states. [2020-02-10 20:19:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:48,476 INFO L93 Difference]: Finished difference Result 660 states and 1926 transitions. [2020-02-10 20:19:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:48,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:48,478 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:19:48,478 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:19:48,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:19:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 390. [2020-02-10 20:19:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1330 transitions. [2020-02-10 20:19:48,488 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1330 transitions. Word has length 22 [2020-02-10 20:19:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:48,488 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1330 transitions. [2020-02-10 20:19:48,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1330 transitions. [2020-02-10 20:19:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:48,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:48,488 INFO L415 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] [2020-02-10 20:19:48,489 INFO L427 AbstractCegarLoop]: === Iteration 1173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash 821823266, now seen corresponding path program 1167 times [2020-02-10 20:19:48,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:48,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971257653] [2020-02-10 20:19:48,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971257653] [2020-02-10 20:19:48,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:48,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859030169] [2020-02-10 20:19:48,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:48,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:48,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:48,770 INFO L87 Difference]: Start difference. First operand 390 states and 1330 transitions. Second operand 9 states. [2020-02-10 20:19:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:48,852 INFO L93 Difference]: Finished difference Result 649 states and 1905 transitions. [2020-02-10 20:19:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:48,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:48,854 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:19:48,854 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:19:48,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:19:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 395. [2020-02-10 20:19:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:19:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1338 transitions. [2020-02-10 20:19:48,862 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1338 transitions. Word has length 22 [2020-02-10 20:19:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:48,863 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1338 transitions. [2020-02-10 20:19:48,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1338 transitions. [2020-02-10 20:19:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:48,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:48,863 INFO L415 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] [2020-02-10 20:19:48,864 INFO L427 AbstractCegarLoop]: === Iteration 1174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:48,864 INFO L82 PathProgramCache]: Analyzing trace with hash 713323820, now seen corresponding path program 1168 times [2020-02-10 20:19:48,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:48,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058304103] [2020-02-10 20:19:48,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:49,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058304103] [2020-02-10 20:19:49,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:49,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:49,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235116306] [2020-02-10 20:19:49,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:49,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:49,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:49,125 INFO L87 Difference]: Start difference. First operand 395 states and 1338 transitions. Second operand 9 states. [2020-02-10 20:19:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:49,228 INFO L93 Difference]: Finished difference Result 636 states and 1885 transitions. [2020-02-10 20:19:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:49,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:49,230 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:19:49,230 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:19:49,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:19:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 20:19:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1325 transitions. [2020-02-10 20:19:49,241 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1325 transitions. Word has length 22 [2020-02-10 20:19:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:49,241 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1325 transitions. [2020-02-10 20:19:49,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1325 transitions. [2020-02-10 20:19:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:49,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:49,242 INFO L415 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] [2020-02-10 20:19:49,242 INFO L427 AbstractCegarLoop]: === Iteration 1175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash 321408896, now seen corresponding path program 1169 times [2020-02-10 20:19:49,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:49,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494206373] [2020-02-10 20:19:49,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:49,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494206373] [2020-02-10 20:19:49,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:49,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:49,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48508105] [2020-02-10 20:19:49,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:49,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:49,505 INFO L87 Difference]: Start difference. First operand 390 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:19:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:49,633 INFO L93 Difference]: Finished difference Result 646 states and 1895 transitions. [2020-02-10 20:19:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:49,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:49,635 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:19:49,635 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:19:49,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:19:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 394. [2020-02-10 20:19:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:19:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1332 transitions. [2020-02-10 20:19:49,644 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1332 transitions. Word has length 22 [2020-02-10 20:19:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:49,644 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1332 transitions. [2020-02-10 20:19:49,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1332 transitions. [2020-02-10 20:19:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:49,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:49,645 INFO L415 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] [2020-02-10 20:19:49,645 INFO L427 AbstractCegarLoop]: === Iteration 1176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1180283426, now seen corresponding path program 1170 times [2020-02-10 20:19:49,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:49,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095897537] [2020-02-10 20:19:49,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:49,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095897537] [2020-02-10 20:19:49,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:49,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:49,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406051131] [2020-02-10 20:19:49,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:49,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:49,898 INFO L87 Difference]: Start difference. First operand 394 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:19:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:50,002 INFO L93 Difference]: Finished difference Result 635 states and 1879 transitions. [2020-02-10 20:19:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:50,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:50,004 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:19:50,004 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:19:50,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:19:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 384. [2020-02-10 20:19:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-02-10 20:19:50,013 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-02-10 20:19:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:50,013 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-02-10 20:19:50,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-02-10 20:19:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:50,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,014 INFO L415 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] [2020-02-10 20:19:50,014 INFO L427 AbstractCegarLoop]: === Iteration 1177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash -620468902, now seen corresponding path program 1171 times [2020-02-10 20:19:50,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301297099] [2020-02-10 20:19:50,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:50,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301297099] [2020-02-10 20:19:50,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:50,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:50,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734447359] [2020-02-10 20:19:50,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:50,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:50,251 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:19:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:50,362 INFO L93 Difference]: Finished difference Result 631 states and 1863 transitions. [2020-02-10 20:19:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:50,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:50,363 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:19:50,364 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:19:50,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:19:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-02-10 20:19:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2020-02-10 20:19:50,373 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 22 [2020-02-10 20:19:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:50,373 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2020-02-10 20:19:50,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2020-02-10 20:19:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:50,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,374 INFO L415 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] [2020-02-10 20:19:50,374 INFO L427 AbstractCegarLoop]: === Iteration 1178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1538419092, now seen corresponding path program 1172 times [2020-02-10 20:19:50,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560633028] [2020-02-10 20:19:50,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:50,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560633028] [2020-02-10 20:19:50,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:50,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:50,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238039841] [2020-02-10 20:19:50,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:50,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:50,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:50,605 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:19:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:50,712 INFO L93 Difference]: Finished difference Result 635 states and 1869 transitions. [2020-02-10 20:19:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:50,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:50,714 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:19:50,714 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:19:50,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:19:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 386. [2020-02-10 20:19:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-02-10 20:19:50,723 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-02-10 20:19:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:50,723 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-02-10 20:19:50,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-02-10 20:19:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:50,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,724 INFO L415 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] [2020-02-10 20:19:50,724 INFO L427 AbstractCegarLoop]: === Iteration 1179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 990472056, now seen corresponding path program 1173 times [2020-02-10 20:19:50,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822450032] [2020-02-10 20:19:50,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:50,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822450032] [2020-02-10 20:19:50,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:50,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:50,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923035118] [2020-02-10 20:19:50,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:50,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:50,965 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:19:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:51,088 INFO L93 Difference]: Finished difference Result 627 states and 1854 transitions. [2020-02-10 20:19:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:51,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:51,090 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:19:51,090 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:19:51,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:19:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 388. [2020-02-10 20:19:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1320 transitions. [2020-02-10 20:19:51,100 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1320 transitions. Word has length 22 [2020-02-10 20:19:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:51,100 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1320 transitions. [2020-02-10 20:19:51,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1320 transitions. [2020-02-10 20:19:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:51,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:51,101 INFO L415 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] [2020-02-10 20:19:51,101 INFO L427 AbstractCegarLoop]: === Iteration 1180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:51,101 INFO L82 PathProgramCache]: Analyzing trace with hash 817224364, now seen corresponding path program 1174 times [2020-02-10 20:19:51,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:51,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620847574] [2020-02-10 20:19:51,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:51,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620847574] [2020-02-10 20:19:51,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:51,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:51,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137055611] [2020-02-10 20:19:51,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:51,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:51,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:51,344 INFO L87 Difference]: Start difference. First operand 388 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:19:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:51,449 INFO L93 Difference]: Finished difference Result 620 states and 1848 transitions. [2020-02-10 20:19:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:51,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:51,451 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:19:51,451 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:19:51,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:19:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 386. [2020-02-10 20:19:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1315 transitions. [2020-02-10 20:19:51,460 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1315 transitions. Word has length 22 [2020-02-10 20:19:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:51,460 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1315 transitions. [2020-02-10 20:19:51,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1315 transitions. [2020-02-10 20:19:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:51,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:51,460 INFO L415 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] [2020-02-10 20:19:51,460 INFO L427 AbstractCegarLoop]: === Iteration 1181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1680837048, now seen corresponding path program 1175 times [2020-02-10 20:19:51,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:51,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409157311] [2020-02-10 20:19:51,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:51,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409157311] [2020-02-10 20:19:51,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:51,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:51,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080540066] [2020-02-10 20:19:51,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:51,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:51,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:51,692 INFO L87 Difference]: Start difference. First operand 386 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:19:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:51,823 INFO L93 Difference]: Finished difference Result 633 states and 1866 transitions. [2020-02-10 20:19:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:51,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:51,825 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:19:51,825 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:19:51,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:19:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 20:19:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:19:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1322 transitions. [2020-02-10 20:19:51,833 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1322 transitions. Word has length 22 [2020-02-10 20:19:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:51,833 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1322 transitions. [2020-02-10 20:19:51,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1322 transitions. [2020-02-10 20:19:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:51,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:51,834 INFO L415 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] [2020-02-10 20:19:51,834 INFO L427 AbstractCegarLoop]: === Iteration 1182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1869427750, now seen corresponding path program 1176 times [2020-02-10 20:19:51,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:51,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088491773] [2020-02-10 20:19:51,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:52,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088491773] [2020-02-10 20:19:52,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:52,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:52,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085633992] [2020-02-10 20:19:52,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:52,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:52,064 INFO L87 Difference]: Start difference. First operand 390 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:19:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:52,194 INFO L93 Difference]: Finished difference Result 622 states and 1850 transitions. [2020-02-10 20:19:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:52,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:52,196 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:19:52,196 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:19:52,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:19:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 380. [2020-02-10 20:19:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:19:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 20:19:52,215 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 20:19:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:52,215 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 20:19:52,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 20:19:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:52,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:52,216 INFO L415 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] [2020-02-10 20:19:52,216 INFO L427 AbstractCegarLoop]: === Iteration 1183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -752347456, now seen corresponding path program 1177 times [2020-02-10 20:19:52,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:52,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928904354] [2020-02-10 20:19:52,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:52,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928904354] [2020-02-10 20:19:52,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:52,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:52,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675628856] [2020-02-10 20:19:52,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:52,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:52,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:52,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:52,474 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:19:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:52,594 INFO L93 Difference]: Finished difference Result 610 states and 1819 transitions. [2020-02-10 20:19:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:52,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:52,595 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:19:52,596 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:19:52,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:19:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-02-10 20:19:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 20:19:52,605 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 20:19:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:52,605 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 20:19:52,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 20:19:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:52,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:52,606 INFO L415 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] [2020-02-10 20:19:52,606 INFO L427 AbstractCegarLoop]: === Iteration 1184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash 589585332, now seen corresponding path program 1178 times [2020-02-10 20:19:52,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:52,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023170413] [2020-02-10 20:19:52,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:52,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023170413] [2020-02-10 20:19:52,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:52,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:52,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190116182] [2020-02-10 20:19:52,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:52,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:52,866 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:19:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:52,979 INFO L93 Difference]: Finished difference Result 609 states and 1815 transitions. [2020-02-10 20:19:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:52,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:52,981 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:19:52,981 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:19:52,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:19:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 384. [2020-02-10 20:19:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:19:52,990 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:19:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:52,990 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:19:52,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:19:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:52,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:52,991 INFO L415 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] [2020-02-10 20:19:52,991 INFO L427 AbstractCegarLoop]: === Iteration 1185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash 855967726, now seen corresponding path program 1179 times [2020-02-10 20:19:52,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:52,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552705969] [2020-02-10 20:19:52,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:53,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552705969] [2020-02-10 20:19:53,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:53,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:53,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545704188] [2020-02-10 20:19:53,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:53,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:53,257 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:19:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:53,366 INFO L93 Difference]: Finished difference Result 615 states and 1828 transitions. [2020-02-10 20:19:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:53,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:53,367 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:19:53,368 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:19:53,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:19:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 387. [2020-02-10 20:19:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-02-10 20:19:53,377 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-02-10 20:19:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:53,377 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-02-10 20:19:53,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-02-10 20:19:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:53,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:53,377 INFO L415 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] [2020-02-10 20:19:53,378 INFO L427 AbstractCegarLoop]: === Iteration 1186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1722527710, now seen corresponding path program 1180 times [2020-02-10 20:19:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:53,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951896017] [2020-02-10 20:19:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:53,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951896017] [2020-02-10 20:19:53,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:53,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:53,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450606963] [2020-02-10 20:19:53,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:53,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:53,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:53,635 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:19:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:53,743 INFO L93 Difference]: Finished difference Result 618 states and 1831 transitions. [2020-02-10 20:19:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:53,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:53,745 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:19:53,745 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:19:53,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:19:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-02-10 20:19:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 20:19:53,754 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 20:19:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:53,754 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 20:19:53,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 20:19:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:53,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:53,754 INFO L415 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] [2020-02-10 20:19:53,755 INFO L427 AbstractCegarLoop]: === Iteration 1187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1124815134, now seen corresponding path program 1181 times [2020-02-10 20:19:53,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:53,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633869877] [2020-02-10 20:19:53,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:54,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633869877] [2020-02-10 20:19:54,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:54,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76649150] [2020-02-10 20:19:54,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:54,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:54,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:54,011 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:19:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:54,112 INFO L93 Difference]: Finished difference Result 612 states and 1819 transitions. [2020-02-10 20:19:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:54,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:54,113 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:19:54,114 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:19:54,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:19:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 20:19:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1318 transitions. [2020-02-10 20:19:54,122 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1318 transitions. Word has length 22 [2020-02-10 20:19:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:54,122 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1318 transitions. [2020-02-10 20:19:54,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1318 transitions. [2020-02-10 20:19:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:54,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:54,123 INFO L415 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] [2020-02-10 20:19:54,123 INFO L427 AbstractCegarLoop]: === Iteration 1188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:54,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash 206864944, now seen corresponding path program 1182 times [2020-02-10 20:19:54,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:54,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641117847] [2020-02-10 20:19:54,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:54,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641117847] [2020-02-10 20:19:54,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:54,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110993998] [2020-02-10 20:19:54,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:54,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:54,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:54,379 INFO L87 Difference]: Start difference. First operand 386 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:19:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:54,486 INFO L93 Difference]: Finished difference Result 616 states and 1825 transitions. [2020-02-10 20:19:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:54,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:54,488 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:19:54,488 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:19:54,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:19:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 382. [2020-02-10 20:19:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 20:19:54,498 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 20:19:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:54,498 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 20:19:54,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 20:19:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:54,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:54,498 INFO L415 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] [2020-02-10 20:19:54,499 INFO L427 AbstractCegarLoop]: === Iteration 1189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1942181986, now seen corresponding path program 1183 times [2020-02-10 20:19:54,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:54,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270975772] [2020-02-10 20:19:54,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:54,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270975772] [2020-02-10 20:19:54,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:54,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051725302] [2020-02-10 20:19:54,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:54,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:54,766 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:19:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:54,871 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-02-10 20:19:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:54,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:54,873 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:19:54,873 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:19:54,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:19:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 386. [2020-02-10 20:19:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 20:19:54,882 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 20:19:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:54,882 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 20:19:54,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 20:19:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:54,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:54,883 INFO L415 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] [2020-02-10 20:19:54,883 INFO L427 AbstractCegarLoop]: === Iteration 1190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852522, now seen corresponding path program 1184 times [2020-02-10 20:19:54,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:54,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672091006] [2020-02-10 20:19:54,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:55,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672091006] [2020-02-10 20:19:55,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:55,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:55,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430299930] [2020-02-10 20:19:55,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:55,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:55,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:55,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:55,147 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:19:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:55,260 INFO L93 Difference]: Finished difference Result 605 states and 1804 transitions. [2020-02-10 20:19:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:55,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:55,262 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:19:55,262 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:19:55,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:19:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 384. [2020-02-10 20:19:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 20:19:55,271 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 20:19:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:55,271 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 20:19:55,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 20:19:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:55,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:55,272 INFO L415 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] [2020-02-10 20:19:55,272 INFO L427 AbstractCegarLoop]: === Iteration 1191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 866470830, now seen corresponding path program 1185 times [2020-02-10 20:19:55,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:55,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416808287] [2020-02-10 20:19:55,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:55,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416808287] [2020-02-10 20:19:55,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:55,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:55,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020672448] [2020-02-10 20:19:55,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:55,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:55,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:55,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:55,534 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:19:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:55,645 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-02-10 20:19:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:55,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:55,647 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:19:55,647 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:19:55,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:19:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2020-02-10 20:19:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:19:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1320 transitions. [2020-02-10 20:19:55,656 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1320 transitions. Word has length 22 [2020-02-10 20:19:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:55,656 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1320 transitions. [2020-02-10 20:19:55,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1320 transitions. [2020-02-10 20:19:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:55,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:55,657 INFO L415 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] [2020-02-10 20:19:55,657 INFO L427 AbstractCegarLoop]: === Iteration 1192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash -961927330, now seen corresponding path program 1186 times [2020-02-10 20:19:55,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:55,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956464471] [2020-02-10 20:19:55,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:55,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956464471] [2020-02-10 20:19:55,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:55,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:55,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078775077] [2020-02-10 20:19:55,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:55,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:55,918 INFO L87 Difference]: Start difference. First operand 387 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:19:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,036 INFO L93 Difference]: Finished difference Result 598 states and 1799 transitions. [2020-02-10 20:19:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:56,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,038 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:19:56,038 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:19:56,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:19:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 20:19:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 20:19:56,048 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 20:19:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,048 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 20:19:56,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 20:19:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:56,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,048 INFO L415 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] [2020-02-10 20:19:56,048 INFO L427 AbstractCegarLoop]: === Iteration 1193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1135318238, now seen corresponding path program 1187 times [2020-02-10 20:19:56,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412613923] [2020-02-10 20:19:56,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:56,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412613923] [2020-02-10 20:19:56,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:56,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:56,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832315692] [2020-02-10 20:19:56,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:56,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:56,315 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:19:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,424 INFO L93 Difference]: Finished difference Result 604 states and 1801 transitions. [2020-02-10 20:19:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:56,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,426 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:19:56,426 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:19:56,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:19:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 386. [2020-02-10 20:19:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1316 transitions. [2020-02-10 20:19:56,435 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1316 transitions. Word has length 22 [2020-02-10 20:19:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,435 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1316 transitions. [2020-02-10 20:19:56,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1316 transitions. [2020-02-10 20:19:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:56,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,436 INFO L415 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] [2020-02-10 20:19:56,436 INFO L427 AbstractCegarLoop]: === Iteration 1194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,436 INFO L82 PathProgramCache]: Analyzing trace with hash 962070546, now seen corresponding path program 1188 times [2020-02-10 20:19:56,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227780859] [2020-02-10 20:19:56,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:56,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227780859] [2020-02-10 20:19:56,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:56,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:56,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951225260] [2020-02-10 20:19:56,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:56,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:56,694 INFO L87 Difference]: Start difference. First operand 386 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:19:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,796 INFO L93 Difference]: Finished difference Result 597 states and 1795 transitions. [2020-02-10 20:19:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:56,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,798 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:19:56,798 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:19:56,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:19:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 382. [2020-02-10 20:19:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 20:19:56,806 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 20:19:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,806 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 20:19:56,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 20:19:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:56,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,807 INFO L415 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] [2020-02-10 20:19:56,807 INFO L427 AbstractCegarLoop]: === Iteration 1195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1868660258, now seen corresponding path program 1189 times [2020-02-10 20:19:56,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618178418] [2020-02-10 20:19:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:57,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618178418] [2020-02-10 20:19:57,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:57,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:57,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509340437] [2020-02-10 20:19:57,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:57,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:57,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:57,058 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:19:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:57,162 INFO L93 Difference]: Finished difference Result 618 states and 1835 transitions. [2020-02-10 20:19:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:57,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:57,164 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:19:57,164 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:19:57,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:19:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 388. [2020-02-10 20:19:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-02-10 20:19:57,173 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-02-10 20:19:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:57,173 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-02-10 20:19:57,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-02-10 20:19:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:57,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:57,174 INFO L415 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] [2020-02-10 20:19:57,174 INFO L427 AbstractCegarLoop]: === Iteration 1196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:57,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1559747054, now seen corresponding path program 1190 times [2020-02-10 20:19:57,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:57,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317245209] [2020-02-10 20:19:57,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:57,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317245209] [2020-02-10 20:19:57,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:57,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:57,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750520676] [2020-02-10 20:19:57,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:57,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:57,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:57,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:57,438 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:19:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:57,543 INFO L93 Difference]: Finished difference Result 621 states and 1838 transitions. [2020-02-10 20:19:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:57,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:57,545 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:19:57,545 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:19:57,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:19:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 385. [2020-02-10 20:19:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1316 transitions. [2020-02-10 20:19:57,553 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1316 transitions. Word has length 22 [2020-02-10 20:19:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:57,553 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1316 transitions. [2020-02-10 20:19:57,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1316 transitions. [2020-02-10 20:19:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:57,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:57,554 INFO L415 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] [2020-02-10 20:19:57,554 INFO L427 AbstractCegarLoop]: === Iteration 1197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:57,554 INFO L82 PathProgramCache]: Analyzing trace with hash -815366080, now seen corresponding path program 1191 times [2020-02-10 20:19:57,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:57,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954935273] [2020-02-10 20:19:57,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:57,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954935273] [2020-02-10 20:19:57,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:57,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:57,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929971337] [2020-02-10 20:19:57,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:57,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:57,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:57,809 INFO L87 Difference]: Start difference. First operand 385 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:19:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:57,937 INFO L93 Difference]: Finished difference Result 613 states and 1823 transitions. [2020-02-10 20:19:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:57,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:57,939 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:19:57,939 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:19:57,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:19:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 388. [2020-02-10 20:19:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:19:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1321 transitions. [2020-02-10 20:19:57,948 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1321 transitions. Word has length 22 [2020-02-10 20:19:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:57,948 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1321 transitions. [2020-02-10 20:19:57,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1321 transitions. [2020-02-10 20:19:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:57,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:57,949 INFO L415 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] [2020-02-10 20:19:57,949 INFO L427 AbstractCegarLoop]: === Iteration 1198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1651203056, now seen corresponding path program 1192 times [2020-02-10 20:19:57,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:57,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858119865] [2020-02-10 20:19:57,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:58,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858119865] [2020-02-10 20:19:58,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:58,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:58,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794469327] [2020-02-10 20:19:58,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:58,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:58,200 INFO L87 Difference]: Start difference. First operand 388 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:19:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:58,305 INFO L93 Difference]: Finished difference Result 605 states and 1814 transitions. [2020-02-10 20:19:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:58,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:58,306 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:19:58,307 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:19:58,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:19:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 20:19:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:19:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1313 transitions. [2020-02-10 20:19:58,315 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1313 transitions. Word has length 22 [2020-02-10 20:19:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:58,315 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1313 transitions. [2020-02-10 20:19:58,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1313 transitions. [2020-02-10 20:19:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:58,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:58,316 INFO L415 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] [2020-02-10 20:19:58,316 INFO L427 AbstractCegarLoop]: === Iteration 1199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1889452130, now seen corresponding path program 1193 times [2020-02-10 20:19:58,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:58,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817612991] [2020-02-10 20:19:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:58,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817612991] [2020-02-10 20:19:58,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:58,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:58,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44538238] [2020-02-10 20:19:58,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:58,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:58,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:58,575 INFO L87 Difference]: Start difference. First operand 385 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:19:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:58,683 INFO L93 Difference]: Finished difference Result 617 states and 1829 transitions. [2020-02-10 20:19:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:58,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:58,685 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:19:58,685 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:19:58,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:19:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 389. [2020-02-10 20:19:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:19:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1320 transitions. [2020-02-10 20:19:58,696 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1320 transitions. Word has length 22 [2020-02-10 20:19:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:58,696 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1320 transitions. [2020-02-10 20:19:58,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1320 transitions. [2020-02-10 20:19:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:58,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:58,696 INFO L415 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] [2020-02-10 20:19:58,697 INFO L427 AbstractCegarLoop]: === Iteration 1200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1550208512, now seen corresponding path program 1194 times [2020-02-10 20:19:58,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:58,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27844593] [2020-02-10 20:19:58,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:58,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27844593] [2020-02-10 20:19:58,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:58,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:58,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540750247] [2020-02-10 20:19:58,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:58,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:58,950 INFO L87 Difference]: Start difference. First operand 389 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:19:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,079 INFO L93 Difference]: Finished difference Result 606 states and 1813 transitions. [2020-02-10 20:19:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:59,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,081 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:19:59,081 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:19:59,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:19:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 382. [2020-02-10 20:19:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:19:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 20:19:59,091 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 20:19:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:59,091 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 20:19:59,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 20:19:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:59,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:59,092 INFO L415 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] [2020-02-10 20:19:59,092 INFO L427 AbstractCegarLoop]: === Iteration 1201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1063368042, now seen corresponding path program 1195 times [2020-02-10 20:19:59,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:59,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928074500] [2020-02-10 20:19:59,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:59,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928074500] [2020-02-10 20:19:59,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:59,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:59,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68908158] [2020-02-10 20:19:59,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:59,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:59,331 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:19:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,431 INFO L93 Difference]: Finished difference Result 612 states and 1817 transitions. [2020-02-10 20:19:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:59,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,433 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:19:59,433 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:19:59,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:19:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 20:19:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:19:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1316 transitions. [2020-02-10 20:19:59,443 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1316 transitions. Word has length 22 [2020-02-10 20:19:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:59,443 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1316 transitions. [2020-02-10 20:19:59,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1316 transitions. [2020-02-10 20:19:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:59,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:59,444 INFO L415 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] [2020-02-10 20:19:59,444 INFO L427 AbstractCegarLoop]: === Iteration 1202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1981318232, now seen corresponding path program 1196 times [2020-02-10 20:19:59,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:59,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677377868] [2020-02-10 20:19:59,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:59,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677377868] [2020-02-10 20:19:59,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:59,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:19:59,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278126371] [2020-02-10 20:19:59,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:19:59,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:19:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:19:59,705 INFO L87 Difference]: Start difference. First operand 386 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:19:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,808 INFO L93 Difference]: Finished difference Result 616 states and 1823 transitions. [2020-02-10 20:19:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:19:59,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:19:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,810 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:19:59,810 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:19:59,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:19:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 384. [2020-02-10 20:19:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:19:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-02-10 20:19:59,822 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-02-10 20:19:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:59,822 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-02-10 20:19:59,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:19:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-02-10 20:19:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:19:59,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:59,823 INFO L415 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] [2020-02-10 20:19:59,823 INFO L427 AbstractCegarLoop]: === Iteration 1203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash 547572916, now seen corresponding path program 1197 times [2020-02-10 20:19:59,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:59,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454074339] [2020-02-10 20:19:59,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:00,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454074339] [2020-02-10 20:20:00,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:00,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:00,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942213289] [2020-02-10 20:20:00,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:00,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:00,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:00,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:00,057 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:20:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:00,158 INFO L93 Difference]: Finished difference Result 608 states and 1808 transitions. [2020-02-10 20:20:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:00,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:00,160 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:20:00,160 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:20:00,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:20:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-02-10 20:20:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1314 transitions. [2020-02-10 20:20:00,169 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1314 transitions. Word has length 22 [2020-02-10 20:20:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,169 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1314 transitions. [2020-02-10 20:20:00,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1314 transitions. [2020-02-10 20:20:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:00,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,170 INFO L415 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] [2020-02-10 20:20:00,170 INFO L427 AbstractCegarLoop]: === Iteration 1204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash 374325224, now seen corresponding path program 1198 times [2020-02-10 20:20:00,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187316816] [2020-02-10 20:20:00,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:00,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187316816] [2020-02-10 20:20:00,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:00,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:00,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279612592] [2020-02-10 20:20:00,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:00,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:00,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:00,401 INFO L87 Difference]: Start difference. First operand 386 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:20:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:00,504 INFO L93 Difference]: Finished difference Result 601 states and 1802 transitions. [2020-02-10 20:20:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:00,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:00,506 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:20:00,506 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:20:00,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:20:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 384. [2020-02-10 20:20:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1309 transitions. [2020-02-10 20:20:00,515 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,515 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1309 transitions. [2020-02-10 20:20:00,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1309 transitions. [2020-02-10 20:20:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:00,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,516 INFO L415 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] [2020-02-10 20:20:00,516 INFO L427 AbstractCegarLoop]: === Iteration 1205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1237937908, now seen corresponding path program 1199 times [2020-02-10 20:20:00,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50853428] [2020-02-10 20:20:00,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:00,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50853428] [2020-02-10 20:20:00,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:00,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:00,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454107113] [2020-02-10 20:20:00,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:00,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:00,758 INFO L87 Difference]: Start difference. First operand 384 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:00,860 INFO L93 Difference]: Finished difference Result 614 states and 1820 transitions. [2020-02-10 20:20:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:00,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:00,862 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:20:00,862 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:20:00,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:20:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 388. [2020-02-10 20:20:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:20:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1316 transitions. [2020-02-10 20:20:00,872 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,872 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1316 transitions. [2020-02-10 20:20:00,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1316 transitions. [2020-02-10 20:20:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:00,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,873 INFO L415 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] [2020-02-10 20:20:00,873 INFO L427 AbstractCegarLoop]: === Iteration 1206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1982640406, now seen corresponding path program 1200 times [2020-02-10 20:20:00,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514842850] [2020-02-10 20:20:00,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:01,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514842850] [2020-02-10 20:20:01,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:01,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:01,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599959777] [2020-02-10 20:20:01,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:01,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:01,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:01,110 INFO L87 Difference]: Start difference. First operand 388 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:01,215 INFO L93 Difference]: Finished difference Result 603 states and 1804 transitions. [2020-02-10 20:20:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:01,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:01,217 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:20:01,217 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:20:01,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:20:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 376. [2020-02-10 20:20:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:20:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1295 transitions. [2020-02-10 20:20:01,226 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1295 transitions. Word has length 22 [2020-02-10 20:20:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:01,226 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1295 transitions. [2020-02-10 20:20:01,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1295 transitions. [2020-02-10 20:20:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:01,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:01,227 INFO L415 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] [2020-02-10 20:20:01,227 INFO L427 AbstractCegarLoop]: === Iteration 1207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1290117892, now seen corresponding path program 1201 times [2020-02-10 20:20:01,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:01,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820281711] [2020-02-10 20:20:01,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20: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. [2020-02-10 20:20:01,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820281711] [2020-02-10 20:20:01,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:01,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055374593] [2020-02-10 20:20:01,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:01,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:01,489 INFO L87 Difference]: Start difference. First operand 376 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:20:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:01,565 INFO L93 Difference]: Finished difference Result 602 states and 1759 transitions. [2020-02-10 20:20:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:01,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:01,567 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:20:01,567 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:20:01,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:20:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 386. [2020-02-10 20:20:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 20:20:01,576 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 20:20:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:01,576 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 20:20:01,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 20:20:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:01,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:01,577 INFO L415 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] [2020-02-10 20:20:01,577 INFO L427 AbstractCegarLoop]: === Iteration 1208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1851186384, now seen corresponding path program 1202 times [2020-02-10 20:20:01,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:01,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930455816] [2020-02-10 20:20:01,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:01,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930455816] [2020-02-10 20:20:01,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:01,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:01,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602337296] [2020-02-10 20:20:01,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:01,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:01,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:01,837 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:20:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:01,925 INFO L93 Difference]: Finished difference Result 595 states and 1744 transitions. [2020-02-10 20:20:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:01,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:01,927 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:20:01,927 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:20:01,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:20:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 20:20:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1324 transitions. [2020-02-10 20:20:01,936 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:01,936 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1324 transitions. [2020-02-10 20:20:01,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1324 transitions. [2020-02-10 20:20:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:01,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:01,937 INFO L415 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] [2020-02-10 20:20:01,937 INFO L427 AbstractCegarLoop]: === Iteration 1209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -310319962, now seen corresponding path program 1203 times [2020-02-10 20:20:01,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:01,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117059384] [2020-02-10 20:20:01,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:02,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117059384] [2020-02-10 20:20:02,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:02,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908045503] [2020-02-10 20:20:02,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:02,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:02,197 INFO L87 Difference]: Start difference. First operand 384 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:02,274 INFO L93 Difference]: Finished difference Result 604 states and 1762 transitions. [2020-02-10 20:20:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:02,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:02,276 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:20:02,276 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:20:02,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:20:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 387. [2020-02-10 20:20:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 20:20:02,285 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 20:20:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:02,285 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 20:20:02,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 20:20:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:02,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:02,286 INFO L415 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] [2020-02-10 20:20:02,286 INFO L427 AbstractCegarLoop]: === Iteration 1210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:02,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1272523624, now seen corresponding path program 1204 times [2020-02-10 20:20:02,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:02,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327819907] [2020-02-10 20:20:02,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:02,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327819907] [2020-02-10 20:20:02,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:02,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221323776] [2020-02-10 20:20:02,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:02,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:02,542 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:20:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:02,659 INFO L93 Difference]: Finished difference Result 598 states and 1748 transitions. [2020-02-10 20:20:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:02,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:02,661 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:20:02,661 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:20:02,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:20:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-02-10 20:20:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-02-10 20:20:02,670 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-02-10 20:20:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:02,670 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-02-10 20:20:02,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-02-10 20:20:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:02,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:02,671 INFO L415 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] [2020-02-10 20:20:02,671 INFO L427 AbstractCegarLoop]: === Iteration 1211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash -255597736, now seen corresponding path program 1205 times [2020-02-10 20:20:02,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:02,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840716856] [2020-02-10 20:20:02,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:02,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840716856] [2020-02-10 20:20:02,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:02,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232823145] [2020-02-10 20:20:02,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:02,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:02,951 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:20:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,045 INFO L93 Difference]: Finished difference Result 588 states and 1729 transitions. [2020-02-10 20:20:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:03,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,046 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:20:03,046 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:20:03,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:20:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-02-10 20:20:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 20:20:03,056 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 20:20:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,056 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 20:20:03,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 20:20:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:03,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,057 INFO L415 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] [2020-02-10 20:20:03,057 INFO L427 AbstractCegarLoop]: === Iteration 1212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1355343222, now seen corresponding path program 1206 times [2020-02-10 20:20:03,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052204245] [2020-02-10 20:20:03,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:03,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052204245] [2020-02-10 20:20:03,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:03,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:03,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374575132] [2020-02-10 20:20:03,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:03,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:03,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:03,332 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:20:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,435 INFO L93 Difference]: Finished difference Result 589 states and 1730 transitions. [2020-02-10 20:20:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:03,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,437 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:20:03,437 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:20:03,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:20:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 382. [2020-02-10 20:20:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-02-10 20:20:03,446 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-02-10 20:20:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,446 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-02-10 20:20:03,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-02-10 20:20:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:03,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,447 INFO L415 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] [2020-02-10 20:20:03,447 INFO L427 AbstractCegarLoop]: === Iteration 1213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 692781234, now seen corresponding path program 1207 times [2020-02-10 20:20:03,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323290793] [2020-02-10 20:20:03,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:03,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323290793] [2020-02-10 20:20:03,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:03,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:03,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958315638] [2020-02-10 20:20:03,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:03,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:03,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:03,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:03,720 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:20:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,804 INFO L93 Difference]: Finished difference Result 612 states and 1780 transitions. [2020-02-10 20:20:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:03,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,806 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:20:03,806 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:20:03,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:20:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 387. [2020-02-10 20:20:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 20:20:03,815 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 20:20:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,815 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 20:20:03,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 20:20:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:03,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,816 INFO L415 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] [2020-02-10 20:20:03,816 INFO L427 AbstractCegarLoop]: === Iteration 1214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1253849726, now seen corresponding path program 1208 times [2020-02-10 20:20:03,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007583393] [2020-02-10 20:20:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:04,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007583393] [2020-02-10 20:20:04,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:04,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:04,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44679204] [2020-02-10 20:20:04,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:04,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:04,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:04,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:04,082 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:20:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:04,163 INFO L93 Difference]: Finished difference Result 605 states and 1765 transitions. [2020-02-10 20:20:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:04,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:04,165 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:20:04,165 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:20:04,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:20:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 385. [2020-02-10 20:20:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 20:20:04,175 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:04,175 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 20:20:04,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 20:20:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:04,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:04,176 INFO L415 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] [2020-02-10 20:20:04,176 INFO L427 AbstractCegarLoop]: === Iteration 1215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1705473766, now seen corresponding path program 1209 times [2020-02-10 20:20:04,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:04,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883960819] [2020-02-10 20:20:04,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:04,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883960819] [2020-02-10 20:20:04,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:04,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:04,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397828527] [2020-02-10 20:20:04,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:04,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:04,462 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:04,535 INFO L93 Difference]: Finished difference Result 623 states and 1804 transitions. [2020-02-10 20:20:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:04,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:04,537 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:20:04,537 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:20:04,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:20:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 393. [2020-02-10 20:20:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:20:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1337 transitions. [2020-02-10 20:20:04,547 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1337 transitions. Word has length 22 [2020-02-10 20:20:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:04,547 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1337 transitions. [2020-02-10 20:20:04,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1337 transitions. [2020-02-10 20:20:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:04,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:04,548 INFO L415 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] [2020-02-10 20:20:04,548 INFO L427 AbstractCegarLoop]: === Iteration 1216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1575503320, now seen corresponding path program 1210 times [2020-02-10 20:20:04,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:04,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371649208] [2020-02-10 20:20:04,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:04,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371649208] [2020-02-10 20:20:04,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:04,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:04,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404518371] [2020-02-10 20:20:04,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:04,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:04,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:04,822 INFO L87 Difference]: Start difference. First operand 393 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:20:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:04,922 INFO L93 Difference]: Finished difference Result 621 states and 1794 transitions. [2020-02-10 20:20:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:04,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:04,924 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:20:04,924 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:20:04,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:20:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 385. [2020-02-10 20:20:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 20:20:04,933 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 20:20:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:04,933 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 20:20:04,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 20:20:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:04,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:04,934 INFO L415 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] [2020-02-10 20:20:04,934 INFO L427 AbstractCegarLoop]: === Iteration 1217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1760195992, now seen corresponding path program 1211 times [2020-02-10 20:20:04,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:04,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405132989] [2020-02-10 20:20:04,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:05,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405132989] [2020-02-10 20:20:05,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:05,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:05,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515920869] [2020-02-10 20:20:05,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:05,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:05,210 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:20:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:05,284 INFO L93 Difference]: Finished difference Result 602 states and 1757 transitions. [2020-02-10 20:20:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:05,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:05,286 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:20:05,286 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:20:05,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:20:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 386. [2020-02-10 20:20:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 20:20:05,295 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 20:20:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:05,295 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 20:20:05,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 20:20:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:05,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:05,296 INFO L415 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] [2020-02-10 20:20:05,296 INFO L427 AbstractCegarLoop]: === Iteration 1218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash 684484836, now seen corresponding path program 1212 times [2020-02-10 20:20:05,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:05,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738410521] [2020-02-10 20:20:05,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:05,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738410521] [2020-02-10 20:20:05,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:05,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:05,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129624366] [2020-02-10 20:20:05,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:05,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:05,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:05,559 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:20:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:05,660 INFO L93 Difference]: Finished difference Result 607 states and 1766 transitions. [2020-02-10 20:20:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:05,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:05,662 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:20:05,662 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:20:05,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:20:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 382. [2020-02-10 20:20:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 20:20:05,671 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 20:20:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:05,671 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 20:20:05,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 20:20:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:05,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:05,672 INFO L415 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] [2020-02-10 20:20:05,672 INFO L427 AbstractCegarLoop]: === Iteration 1219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1018377458, now seen corresponding path program 1213 times [2020-02-10 20:20:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:05,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807532603] [2020-02-10 20:20:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:05,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807532603] [2020-02-10 20:20:05,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:05,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:05,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639990537] [2020-02-10 20:20:05,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:05,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:05,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:05,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:05,936 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:20:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:06,012 INFO L93 Difference]: Finished difference Result 618 states and 1794 transitions. [2020-02-10 20:20:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:06,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:06,014 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:20:06,014 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:20:06,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:20:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 389. [2020-02-10 20:20:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1331 transitions. [2020-02-10 20:20:06,023 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1331 transitions. Word has length 22 [2020-02-10 20:20:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:06,023 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1331 transitions. [2020-02-10 20:20:06,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1331 transitions. [2020-02-10 20:20:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:06,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:06,024 INFO L415 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] [2020-02-10 20:20:06,024 INFO L427 AbstractCegarLoop]: === Iteration 1220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 56173796, now seen corresponding path program 1214 times [2020-02-10 20:20:06,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:06,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522473544] [2020-02-10 20:20:06,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:06,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522473544] [2020-02-10 20:20:06,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:06,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:06,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609647912] [2020-02-10 20:20:06,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:06,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:06,288 INFO L87 Difference]: Start difference. First operand 389 states and 1331 transitions. Second operand 9 states. [2020-02-10 20:20:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:06,393 INFO L93 Difference]: Finished difference Result 612 states and 1780 transitions. [2020-02-10 20:20:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:06,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:06,395 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:20:06,395 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:20:06,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:20:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-02-10 20:20:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1324 transitions. [2020-02-10 20:20:06,404 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:06,404 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1324 transitions. [2020-02-10 20:20:06,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1324 transitions. [2020-02-10 20:20:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:06,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:06,404 INFO L415 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] [2020-02-10 20:20:06,404 INFO L427 AbstractCegarLoop]: === Iteration 1221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -663459452, now seen corresponding path program 1215 times [2020-02-10 20:20:06,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:06,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396155937] [2020-02-10 20:20:06,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:06,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396155937] [2020-02-10 20:20:06,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:06,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:06,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583844821] [2020-02-10 20:20:06,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:06,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:06,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:06,684 INFO L87 Difference]: Start difference. First operand 386 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:06,760 INFO L93 Difference]: Finished difference Result 627 states and 1812 transitions. [2020-02-10 20:20:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:06,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:06,762 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:20:06,762 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:20:06,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:20:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-02-10 20:20:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:20:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1337 transitions. [2020-02-10 20:20:06,771 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1337 transitions. Word has length 22 [2020-02-10 20:20:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:06,771 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1337 transitions. [2020-02-10 20:20:06,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1337 transitions. [2020-02-10 20:20:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:06,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:06,772 INFO L415 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] [2020-02-10 20:20:06,772 INFO L427 AbstractCegarLoop]: === Iteration 1222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:06,772 INFO L82 PathProgramCache]: Analyzing trace with hash -793429898, now seen corresponding path program 1216 times [2020-02-10 20:20:06,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:06,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492137740] [2020-02-10 20:20:06,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:07,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492137740] [2020-02-10 20:20:07,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:07,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:07,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304555384] [2020-02-10 20:20:07,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:07,044 INFO L87 Difference]: Start difference. First operand 394 states and 1337 transitions. Second operand 9 states. [2020-02-10 20:20:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:07,150 INFO L93 Difference]: Finished difference Result 625 states and 1802 transitions. [2020-02-10 20:20:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:07,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:07,152 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:20:07,152 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:20:07,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:20:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2020-02-10 20:20:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 20:20:07,161 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 20:20:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:07,161 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 20:20:07,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 20:20:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:07,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:07,162 INFO L415 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] [2020-02-10 20:20:07,162 INFO L427 AbstractCegarLoop]: === Iteration 1223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1557821440, now seen corresponding path program 1217 times [2020-02-10 20:20:07,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:07,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816856629] [2020-02-10 20:20:07,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:07,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816856629] [2020-02-10 20:20:07,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:07,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:07,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200319204] [2020-02-10 20:20:07,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:07,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:07,417 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:20:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:07,516 INFO L93 Difference]: Finished difference Result 609 states and 1771 transitions. [2020-02-10 20:20:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:07,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:07,518 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:20:07,518 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:20:07,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:20:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-02-10 20:20:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:20:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1323 transitions. [2020-02-10 20:20:07,527 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1323 transitions. Word has length 22 [2020-02-10 20:20:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:07,528 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1323 transitions. [2020-02-10 20:20:07,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1323 transitions. [2020-02-10 20:20:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:07,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:07,528 INFO L415 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] [2020-02-10 20:20:07,528 INFO L427 AbstractCegarLoop]: === Iteration 1224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1819195666, now seen corresponding path program 1218 times [2020-02-10 20:20:07,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:07,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242917648] [2020-02-10 20:20:07,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:07,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242917648] [2020-02-10 20:20:07,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:07,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:07,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682291750] [2020-02-10 20:20:07,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:07,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:07,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:07,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:07,789 INFO L87 Difference]: Start difference. First operand 388 states and 1323 transitions. Second operand 9 states. [2020-02-10 20:20:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:07,891 INFO L93 Difference]: Finished difference Result 613 states and 1777 transitions. [2020-02-10 20:20:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:07,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:07,893 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:20:07,893 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:20:07,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:20:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 382. [2020-02-10 20:20:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 20:20:07,902 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 20:20:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:07,902 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 20:20:07,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 20:20:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:07,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:07,903 INFO L415 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] [2020-02-10 20:20:07,903 INFO L427 AbstractCegarLoop]: === Iteration 1225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1738732674, now seen corresponding path program 1219 times [2020-02-10 20:20:07,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:07,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979181050] [2020-02-10 20:20:07,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:08,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979181050] [2020-02-10 20:20:08,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:08,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:08,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751313716] [2020-02-10 20:20:08,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:08,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:08,187 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:20:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:08,264 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2020-02-10 20:20:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:08,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:08,266 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:20:08,266 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:20:08,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:20:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 384. [2020-02-10 20:20:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-02-10 20:20:08,275 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:08,276 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-02-10 20:20:08,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-02-10 20:20:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:08,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:08,276 INFO L415 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] [2020-02-10 20:20:08,276 INFO L427 AbstractCegarLoop]: === Iteration 1226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash -127791716, now seen corresponding path program 1220 times [2020-02-10 20:20:08,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:08,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509991101] [2020-02-10 20:20:08,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:08,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509991101] [2020-02-10 20:20:08,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:08,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:08,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76430474] [2020-02-10 20:20:08,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:08,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:08,553 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:08,657 INFO L93 Difference]: Finished difference Result 584 states and 1716 transitions. [2020-02-10 20:20:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:08,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:08,659 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:20:08,660 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:20:08,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:20:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-02-10 20:20:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 20:20:08,668 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 20:20:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:08,668 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 20:20:08,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 20:20:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:08,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:08,669 INFO L415 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] [2020-02-10 20:20:08,669 INFO L427 AbstractCegarLoop]: === Iteration 1227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 874397712, now seen corresponding path program 1221 times [2020-02-10 20:20:08,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:08,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244996212] [2020-02-10 20:20:08,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:08,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244996212] [2020-02-10 20:20:08,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:08,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:08,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405380511] [2020-02-10 20:20:08,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:08,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:08,939 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:20:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:09,016 INFO L93 Difference]: Finished difference Result 587 states and 1722 transitions. [2020-02-10 20:20:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:09,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:09,018 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:20:09,018 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:20:09,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:20:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-02-10 20:20:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 20:20:09,027 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 20:20:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:09,027 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 20:20:09,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 20:20:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:09,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:09,028 INFO L415 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] [2020-02-10 20:20:09,028 INFO L427 AbstractCegarLoop]: === Iteration 1228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash -201313444, now seen corresponding path program 1222 times [2020-02-10 20:20:09,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:09,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438659941] [2020-02-10 20:20:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:09,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438659941] [2020-02-10 20:20:09,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:09,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:09,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618385778] [2020-02-10 20:20:09,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:09,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:09,288 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:20:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:09,396 INFO L93 Difference]: Finished difference Result 592 states and 1731 transitions. [2020-02-10 20:20:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:09,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:09,398 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:20:09,398 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:20:09,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:20:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 383. [2020-02-10 20:20:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 20:20:09,407 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 20:20:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:09,407 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 20:20:09,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 20:20:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:09,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:09,408 INFO L415 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] [2020-02-10 20:20:09,408 INFO L427 AbstractCegarLoop]: === Iteration 1229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash 884900816, now seen corresponding path program 1223 times [2020-02-10 20:20:09,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:09,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44394111] [2020-02-10 20:20:09,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:09,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44394111] [2020-02-10 20:20:09,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:09,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:09,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984875303] [2020-02-10 20:20:09,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:09,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:09,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:09,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:09,670 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:20:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:09,770 INFO L93 Difference]: Finished difference Result 590 states and 1728 transitions. [2020-02-10 20:20:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:09,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:09,772 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:20:09,772 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:20:09,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:20:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-02-10 20:20:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1316 transitions. [2020-02-10 20:20:09,781 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:09,781 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1316 transitions. [2020-02-10 20:20:09,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1316 transitions. [2020-02-10 20:20:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:09,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:09,781 INFO L415 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] [2020-02-10 20:20:09,781 INFO L427 AbstractCegarLoop]: === Iteration 1230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1801751298, now seen corresponding path program 1224 times [2020-02-10 20:20:09,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:09,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592587661] [2020-02-10 20:20:09,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592587661] [2020-02-10 20:20:10,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:10,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572446768] [2020-02-10 20:20:10,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:10,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:10,048 INFO L87 Difference]: Start difference. First operand 385 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:10,150 INFO L93 Difference]: Finished difference Result 594 states and 1734 transitions. [2020-02-10 20:20:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:10,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:10,152 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:20:10,152 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:20:10,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:20:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 20:20:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1306 transitions. [2020-02-10 20:20:10,161 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1306 transitions. Word has length 22 [2020-02-10 20:20:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:10,161 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1306 transitions. [2020-02-10 20:20:10,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1306 transitions. [2020-02-10 20:20:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:10,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:10,162 INFO L415 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] [2020-02-10 20:20:10,162 INFO L427 AbstractCegarLoop]: === Iteration 1231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash 867632166, now seen corresponding path program 1225 times [2020-02-10 20:20:10,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:10,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743314249] [2020-02-10 20:20:10,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743314249] [2020-02-10 20:20:10,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:10,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582480344] [2020-02-10 20:20:10,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:10,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:10,427 INFO L87 Difference]: Start difference. First operand 379 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:20:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:10,504 INFO L93 Difference]: Finished difference Result 592 states and 1732 transitions. [2020-02-10 20:20:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:10,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:10,506 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:20:10,506 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:20:10,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:20:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 385. [2020-02-10 20:20:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1322 transitions. [2020-02-10 20:20:10,515 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1322 transitions. Word has length 22 [2020-02-10 20:20:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:10,516 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1322 transitions. [2020-02-10 20:20:10,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1322 transitions. [2020-02-10 20:20:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:10,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:10,516 INFO L415 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] [2020-02-10 20:20:10,516 INFO L427 AbstractCegarLoop]: === Iteration 1232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1428700658, now seen corresponding path program 1226 times [2020-02-10 20:20:10,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:10,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525657090] [2020-02-10 20:20:10,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525657090] [2020-02-10 20:20:10,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:10,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316289000] [2020-02-10 20:20:10,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:10,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:10,784 INFO L87 Difference]: Start difference. First operand 385 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:20:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:10,862 INFO L93 Difference]: Finished difference Result 585 states and 1717 transitions. [2020-02-10 20:20:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:10,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:10,864 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:20:10,864 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:20:10,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:20:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-02-10 20:20:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 20:20:10,872 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 20:20:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:10,872 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 20:20:10,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 20:20:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:10,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:10,873 INFO L415 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] [2020-02-10 20:20:10,873 INFO L427 AbstractCegarLoop]: === Iteration 1233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash -732805688, now seen corresponding path program 1227 times [2020-02-10 20:20:10,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:10,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089068868] [2020-02-10 20:20:10,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:11,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089068868] [2020-02-10 20:20:11,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:11,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:11,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442658079] [2020-02-10 20:20:11,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:11,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:11,138 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:20:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:11,216 INFO L93 Difference]: Finished difference Result 594 states and 1735 transitions. [2020-02-10 20:20:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:11,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:11,218 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:20:11,218 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:20:11,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:20:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 386. [2020-02-10 20:20:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 20:20:11,227 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 20:20:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:11,227 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 20:20:11,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 20:20:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:11,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:11,228 INFO L415 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] [2020-02-10 20:20:11,228 INFO L427 AbstractCegarLoop]: === Iteration 1234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1695009350, now seen corresponding path program 1228 times [2020-02-10 20:20:11,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:11,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877691529] [2020-02-10 20:20:11,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:11,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877691529] [2020-02-10 20:20:11,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:11,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:11,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128732575] [2020-02-10 20:20:11,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:11,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:11,492 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:20:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:11,596 INFO L93 Difference]: Finished difference Result 588 states and 1721 transitions. [2020-02-10 20:20:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:11,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:11,597 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:20:11,598 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:20:11,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:20:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 383. [2020-02-10 20:20:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 20:20:11,606 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:11,606 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 20:20:11,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 20:20:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:11,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:11,607 INFO L415 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] [2020-02-10 20:20:11,607 INFO L427 AbstractCegarLoop]: === Iteration 1235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash -678083462, now seen corresponding path program 1229 times [2020-02-10 20:20:11,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:11,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085528358] [2020-02-10 20:20:11,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:11,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085528358] [2020-02-10 20:20:11,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:11,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:11,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701074641] [2020-02-10 20:20:11,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:11,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:11,885 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:11,965 INFO L93 Difference]: Finished difference Result 578 states and 1702 transitions. [2020-02-10 20:20:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:11,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:11,967 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:20:11,967 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:20:11,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:20:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2020-02-10 20:20:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:20:11,976 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:20:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:11,976 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:20:11,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:20:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:11,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:11,977 INFO L415 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] [2020-02-10 20:20:11,977 INFO L427 AbstractCegarLoop]: === Iteration 1236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:11,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 932857496, now seen corresponding path program 1230 times [2020-02-10 20:20:11,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:11,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211054459] [2020-02-10 20:20:11,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:12,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211054459] [2020-02-10 20:20:12,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284713886] [2020-02-10 20:20:12,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:12,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:12,254 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:20:12,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:12,363 INFO L93 Difference]: Finished difference Result 579 states and 1703 transitions. [2020-02-10 20:20:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:12,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:12,365 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:20:12,365 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:20:12,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:20:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 381. [2020-02-10 20:20:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 20:20:12,373 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 20:20:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:12,373 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 20:20:12,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 20:20:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:12,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:12,374 INFO L415 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] [2020-02-10 20:20:12,374 INFO L427 AbstractCegarLoop]: === Iteration 1237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2098637710, now seen corresponding path program 1231 times [2020-02-10 20:20:12,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:12,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156031232] [2020-02-10 20:20:12,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:12,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156031232] [2020-02-10 20:20:12,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:12,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:12,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606601003] [2020-02-10 20:20:12,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:12,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:12,654 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:20:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:12,747 INFO L93 Difference]: Finished difference Result 594 states and 1736 transitions. [2020-02-10 20:20:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:12,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:12,748 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:20:12,749 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:20:12,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:20:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-02-10 20:20:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1320 transitions. [2020-02-10 20:20:12,757 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1320 transitions. Word has length 22 [2020-02-10 20:20:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:12,757 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1320 transitions. [2020-02-10 20:20:12,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1320 transitions. [2020-02-10 20:20:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:12,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:12,758 INFO L415 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] [2020-02-10 20:20:12,758 INFO L427 AbstractCegarLoop]: === Iteration 1238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1537569218, now seen corresponding path program 1232 times [2020-02-10 20:20:12,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:12,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502437339] [2020-02-10 20:20:12,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:13,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502437339] [2020-02-10 20:20:13,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:13,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924181411] [2020-02-10 20:20:13,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:13,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:13,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:13,024 INFO L87 Difference]: Start difference. First operand 385 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:20:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:13,116 INFO L93 Difference]: Finished difference Result 587 states and 1721 transitions. [2020-02-10 20:20:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:13,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:13,118 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:20:13,118 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:20:13,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:20:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 20:20:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 20:20:13,127 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:13,127 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 20:20:13,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 20:20:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:13,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:13,127 INFO L415 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] [2020-02-10 20:20:13,127 INFO L427 AbstractCegarLoop]: === Iteration 1239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1608584264, now seen corresponding path program 1233 times [2020-02-10 20:20:13,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:13,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127682717] [2020-02-10 20:20:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:13,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127682717] [2020-02-10 20:20:13,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:13,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374885790] [2020-02-10 20:20:13,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:13,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:13,402 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:13,479 INFO L93 Difference]: Finished difference Result 592 states and 1735 transitions. [2020-02-10 20:20:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:13,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:13,480 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:20:13,480 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:20:13,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:20:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 388. [2020-02-10 20:20:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:20:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-02-10 20:20:13,489 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:13,489 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-02-10 20:20:13,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-02-10 20:20:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:13,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:13,490 INFO L415 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] [2020-02-10 20:20:13,490 INFO L427 AbstractCegarLoop]: === Iteration 1240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash -664466374, now seen corresponding path program 1234 times [2020-02-10 20:20:13,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:13,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63629153] [2020-02-10 20:20:13,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:13,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63629153] [2020-02-10 20:20:13,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:13,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538149028] [2020-02-10 20:20:13,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:13,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:13,767 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:13,866 INFO L93 Difference]: Finished difference Result 579 states and 1715 transitions. [2020-02-10 20:20:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:13,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:13,868 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:20:13,868 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:20:13,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:20:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-02-10 20:20:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 20:20:13,877 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 20:20:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:13,877 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 20:20:13,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 20:20:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:13,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:13,878 INFO L415 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] [2020-02-10 20:20:13,878 INFO L427 AbstractCegarLoop]: === Iteration 1241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:13,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1663306490, now seen corresponding path program 1235 times [2020-02-10 20:20:13,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:13,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625139223] [2020-02-10 20:20:13,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:14,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625139223] [2020-02-10 20:20:14,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:14,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:14,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813480326] [2020-02-10 20:20:14,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:14,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:14,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:14,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:14,154 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:20:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,229 INFO L93 Difference]: Finished difference Result 581 states and 1709 transitions. [2020-02-10 20:20:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:14,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,230 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:20:14,230 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:20:14,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:20:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 384. [2020-02-10 20:20:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 20:20:14,239 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 20:20:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:14,239 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 20:20:14,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 20:20:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:14,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:14,240 INFO L415 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] [2020-02-10 20:20:14,240 INFO L427 AbstractCegarLoop]: === Iteration 1242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2096431004, now seen corresponding path program 1236 times [2020-02-10 20:20:14,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:14,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023895143] [2020-02-10 20:20:14,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:14,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023895143] [2020-02-10 20:20:14,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:14,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:14,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916914151] [2020-02-10 20:20:14,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:14,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:14,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:14,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:14,517 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:20:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,618 INFO L93 Difference]: Finished difference Result 575 states and 1706 transitions. [2020-02-10 20:20:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:14,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,620 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:20:14,620 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:20:14,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:20:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 381. [2020-02-10 20:20:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 20:20:14,629 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 20:20:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:14,630 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 20:20:14,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 20:20:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:14,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:14,630 INFO L415 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] [2020-02-10 20:20:14,630 INFO L427 AbstractCegarLoop]: === Iteration 1243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1773041486, now seen corresponding path program 1237 times [2020-02-10 20:20:14,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:14,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662184437] [2020-02-10 20:20:14,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:14,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662184437] [2020-02-10 20:20:14,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:14,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:14,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970503304] [2020-02-10 20:20:14,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:14,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:14,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:14,892 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:20:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,966 INFO L93 Difference]: Finished difference Result 599 states and 1748 transitions. [2020-02-10 20:20:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:14,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,968 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:20:14,968 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:20:14,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:20:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 387. [2020-02-10 20:20:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1324 transitions. [2020-02-10 20:20:14,977 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:14,977 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1324 transitions. [2020-02-10 20:20:14,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1324 transitions. [2020-02-10 20:20:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:14,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:14,978 INFO L415 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] [2020-02-10 20:20:14,978 INFO L427 AbstractCegarLoop]: === Iteration 1244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1559722148, now seen corresponding path program 1238 times [2020-02-10 20:20:14,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:14,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961322904] [2020-02-10 20:20:14,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961322904] [2020-02-10 20:20:15,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:15,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:15,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113892246] [2020-02-10 20:20:15,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:15,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:15,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:15,246 INFO L87 Difference]: Start difference. First operand 387 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:15,357 INFO L93 Difference]: Finished difference Result 593 states and 1734 transitions. [2020-02-10 20:20:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:15,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:15,358 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:20:15,359 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:20:15,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:20:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 20:20:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 20:20:15,367 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 20:20:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:15,367 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 20:20:15,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 20:20:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:15,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:15,367 INFO L415 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] [2020-02-10 20:20:15,368 INFO L427 AbstractCegarLoop]: === Iteration 1245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash -760348954, now seen corresponding path program 1239 times [2020-02-10 20:20:15,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:15,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465608868] [2020-02-10 20:20:15,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:15,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465608868] [2020-02-10 20:20:15,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:15,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:15,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977443690] [2020-02-10 20:20:15,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:15,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:15,638 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:20:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:15,712 INFO L93 Difference]: Finished difference Result 595 states and 1741 transitions. [2020-02-10 20:20:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:15,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:15,713 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:20:15,713 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:20:15,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:20:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 389. [2020-02-10 20:20:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1325 transitions. [2020-02-10 20:20:15,723 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1325 transitions. Word has length 22 [2020-02-10 20:20:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:15,723 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1325 transitions. [2020-02-10 20:20:15,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1325 transitions. [2020-02-10 20:20:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:15,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:15,723 INFO L415 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] [2020-02-10 20:20:15,724 INFO L427 AbstractCegarLoop]: === Iteration 1246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1261567704, now seen corresponding path program 1240 times [2020-02-10 20:20:15,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:15,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800040389] [2020-02-10 20:20:15,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:16,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800040389] [2020-02-10 20:20:16,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:16,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:16,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351448770] [2020-02-10 20:20:16,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:16,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:16,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:16,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:16,001 INFO L87 Difference]: Start difference. First operand 389 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:20:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:16,101 INFO L93 Difference]: Finished difference Result 582 states and 1721 transitions. [2020-02-10 20:20:16,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:16,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:16,103 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:20:16,103 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:20:16,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:20:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 384. [2020-02-10 20:20:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 20:20:16,112 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 20:20:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:16,112 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 20:20:16,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 20:20:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:16,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:16,113 INFO L415 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] [2020-02-10 20:20:16,113 INFO L427 AbstractCegarLoop]: === Iteration 1247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash -43769984, now seen corresponding path program 1241 times [2020-02-10 20:20:16,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:16,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53269367] [2020-02-10 20:20:16,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:16,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53269367] [2020-02-10 20:20:16,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:16,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:16,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105271644] [2020-02-10 20:20:16,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:16,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:16,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:16,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:16,377 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:20:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:16,479 INFO L93 Difference]: Finished difference Result 586 states and 1719 transitions. [2020-02-10 20:20:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:16,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:16,481 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:20:16,481 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:20:16,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:20:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 386. [2020-02-10 20:20:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-02-10 20:20:16,490 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-02-10 20:20:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:16,491 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-02-10 20:20:16,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-02-10 20:20:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:16,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:16,491 INFO L415 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] [2020-02-10 20:20:16,491 INFO L427 AbstractCegarLoop]: === Iteration 1248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -217017676, now seen corresponding path program 1242 times [2020-02-10 20:20:16,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:16,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434920615] [2020-02-10 20:20:16,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:16,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434920615] [2020-02-10 20:20:16,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:16,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:16,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368833823] [2020-02-10 20:20:16,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:16,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:16,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:16,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:16,754 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:20:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:16,860 INFO L93 Difference]: Finished difference Result 579 states and 1713 transitions. [2020-02-10 20:20:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:16,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:16,862 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:20:16,862 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:20:16,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:20:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 20:20:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-02-10 20:20:16,871 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-02-10 20:20:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:16,871 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-02-10 20:20:16,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-02-10 20:20:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:16,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:16,872 INFO L415 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] [2020-02-10 20:20:16,872 INFO L427 AbstractCegarLoop]: === Iteration 1249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash -235184322, now seen corresponding path program 1243 times [2020-02-10 20:20:16,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:16,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061362188] [2020-02-10 20:20:16,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:17,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061362188] [2020-02-10 20:20:17,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:17,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:17,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021031414] [2020-02-10 20:20:17,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:17,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:17,172 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:20:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:17,255 INFO L93 Difference]: Finished difference Result 570 states and 1684 transitions. [2020-02-10 20:20:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:17,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:17,256 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:20:17,257 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:20:17,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:20:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 20:20:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1312 transitions. [2020-02-10 20:20:17,265 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1312 transitions. Word has length 22 [2020-02-10 20:20:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:17,265 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1312 transitions. [2020-02-10 20:20:17,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1312 transitions. [2020-02-10 20:20:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:17,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:17,266 INFO L415 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] [2020-02-10 20:20:17,266 INFO L427 AbstractCegarLoop]: === Iteration 1250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1375756636, now seen corresponding path program 1244 times [2020-02-10 20:20:17,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:17,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162658540] [2020-02-10 20:20:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162658540] [2020-02-10 20:20:17,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:17,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:17,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967333854] [2020-02-10 20:20:17,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:17,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:17,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:17,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:17,556 INFO L87 Difference]: Start difference. First operand 383 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:20:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:17,659 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-02-10 20:20:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:17,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:17,661 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:20:17,661 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:20:17,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:20:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:20:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 20:20:17,676 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 20:20:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:17,676 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 20:20:17,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 20:20:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:17,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:17,677 INFO L415 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] [2020-02-10 20:20:17,677 INFO L427 AbstractCegarLoop]: === Iteration 1251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash 777508210, now seen corresponding path program 1245 times [2020-02-10 20:20:17,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:17,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941941749] [2020-02-10 20:20:17,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:17,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941941749] [2020-02-10 20:20:17,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:17,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:17,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559159514] [2020-02-10 20:20:17,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:17,954 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:20:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,030 INFO L93 Difference]: Finished difference Result 571 states and 1686 transitions. [2020-02-10 20:20:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:18,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,032 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:20:18,032 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:20:18,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:20:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-02-10 20:20:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 20:20:18,041 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 20:20:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:18,042 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 20:20:18,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 20:20:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:18,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:18,042 INFO L415 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] [2020-02-10 20:20:18,042 INFO L427 AbstractCegarLoop]: === Iteration 1252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1312738012, now seen corresponding path program 1246 times [2020-02-10 20:20:18,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:18,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563432981] [2020-02-10 20:20:18,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:18,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563432981] [2020-02-10 20:20:18,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:18,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:18,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979373325] [2020-02-10 20:20:18,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:18,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:18,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:18,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:18,311 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:20:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,413 INFO L93 Difference]: Finished difference Result 565 states and 1683 transitions. [2020-02-10 20:20:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:18,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,415 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:20:18,415 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:20:18,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:20:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2020-02-10 20:20:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 20:20:18,424 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:18,424 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 20:20:18,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 20:20:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:18,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:18,425 INFO L415 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] [2020-02-10 20:20:18,425 INFO L427 AbstractCegarLoop]: === Iteration 1253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash 788011314, now seen corresponding path program 1247 times [2020-02-10 20:20:18,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:18,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868097753] [2020-02-10 20:20:18,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:18,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868097753] [2020-02-10 20:20:18,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:18,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:18,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543295271] [2020-02-10 20:20:18,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:18,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:18,699 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,798 INFO L93 Difference]: Finished difference Result 573 states and 1690 transitions. [2020-02-10 20:20:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:18,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:18,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,799 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:20:18,799 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:20:18,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:20:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 20:20:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-02-10 20:20:18,809 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-02-10 20:20:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:18,809 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-02-10 20:20:18,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-02-10 20:20:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:18,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:18,809 INFO L415 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] [2020-02-10 20:20:18,810 INFO L427 AbstractCegarLoop]: === Iteration 1254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -287699842, now seen corresponding path program 1248 times [2020-02-10 20:20:18,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:18,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163683542] [2020-02-10 20:20:18,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:19,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163683542] [2020-02-10 20:20:19,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:19,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:19,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323119523] [2020-02-10 20:20:19,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:19,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:19,081 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:20:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:19,190 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-02-10 20:20:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:19,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:19,192 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:20:19,192 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:20:19,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:20:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 379. [2020-02-10 20:20:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1304 transitions. [2020-02-10 20:20:19,201 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:19,201 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1304 transitions. [2020-02-10 20:20:19,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1304 transitions. [2020-02-10 20:20:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:19,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:19,202 INFO L415 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] [2020-02-10 20:20:19,202 INFO L427 AbstractCegarLoop]: === Iteration 1255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1067271706, now seen corresponding path program 1249 times [2020-02-10 20:20:19,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:19,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839398020] [2020-02-10 20:20:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:19,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839398020] [2020-02-10 20:20:19,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:19,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:19,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236854674] [2020-02-10 20:20:19,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:19,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:19,469 INFO L87 Difference]: Start difference. First operand 379 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:19,549 INFO L93 Difference]: Finished difference Result 617 states and 1793 transitions. [2020-02-10 20:20:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:19,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:19,551 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:20:19,551 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:20:19,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:20:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 387. [2020-02-10 20:20:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-02-10 20:20:19,560 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-02-10 20:20:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:19,561 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-02-10 20:20:19,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-02-10 20:20:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:19,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:19,561 INFO L415 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] [2020-02-10 20:20:19,561 INFO L427 AbstractCegarLoop]: === Iteration 1256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash -506203214, now seen corresponding path program 1250 times [2020-02-10 20:20:19,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:19,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644147606] [2020-02-10 20:20:19,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:19,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644147606] [2020-02-10 20:20:19,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:19,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:19,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748934067] [2020-02-10 20:20:19,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:19,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:19,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:19,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:19,824 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:20:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:19,914 INFO L93 Difference]: Finished difference Result 610 states and 1778 transitions. [2020-02-10 20:20:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:19,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:19,916 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:20:19,916 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:20:19,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:20:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 385. [2020-02-10 20:20:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 20:20:19,925 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 20:20:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:19,925 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 20:20:19,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 20:20:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:19,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:19,925 INFO L415 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] [2020-02-10 20:20:19,925 INFO L427 AbstractCegarLoop]: === Iteration 1257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -54579174, now seen corresponding path program 1251 times [2020-02-10 20:20:19,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:19,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748990588] [2020-02-10 20:20:19,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:20,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748990588] [2020-02-10 20:20:20,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:20,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:20,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710115227] [2020-02-10 20:20:20,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:20,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:20,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:20,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:20,208 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 20:20:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:20,308 INFO L93 Difference]: Finished difference Result 628 states and 1817 transitions. [2020-02-10 20:20:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:20,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:20,309 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:20:20,309 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:20:20,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:20:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 20:20:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:20:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1334 transitions. [2020-02-10 20:20:20,318 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1334 transitions. Word has length 22 [2020-02-10 20:20:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:20,319 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1334 transitions. [2020-02-10 20:20:20,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1334 transitions. [2020-02-10 20:20:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:20,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:20,319 INFO L415 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] [2020-02-10 20:20:20,319 INFO L427 AbstractCegarLoop]: === Iteration 1258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash -184549620, now seen corresponding path program 1252 times [2020-02-10 20:20:20,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:20,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887229644] [2020-02-10 20:20:20,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:20,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887229644] [2020-02-10 20:20:20,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:20,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:20,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100735058] [2020-02-10 20:20:20,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:20,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:20,590 INFO L87 Difference]: Start difference. First operand 393 states and 1334 transitions. Second operand 9 states. [2020-02-10 20:20:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:20,705 INFO L93 Difference]: Finished difference Result 626 states and 1807 transitions. [2020-02-10 20:20:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:20,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:20,707 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:20:20,707 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:20:20,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:20:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 385. [2020-02-10 20:20:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 20:20:20,716 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 20:20:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:20,716 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 20:20:20,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 20:20:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:20,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:20,717 INFO L415 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] [2020-02-10 20:20:20,717 INFO L427 AbstractCegarLoop]: === Iteration 1259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash 143052, now seen corresponding path program 1253 times [2020-02-10 20:20:20,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:20,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768385532] [2020-02-10 20:20:20,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:20,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768385532] [2020-02-10 20:20:20,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:20,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:20,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785463906] [2020-02-10 20:20:20,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:20,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:20,984 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 20:20:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:21,089 INFO L93 Difference]: Finished difference Result 607 states and 1770 transitions. [2020-02-10 20:20:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:21,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:21,091 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:20:21,091 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:20:21,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:20:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-02-10 20:20:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1319 transitions. [2020-02-10 20:20:21,100 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1319 transitions. Word has length 22 [2020-02-10 20:20:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:21,100 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1319 transitions. [2020-02-10 20:20:21,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1319 transitions. [2020-02-10 20:20:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:21,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:21,101 INFO L415 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] [2020-02-10 20:20:21,101 INFO L427 AbstractCegarLoop]: === Iteration 1260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1075568104, now seen corresponding path program 1254 times [2020-02-10 20:20:21,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:21,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70190696] [2020-02-10 20:20:21,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:21,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70190696] [2020-02-10 20:20:21,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:21,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:21,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362922401] [2020-02-10 20:20:21,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:21,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:21,356 INFO L87 Difference]: Start difference. First operand 386 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:20:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:21,485 INFO L93 Difference]: Finished difference Result 612 states and 1779 transitions. [2020-02-10 20:20:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:21,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:21,487 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:20:21,487 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:20:21,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:20:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 382. [2020-02-10 20:20:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 20:20:21,497 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 20:20:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:21,497 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 20:20:21,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 20:20:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:21,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:21,498 INFO L415 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] [2020-02-10 20:20:21,498 INFO L427 AbstractCegarLoop]: === Iteration 1261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 858762372, now seen corresponding path program 1255 times [2020-02-10 20:20:21,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:21,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440289306] [2020-02-10 20:20:21,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:21,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440289306] [2020-02-10 20:20:21,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:21,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:21,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632526290] [2020-02-10 20:20:21,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:21,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:21,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:21,862 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:20:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:21,946 INFO L93 Difference]: Finished difference Result 609 states and 1773 transitions. [2020-02-10 20:20:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:21,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:21,948 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:20:21,948 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:20:21,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:20:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 386. [2020-02-10 20:20:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 20:20:21,957 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 20:20:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:21,958 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 20:20:21,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 20:20:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:21,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:21,958 INFO L415 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] [2020-02-10 20:20:21,958 INFO L427 AbstractCegarLoop]: === Iteration 1262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1419830864, now seen corresponding path program 1256 times [2020-02-10 20:20:21,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:21,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074843776] [2020-02-10 20:20:21,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:22,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074843776] [2020-02-10 20:20:22,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:22,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:22,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444873059] [2020-02-10 20:20:22,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:22,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:22,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:22,216 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:20:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:22,303 INFO L93 Difference]: Finished difference Result 602 states and 1758 transitions. [2020-02-10 20:20:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:22,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:22,305 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:20:22,305 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:20:22,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:20:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-02-10 20:20:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-02-10 20:20:22,314 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:22,314 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-02-10 20:20:22,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-02-10 20:20:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:22,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:22,315 INFO L415 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] [2020-02-10 20:20:22,315 INFO L427 AbstractCegarLoop]: === Iteration 1263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 271017050, now seen corresponding path program 1257 times [2020-02-10 20:20:22,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:22,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400763731] [2020-02-10 20:20:22,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:22,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400763731] [2020-02-10 20:20:22,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:22,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:22,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196897682] [2020-02-10 20:20:22,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:22,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:22,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:22,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:22,591 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:22,695 INFO L93 Difference]: Finished difference Result 607 states and 1772 transitions. [2020-02-10 20:20:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:22,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:22,697 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:20:22,697 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:20:22,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:20:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 389. [2020-02-10 20:20:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1324 transitions. [2020-02-10 20:20:22,706 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:22,706 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1324 transitions. [2020-02-10 20:20:22,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1324 transitions. [2020-02-10 20:20:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:22,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:22,707 INFO L415 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] [2020-02-10 20:20:22,707 INFO L427 AbstractCegarLoop]: === Iteration 1264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2002033588, now seen corresponding path program 1258 times [2020-02-10 20:20:22,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:22,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144255261] [2020-02-10 20:20:22,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:22,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144255261] [2020-02-10 20:20:22,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:22,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:22,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107889244] [2020-02-10 20:20:22,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:22,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:22,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:22,972 INFO L87 Difference]: Start difference. First operand 389 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:23,080 INFO L93 Difference]: Finished difference Result 594 states and 1752 transitions. [2020-02-10 20:20:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:23,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:23,082 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:20:23,082 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:20:23,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:20:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 20:20:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 20:20:23,091 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 20:20:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:23,091 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 20:20:23,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 20:20:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:23,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:23,092 INFO L415 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] [2020-02-10 20:20:23,092 INFO L427 AbstractCegarLoop]: === Iteration 1265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 325739276, now seen corresponding path program 1259 times [2020-02-10 20:20:23,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:23,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697238833] [2020-02-10 20:20:23,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:23,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697238833] [2020-02-10 20:20:23,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:23,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:23,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060775080] [2020-02-10 20:20:23,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:23,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:23,363 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:20:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:23,467 INFO L93 Difference]: Finished difference Result 596 states and 1746 transitions. [2020-02-10 20:20:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:23,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:23,469 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:20:23,469 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:20:23,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:20:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 385. [2020-02-10 20:20:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1315 transitions. [2020-02-10 20:20:23,478 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1315 transitions. Word has length 22 [2020-02-10 20:20:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:23,478 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1315 transitions. [2020-02-10 20:20:23,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1315 transitions. [2020-02-10 20:20:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:23,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:23,479 INFO L415 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] [2020-02-10 20:20:23,479 INFO L427 AbstractCegarLoop]: === Iteration 1266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash 860969078, now seen corresponding path program 1260 times [2020-02-10 20:20:23,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:23,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181618157] [2020-02-10 20:20:23,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:23,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181618157] [2020-02-10 20:20:23,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:23,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:23,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936085323] [2020-02-10 20:20:23,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:23,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:23,742 INFO L87 Difference]: Start difference. First operand 385 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:20:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:23,866 INFO L93 Difference]: Finished difference Result 590 states and 1743 transitions. [2020-02-10 20:20:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:23,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:23,867 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:20:23,868 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:20:23,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:20:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 20:20:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 20:20:23,876 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 20:20:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:23,876 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 20:20:23,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 20:20:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:23,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:23,877 INFO L415 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] [2020-02-10 20:20:23,877 INFO L427 AbstractCegarLoop]: === Iteration 1267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1094814972, now seen corresponding path program 1261 times [2020-02-10 20:20:23,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:23,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174142163] [2020-02-10 20:20:23,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:24,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174142163] [2020-02-10 20:20:24,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:24,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:24,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994076681] [2020-02-10 20:20:24,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:24,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:24,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:24,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:24,157 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:20:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:24,240 INFO L93 Difference]: Finished difference Result 632 states and 1830 transitions. [2020-02-10 20:20:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:24,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:24,242 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:20:24,242 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:20:24,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:20:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 396. [2020-02-10 20:20:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 20:20:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1343 transitions. [2020-02-10 20:20:24,251 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1343 transitions. Word has length 22 [2020-02-10 20:20:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:24,252 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1343 transitions. [2020-02-10 20:20:24,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1343 transitions. [2020-02-10 20:20:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:24,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:24,257 INFO L415 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] [2020-02-10 20:20:24,257 INFO L427 AbstractCegarLoop]: === Iteration 1268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:24,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1224785418, now seen corresponding path program 1262 times [2020-02-10 20:20:24,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:24,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392422513] [2020-02-10 20:20:24,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:24,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392422513] [2020-02-10 20:20:24,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:24,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:24,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493582517] [2020-02-10 20:20:24,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:24,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:24,530 INFO L87 Difference]: Start difference. First operand 396 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:20:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:24,657 INFO L93 Difference]: Finished difference Result 630 states and 1820 transitions. [2020-02-10 20:20:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:24,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:24,659 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:20:24,659 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:20:24,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:20:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 388. [2020-02-10 20:20:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:20:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-02-10 20:20:24,668 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:24,668 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-02-10 20:20:24,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-02-10 20:20:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:24,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:24,669 INFO L415 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] [2020-02-10 20:20:24,669 INFO L427 AbstractCegarLoop]: === Iteration 1269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:24,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1599714470, now seen corresponding path program 1263 times [2020-02-10 20:20:24,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:24,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776111455] [2020-02-10 20:20:24,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:24,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776111455] [2020-02-10 20:20:24,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:24,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:24,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665616535] [2020-02-10 20:20:24,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:24,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:24,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:24,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:24,939 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:25,020 INFO L93 Difference]: Finished difference Result 619 states and 1799 transitions. [2020-02-10 20:20:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:25,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:25,022 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:20:25,022 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:20:25,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:20:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 393. [2020-02-10 20:20:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:20:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1332 transitions. [2020-02-10 20:20:25,031 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1332 transitions. Word has length 22 [2020-02-10 20:20:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:25,031 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1332 transitions. [2020-02-10 20:20:25,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1332 transitions. [2020-02-10 20:20:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:25,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:25,032 INFO L415 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] [2020-02-10 20:20:25,032 INFO L427 AbstractCegarLoop]: === Iteration 1270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash -673336168, now seen corresponding path program 1264 times [2020-02-10 20:20:25,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:25,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720382092] [2020-02-10 20:20:25,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:25,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720382092] [2020-02-10 20:20:25,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:25,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:25,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173493703] [2020-02-10 20:20:25,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:25,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:25,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:25,306 INFO L87 Difference]: Start difference. First operand 393 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:20:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:25,418 INFO L93 Difference]: Finished difference Result 606 states and 1779 transitions. [2020-02-10 20:20:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:25,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:25,420 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:20:25,420 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:20:25,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:20:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 388. [2020-02-10 20:20:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:20:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1319 transitions. [2020-02-10 20:20:25,428 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1319 transitions. Word has length 22 [2020-02-10 20:20:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:25,428 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1319 transitions. [2020-02-10 20:20:25,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1319 transitions. [2020-02-10 20:20:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:25,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:25,429 INFO L415 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] [2020-02-10 20:20:25,429 INFO L427 AbstractCegarLoop]: === Iteration 1271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2141390750, now seen corresponding path program 1265 times [2020-02-10 20:20:25,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:25,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022903604] [2020-02-10 20:20:25,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:25,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022903604] [2020-02-10 20:20:25,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:25,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:25,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609774977] [2020-02-10 20:20:25,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:25,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:25,694 INFO L87 Difference]: Start difference. First operand 388 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:20:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:25,798 INFO L93 Difference]: Finished difference Result 616 states and 1789 transitions. [2020-02-10 20:20:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:25,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:25,800 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:20:25,800 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:20:25,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:20:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-02-10 20:20:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 20:20:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1326 transitions. [2020-02-10 20:20:25,809 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1326 transitions. Word has length 22 [2020-02-10 20:20:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:25,809 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1326 transitions. [2020-02-10 20:20:25,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1326 transitions. [2020-02-10 20:20:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:25,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:25,810 INFO L415 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] [2020-02-10 20:20:25,810 INFO L427 AbstractCegarLoop]: === Iteration 1272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1282516220, now seen corresponding path program 1266 times [2020-02-10 20:20:25,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:25,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917543940] [2020-02-10 20:20:25,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:26,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917543940] [2020-02-10 20:20:26,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:26,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:26,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561545583] [2020-02-10 20:20:26,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:26,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:26,072 INFO L87 Difference]: Start difference. First operand 392 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:20:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:26,178 INFO L93 Difference]: Finished difference Result 605 states and 1773 transitions. [2020-02-10 20:20:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:26,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:26,180 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:20:26,180 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:20:26,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:20:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 382. [2020-02-10 20:20:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-02-10 20:20:26,188 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-02-10 20:20:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:26,188 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-02-10 20:20:26,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-02-10 20:20:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:26,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:26,189 INFO L415 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] [2020-02-10 20:20:26,189 INFO L427 AbstractCegarLoop]: === Iteration 1273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:26,189 INFO L82 PathProgramCache]: Analyzing trace with hash 443042192, now seen corresponding path program 1267 times [2020-02-10 20:20:26,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:26,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623957160] [2020-02-10 20:20:26,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:26,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623957160] [2020-02-10 20:20:26,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:26,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:26,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240776804] [2020-02-10 20:20:26,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:26,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:26,452 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:20:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:26,537 INFO L93 Difference]: Finished difference Result 595 states and 1742 transitions. [2020-02-10 20:20:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:26,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:26,539 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:20:26,539 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:20:26,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:20:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 384. [2020-02-10 20:20:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-02-10 20:20:26,548 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-02-10 20:20:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:26,549 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-02-10 20:20:26,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-02-10 20:20:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:26,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:26,549 INFO L415 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] [2020-02-10 20:20:26,549 INFO L427 AbstractCegarLoop]: === Iteration 1274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash -632668964, now seen corresponding path program 1268 times [2020-02-10 20:20:26,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:26,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681029109] [2020-02-10 20:20:26,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:26,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681029109] [2020-02-10 20:20:26,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:26,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:26,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879028474] [2020-02-10 20:20:26,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:26,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:26,803 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:20:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:26,909 INFO L93 Difference]: Finished difference Result 600 states and 1751 transitions. [2020-02-10 20:20:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:26,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:26,911 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:20:26,911 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:20:26,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:20:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 383. [2020-02-10 20:20:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-02-10 20:20:26,920 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:26,920 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-02-10 20:20:26,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-02-10 20:20:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:26,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:26,921 INFO L415 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] [2020-02-10 20:20:26,921 INFO L427 AbstractCegarLoop]: === Iteration 1275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1157395662, now seen corresponding path program 1269 times [2020-02-10 20:20:26,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:26,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571602974] [2020-02-10 20:20:26,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:27,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571602974] [2020-02-10 20:20:27,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:27,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:27,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802060555] [2020-02-10 20:20:27,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:27,194 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:27,284 INFO L93 Difference]: Finished difference Result 592 states and 1736 transitions. [2020-02-10 20:20:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:27,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:27,285 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:20:27,286 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:20:27,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:20:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 20:20:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1310 transitions. [2020-02-10 20:20:27,295 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1310 transitions. Word has length 22 [2020-02-10 20:20:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:27,295 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1310 transitions. [2020-02-10 20:20:27,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1310 transitions. [2020-02-10 20:20:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:27,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:27,296 INFO L415 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] [2020-02-10 20:20:27,296 INFO L427 AbstractCegarLoop]: === Iteration 1276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -622165860, now seen corresponding path program 1270 times [2020-02-10 20:20:27,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:27,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583022563] [2020-02-10 20:20:27,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:27,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583022563] [2020-02-10 20:20:27,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:27,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:27,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557848509] [2020-02-10 20:20:27,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:27,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:27,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:27,553 INFO L87 Difference]: Start difference. First operand 384 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:20:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:27,659 INFO L93 Difference]: Finished difference Result 586 states and 1733 transitions. [2020-02-10 20:20:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:27,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:27,661 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:20:27,661 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:20:27,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:20:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-02-10 20:20:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1308 transitions. [2020-02-10 20:20:27,670 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1308 transitions. Word has length 22 [2020-02-10 20:20:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:27,670 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1308 transitions. [2020-02-10 20:20:27,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1308 transitions. [2020-02-10 20:20:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:27,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:27,671 INFO L415 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] [2020-02-10 20:20:27,671 INFO L427 AbstractCegarLoop]: === Iteration 1277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1220414286, now seen corresponding path program 1271 times [2020-02-10 20:20:27,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:27,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116245] [2020-02-10 20:20:27,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:27,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116245] [2020-02-10 20:20:27,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:27,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:27,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091635984] [2020-02-10 20:20:27,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:27,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:27,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:27,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:27,924 INFO L87 Difference]: Start difference. First operand 383 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:20:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:28,031 INFO L93 Difference]: Finished difference Result 600 states and 1754 transitions. [2020-02-10 20:20:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:28,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:28,033 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:20:28,033 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:20:28,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:20:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2020-02-10 20:20:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1315 transitions. [2020-02-10 20:20:28,042 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1315 transitions. Word has length 22 [2020-02-10 20:20:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:28,042 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1315 transitions. [2020-02-10 20:20:28,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1315 transitions. [2020-02-10 20:20:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:28,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:28,043 INFO L415 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] [2020-02-10 20:20:28,043 INFO L427 AbstractCegarLoop]: === Iteration 1278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 390526672, now seen corresponding path program 1272 times [2020-02-10 20:20:28,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:28,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805179551] [2020-02-10 20:20:28,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805179551] [2020-02-10 20:20:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:28,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623170475] [2020-02-10 20:20:28,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:28,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:28,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:28,305 INFO L87 Difference]: Start difference. First operand 387 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:20:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:28,436 INFO L93 Difference]: Finished difference Result 589 states and 1738 transitions. [2020-02-10 20:20:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:28,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:28,437 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:20:28,437 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:20:28,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:20:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2020-02-10 20:20:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 20:20:28,446 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:28,446 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 20:20:28,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 20:20:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:28,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:28,447 INFO L415 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] [2020-02-10 20:20:28,447 INFO L427 AbstractCegarLoop]: === Iteration 1279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1164161208, now seen corresponding path program 1273 times [2020-02-10 20:20:28,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:28,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017424415] [2020-02-10 20:20:28,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:28,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017424415] [2020-02-10 20:20:28,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:28,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:28,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184601181] [2020-02-10 20:20:28,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:28,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:28,693 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:28,790 INFO L93 Difference]: Finished difference Result 630 states and 1831 transitions. [2020-02-10 20:20:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:28,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:28,792 INFO L225 Difference]: With dead ends: 630 [2020-02-10 20:20:28,792 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:20:28,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:20:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 390. [2020-02-10 20:20:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 20:20:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-02-10 20:20:28,800 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-02-10 20:20:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:28,800 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-02-10 20:20:28,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-02-10 20:20:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:28,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:28,801 INFO L415 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] [2020-02-10 20:20:28,801 INFO L427 AbstractCegarLoop]: === Iteration 1280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2126364870, now seen corresponding path program 1274 times [2020-02-10 20:20:28,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:28,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420020590] [2020-02-10 20:20:28,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:29,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420020590] [2020-02-10 20:20:29,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:29,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:29,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288545364] [2020-02-10 20:20:29,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:29,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:29,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:29,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:29,044 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-02-10 20:20:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:29,151 INFO L93 Difference]: Finished difference Result 624 states and 1817 transitions. [2020-02-10 20:20:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:29,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:29,153 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:20:29,153 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:20:29,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:20:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 387. [2020-02-10 20:20:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-02-10 20:20:29,162 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-02-10 20:20:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:29,163 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-02-10 20:20:29,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-02-10 20:20:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:29,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:29,163 INFO L415 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] [2020-02-10 20:20:29,164 INFO L427 AbstractCegarLoop]: === Iteration 1281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1448969178, now seen corresponding path program 1275 times [2020-02-10 20:20:29,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:29,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578153548] [2020-02-10 20:20:29,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:29,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578153548] [2020-02-10 20:20:29,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:29,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:29,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029336387] [2020-02-10 20:20:29,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:29,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:29,435 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:20:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:29,518 INFO L93 Difference]: Finished difference Result 639 states and 1849 transitions. [2020-02-10 20:20:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:29,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:29,519 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:20:29,520 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:20:29,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:20:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 395. [2020-02-10 20:20:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 20:20:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1339 transitions. [2020-02-10 20:20:29,528 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1339 transitions. Word has length 22 [2020-02-10 20:20:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:29,528 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1339 transitions. [2020-02-10 20:20:29,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1339 transitions. [2020-02-10 20:20:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:29,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:29,529 INFO L415 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] [2020-02-10 20:20:29,529 INFO L427 AbstractCegarLoop]: === Iteration 1282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1318998732, now seen corresponding path program 1276 times [2020-02-10 20:20:29,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:29,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773241638] [2020-02-10 20:20:29,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:29,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773241638] [2020-02-10 20:20:29,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:29,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:29,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136868363] [2020-02-10 20:20:29,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:29,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:29,791 INFO L87 Difference]: Start difference. First operand 395 states and 1339 transitions. Second operand 9 states. [2020-02-10 20:20:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:29,898 INFO L93 Difference]: Finished difference Result 637 states and 1839 transitions. [2020-02-10 20:20:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:29,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:29,899 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:20:29,900 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:20:29,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:20:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 387. [2020-02-10 20:20:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-02-10 20:20:29,909 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-02-10 20:20:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:29,909 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-02-10 20:20:29,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-02-10 20:20:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:29,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:29,910 INFO L415 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] [2020-02-10 20:20:29,910 INFO L427 AbstractCegarLoop]: === Iteration 1283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash 554607190, now seen corresponding path program 1277 times [2020-02-10 20:20:29,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:29,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372530885] [2020-02-10 20:20:29,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372530885] [2020-02-10 20:20:30,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:30,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531851894] [2020-02-10 20:20:30,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:30,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:30,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:30,156 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-02-10 20:20:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,263 INFO L93 Difference]: Finished difference Result 621 states and 1808 transitions. [2020-02-10 20:20:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:30,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,265 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:20:30,265 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:20:30,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:20:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 389. [2020-02-10 20:20:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1325 transitions. [2020-02-10 20:20:30,274 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1325 transitions. Word has length 22 [2020-02-10 20:20:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:30,274 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1325 transitions. [2020-02-10 20:20:30,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1325 transitions. [2020-02-10 20:20:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:30,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:30,275 INFO L415 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] [2020-02-10 20:20:30,275 INFO L427 AbstractCegarLoop]: === Iteration 1284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash -363343000, now seen corresponding path program 1278 times [2020-02-10 20:20:30,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:30,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398262982] [2020-02-10 20:20:30,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398262982] [2020-02-10 20:20:30,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:30,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936308137] [2020-02-10 20:20:30,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:30,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:30,529 INFO L87 Difference]: Start difference. First operand 389 states and 1325 transitions. Second operand 9 states. [2020-02-10 20:20:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,636 INFO L93 Difference]: Finished difference Result 625 states and 1814 transitions. [2020-02-10 20:20:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:30,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,638 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:20:30,638 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:20:30,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:20:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 383. [2020-02-10 20:20:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 20:20:30,647 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 20:20:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:30,647 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 20:20:30,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 20:20:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:30,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:30,648 INFO L415 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] [2020-02-10 20:20:30,648 INFO L427 AbstractCegarLoop]: === Iteration 1285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash 761872870, now seen corresponding path program 1279 times [2020-02-10 20:20:30,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:30,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396933493] [2020-02-10 20:20:30,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396933493] [2020-02-10 20:20:30,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:30,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475185807] [2020-02-10 20:20:30,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:30,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:30,901 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:20:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,988 INFO L93 Difference]: Finished difference Result 621 states and 1807 transitions. [2020-02-10 20:20:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:30,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,990 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:20:30,990 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:20:30,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:20:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 389. [2020-02-10 20:20:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1327 transitions. [2020-02-10 20:20:31,000 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1327 transitions. Word has length 22 [2020-02-10 20:20:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:31,000 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1327 transitions. [2020-02-10 20:20:31,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1327 transitions. [2020-02-10 20:20:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:31,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:31,001 INFO L415 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] [2020-02-10 20:20:31,001 INFO L427 AbstractCegarLoop]: === Iteration 1286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash -200330792, now seen corresponding path program 1280 times [2020-02-10 20:20:31,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:31,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781440059] [2020-02-10 20:20:31,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:31,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781440059] [2020-02-10 20:20:31,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:31,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027293501] [2020-02-10 20:20:31,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:31,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:31,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:31,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:31,246 INFO L87 Difference]: Start difference. First operand 389 states and 1327 transitions. Second operand 9 states. [2020-02-10 20:20:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:31,354 INFO L93 Difference]: Finished difference Result 615 states and 1793 transitions. [2020-02-10 20:20:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:31,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:31,356 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:20:31,356 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:20:31,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:20:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 20:20:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 20:20:31,365 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 20:20:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:31,365 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 20:20:31,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 20:20:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:31,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:31,366 INFO L415 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] [2020-02-10 20:20:31,366 INFO L427 AbstractCegarLoop]: === Iteration 1287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1774565402, now seen corresponding path program 1281 times [2020-02-10 20:20:31,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:31,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365965131] [2020-02-10 20:20:31,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:31,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365965131] [2020-02-10 20:20:31,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:31,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:31,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079433110] [2020-02-10 20:20:31,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:31,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:31,635 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:20:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:31,733 INFO L93 Difference]: Finished difference Result 617 states and 1800 transitions. [2020-02-10 20:20:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:31,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:31,735 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:20:31,735 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:20:31,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:20:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 391. [2020-02-10 20:20:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 20:20:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1328 transitions. [2020-02-10 20:20:31,743 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1328 transitions. Word has length 22 [2020-02-10 20:20:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:31,744 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1328 transitions. [2020-02-10 20:20:31,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1328 transitions. [2020-02-10 20:20:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:31,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:31,744 INFO L415 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] [2020-02-10 20:20:31,744 INFO L427 AbstractCegarLoop]: === Iteration 1288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -498485236, now seen corresponding path program 1282 times [2020-02-10 20:20:31,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:31,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508981234] [2020-02-10 20:20:31,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:31,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508981234] [2020-02-10 20:20:31,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:31,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:31,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80423549] [2020-02-10 20:20:31,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:31,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:31,996 INFO L87 Difference]: Start difference. First operand 391 states and 1328 transitions. Second operand 9 states. [2020-02-10 20:20:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:32,121 INFO L93 Difference]: Finished difference Result 604 states and 1780 transitions. [2020-02-10 20:20:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:32,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:32,123 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:20:32,123 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:20:32,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:20:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 386. [2020-02-10 20:20:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-02-10 20:20:32,133 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-02-10 20:20:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:32,133 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-02-10 20:20:32,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-02-10 20:20:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:32,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:32,134 INFO L415 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] [2020-02-10 20:20:32,134 INFO L427 AbstractCegarLoop]: === Iteration 1289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1803822924, now seen corresponding path program 1283 times [2020-02-10 20:20:32,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:32,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262634837] [2020-02-10 20:20:32,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:32,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262634837] [2020-02-10 20:20:32,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:32,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:32,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092553994] [2020-02-10 20:20:32,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:32,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:32,386 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-02-10 20:20:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:32,493 INFO L93 Difference]: Finished difference Result 608 states and 1778 transitions. [2020-02-10 20:20:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:32,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:32,494 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:20:32,494 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:20:32,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:20:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 388. [2020-02-10 20:20:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 20:20:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1320 transitions. [2020-02-10 20:20:32,503 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1320 transitions. Word has length 22 [2020-02-10 20:20:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:32,503 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1320 transitions. [2020-02-10 20:20:32,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1320 transitions. [2020-02-10 20:20:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:32,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:32,504 INFO L415 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] [2020-02-10 20:20:32,504 INFO L427 AbstractCegarLoop]: === Iteration 1290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1977070616, now seen corresponding path program 1284 times [2020-02-10 20:20:32,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:32,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632663618] [2020-02-10 20:20:32,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:32,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632663618] [2020-02-10 20:20:32,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:32,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:32,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014507004] [2020-02-10 20:20:32,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:32,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:32,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:32,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:32,763 INFO L87 Difference]: Start difference. First operand 388 states and 1320 transitions. Second operand 9 states. [2020-02-10 20:20:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:32,881 INFO L93 Difference]: Finished difference Result 601 states and 1772 transitions. [2020-02-10 20:20:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:32,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:32,883 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:20:32,883 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:20:32,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:20:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 383. [2020-02-10 20:20:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1310 transitions. [2020-02-10 20:20:32,892 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1310 transitions. Word has length 22 [2020-02-10 20:20:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:32,892 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1310 transitions. [2020-02-10 20:20:32,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1310 transitions. [2020-02-10 20:20:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:32,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:32,893 INFO L415 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] [2020-02-10 20:20:32,893 INFO L427 AbstractCegarLoop]: === Iteration 1291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1517300698, now seen corresponding path program 1285 times [2020-02-10 20:20:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:32,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242205603] [2020-02-10 20:20:32,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:33,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242205603] [2020-02-10 20:20:33,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:33,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:33,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960949228] [2020-02-10 20:20:33,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:33,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:33,161 INFO L87 Difference]: Start difference. First operand 383 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:20:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:33,266 INFO L93 Difference]: Finished difference Result 639 states and 1849 transitions. [2020-02-10 20:20:33,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:33,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:33,268 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:20:33,268 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 20:20:33,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 20:20:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 397. [2020-02-10 20:20:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 20:20:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1343 transitions. [2020-02-10 20:20:33,277 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1343 transitions. Word has length 22 [2020-02-10 20:20:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:33,277 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1343 transitions. [2020-02-10 20:20:33,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1343 transitions. [2020-02-10 20:20:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:33,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:33,278 INFO L415 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] [2020-02-10 20:20:33,278 INFO L427 AbstractCegarLoop]: === Iteration 1292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1647271144, now seen corresponding path program 1286 times [2020-02-10 20:20:33,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:33,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745223223] [2020-02-10 20:20:33,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:33,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745223223] [2020-02-10 20:20:33,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:33,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:33,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919857193] [2020-02-10 20:20:33,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:33,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:33,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:33,542 INFO L87 Difference]: Start difference. First operand 397 states and 1343 transitions. Second operand 9 states. [2020-02-10 20:20:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:33,646 INFO L93 Difference]: Finished difference Result 637 states and 1839 transitions. [2020-02-10 20:20:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:33,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:33,648 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:20:33,648 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:20:33,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:20:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 389. [2020-02-10 20:20:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1324 transitions. [2020-02-10 20:20:33,658 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1324 transitions. Word has length 22 [2020-02-10 20:20:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:33,658 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1324 transitions. [2020-02-10 20:20:33,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1324 transitions. [2020-02-10 20:20:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:33,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:33,659 INFO L415 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] [2020-02-10 20:20:33,659 INFO L427 AbstractCegarLoop]: === Iteration 1293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:33,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1177228744, now seen corresponding path program 1287 times [2020-02-10 20:20:33,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:33,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28851647] [2020-02-10 20:20:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:33,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28851647] [2020-02-10 20:20:33,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:33,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:33,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193959765] [2020-02-10 20:20:33,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:33,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:33,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:33,925 INFO L87 Difference]: Start difference. First operand 389 states and 1324 transitions. Second operand 9 states. [2020-02-10 20:20:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,010 INFO L93 Difference]: Finished difference Result 626 states and 1818 transitions. [2020-02-10 20:20:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:34,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,012 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:20:34,012 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:20:34,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:20:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-02-10 20:20:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 20:20:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1332 transitions. [2020-02-10 20:20:34,022 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1332 transitions. Word has length 22 [2020-02-10 20:20:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:34,022 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1332 transitions. [2020-02-10 20:20:34,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1332 transitions. [2020-02-10 20:20:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:34,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:34,022 INFO L415 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] [2020-02-10 20:20:34,022 INFO L427 AbstractCegarLoop]: === Iteration 1294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1095821894, now seen corresponding path program 1288 times [2020-02-10 20:20:34,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:34,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978162224] [2020-02-10 20:20:34,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:34,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978162224] [2020-02-10 20:20:34,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:34,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:34,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142149981] [2020-02-10 20:20:34,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:34,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:34,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:34,272 INFO L87 Difference]: Start difference. First operand 394 states and 1332 transitions. Second operand 9 states. [2020-02-10 20:20:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,379 INFO L93 Difference]: Finished difference Result 613 states and 1798 transitions. [2020-02-10 20:20:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:34,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,381 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:20:34,381 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:20:34,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:20:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-02-10 20:20:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1319 transitions. [2020-02-10 20:20:34,391 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1319 transitions. Word has length 22 [2020-02-10 20:20:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:34,391 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1319 transitions. [2020-02-10 20:20:34,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1319 transitions. [2020-02-10 20:20:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:34,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:34,392 INFO L415 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] [2020-02-10 20:20:34,392 INFO L427 AbstractCegarLoop]: === Iteration 1295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1731090820, now seen corresponding path program 1289 times [2020-02-10 20:20:34,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:34,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489373423] [2020-02-10 20:20:34,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:34,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489373423] [2020-02-10 20:20:34,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:34,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:34,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999500634] [2020-02-10 20:20:34,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:34,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:34,646 INFO L87 Difference]: Start difference. First operand 389 states and 1319 transitions. Second operand 9 states. [2020-02-10 20:20:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,776 INFO L93 Difference]: Finished difference Result 623 states and 1808 transitions. [2020-02-10 20:20:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:34,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,778 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:20:34,778 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:20:34,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:20:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-02-10 20:20:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 20:20:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1326 transitions. [2020-02-10 20:20:34,788 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1326 transitions. Word has length 22 [2020-02-10 20:20:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:34,788 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1326 transitions. [2020-02-10 20:20:34,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1326 transitions. [2020-02-10 20:20:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:34,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:34,789 INFO L415 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] [2020-02-10 20:20:34,789 INFO L427 AbstractCegarLoop]: === Iteration 1296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1705001946, now seen corresponding path program 1290 times [2020-02-10 20:20:34,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:34,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544182513] [2020-02-10 20:20:34,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:35,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544182513] [2020-02-10 20:20:35,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:35,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:35,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019104553] [2020-02-10 20:20:35,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:35,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:35,049 INFO L87 Difference]: Start difference. First operand 393 states and 1326 transitions. Second operand 9 states. [2020-02-10 20:20:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:35,161 INFO L93 Difference]: Finished difference Result 612 states and 1792 transitions. [2020-02-10 20:20:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:35,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:35,163 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:20:35,163 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:20:35,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:20:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 383. [2020-02-10 20:20:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2020-02-10 20:20:35,172 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2020-02-10 20:20:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,172 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2020-02-10 20:20:35,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2020-02-10 20:20:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:35,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:35,173 INFO L415 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] [2020-02-10 20:20:35,173 INFO L427 AbstractCegarLoop]: === Iteration 1297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1909008646, now seen corresponding path program 1291 times [2020-02-10 20:20:35,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787057262] [2020-02-10 20:20:35,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:35,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787057262] [2020-02-10 20:20:35,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:35,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:35,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573415139] [2020-02-10 20:20:35,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:35,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:35,402 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:20:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:35,513 INFO L93 Difference]: Finished difference Result 608 states and 1776 transitions. [2020-02-10 20:20:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:35,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:35,515 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:20:35,515 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:20:35,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:20:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 387. [2020-02-10 20:20:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1316 transitions. [2020-02-10 20:20:35,523 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,524 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1316 transitions. [2020-02-10 20:20:35,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1316 transitions. [2020-02-10 20:20:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:35,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:35,524 INFO L415 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] [2020-02-10 20:20:35,524 INFO L427 AbstractCegarLoop]: === Iteration 1298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1468008460, now seen corresponding path program 1292 times [2020-02-10 20:20:35,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889370931] [2020-02-10 20:20:35,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:35,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889370931] [2020-02-10 20:20:35,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:35,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:35,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61085206] [2020-02-10 20:20:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:35,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:35,753 INFO L87 Difference]: Start difference. First operand 387 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:35,864 INFO L93 Difference]: Finished difference Result 612 states and 1782 transitions. [2020-02-10 20:20:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:35,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:35,866 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:20:35,866 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:20:35,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:20:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-02-10 20:20:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1311 transitions. [2020-02-10 20:20:35,875 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1311 transitions. Word has length 22 [2020-02-10 20:20:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,876 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1311 transitions. [2020-02-10 20:20:35,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1311 transitions. [2020-02-10 20:20:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:35,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:35,876 INFO L415 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] [2020-02-10 20:20:35,876 INFO L427 AbstractCegarLoop]: === Iteration 1299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -298067688, now seen corresponding path program 1293 times [2020-02-10 20:20:35,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710606214] [2020-02-10 20:20:35,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:36,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710606214] [2020-02-10 20:20:36,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:36,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:36,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481349082] [2020-02-10 20:20:36,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:36,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:36,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:36,116 INFO L87 Difference]: Start difference. First operand 385 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:20:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:36,227 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-02-10 20:20:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:36,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:36,228 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:20:36,228 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:20:36,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:20:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 20:20:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 20:20:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1314 transitions. [2020-02-10 20:20:36,237 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1314 transitions. Word has length 22 [2020-02-10 20:20:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:36,238 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1314 transitions. [2020-02-10 20:20:36,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1314 transitions. [2020-02-10 20:20:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:36,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:36,238 INFO L415 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] [2020-02-10 20:20:36,238 INFO L427 AbstractCegarLoop]: === Iteration 1300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash -471315380, now seen corresponding path program 1294 times [2020-02-10 20:20:36,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:36,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161399958] [2020-02-10 20:20:36,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:36,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161399958] [2020-02-10 20:20:36,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:36,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:36,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340507501] [2020-02-10 20:20:36,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:36,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:36,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:36,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:36,471 INFO L87 Difference]: Start difference. First operand 387 states and 1314 transitions. Second operand 9 states. [2020-02-10 20:20:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:36,588 INFO L93 Difference]: Finished difference Result 597 states and 1761 transitions. [2020-02-10 20:20:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:36,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:36,590 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:20:36,590 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:20:36,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:20:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 385. [2020-02-10 20:20:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1309 transitions. [2020-02-10 20:20:36,600 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:36,600 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1309 transitions. [2020-02-10 20:20:36,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1309 transitions. [2020-02-10 20:20:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:36,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:36,601 INFO L415 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] [2020-02-10 20:20:36,601 INFO L427 AbstractCegarLoop]: === Iteration 1301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash 392297304, now seen corresponding path program 1295 times [2020-02-10 20:20:36,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:36,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679037457] [2020-02-10 20:20:36,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:36,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679037457] [2020-02-10 20:20:36,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:36,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:36,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486617031] [2020-02-10 20:20:36,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:36,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:36,835 INFO L87 Difference]: Start difference. First operand 385 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:36,942 INFO L93 Difference]: Finished difference Result 610 states and 1779 transitions. [2020-02-10 20:20:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:36,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:36,944 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:20:36,944 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:20:36,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:20:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-02-10 20:20:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 20:20:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1316 transitions. [2020-02-10 20:20:36,953 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1316 transitions. Word has length 22 [2020-02-10 20:20:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:36,954 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1316 transitions. [2020-02-10 20:20:36,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1316 transitions. [2020-02-10 20:20:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:36,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:36,954 INFO L415 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] [2020-02-10 20:20:36,954 INFO L427 AbstractCegarLoop]: === Iteration 1302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1136999802, now seen corresponding path program 1296 times [2020-02-10 20:20:36,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:36,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107069356] [2020-02-10 20:20:36,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107069356] [2020-02-10 20:20:37,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:37,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596647491] [2020-02-10 20:20:37,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:37,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:37,187 INFO L87 Difference]: Start difference. First operand 389 states and 1316 transitions. Second operand 9 states. [2020-02-10 20:20:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:37,306 INFO L93 Difference]: Finished difference Result 599 states and 1763 transitions. [2020-02-10 20:20:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:37,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:37,308 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:20:37,308 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:20:37,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:20:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 20:20:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:20:37,318 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:20:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:37,318 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:20:37,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:20:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:37,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:37,319 INFO L415 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] [2020-02-10 20:20:37,319 INFO L427 AbstractCegarLoop]: === Iteration 1303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:37,319 INFO L82 PathProgramCache]: Analyzing trace with hash -893761222, now seen corresponding path program 1297 times [2020-02-10 20:20:37,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:37,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746329275] [2020-02-10 20:20:37,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746329275] [2020-02-10 20:20:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:37,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094793367] [2020-02-10 20:20:37,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:37,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:37,593 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:20:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:37,684 INFO L93 Difference]: Finished difference Result 565 states and 1669 transitions. [2020-02-10 20:20:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:37,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:37,685 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:20:37,686 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:20:37,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:20:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 382. [2020-02-10 20:20:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 20:20:37,694 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 20:20:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:37,694 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 20:20:37,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 20:20:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:37,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:37,695 INFO L415 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] [2020-02-10 20:20:37,695 INFO L427 AbstractCegarLoop]: === Iteration 1304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash 717179736, now seen corresponding path program 1298 times [2020-02-10 20:20:37,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:37,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772991353] [2020-02-10 20:20:37,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772991353] [2020-02-10 20:20:37,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:37,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948618493] [2020-02-10 20:20:37,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:37,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:37,956 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:20:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:38,061 INFO L93 Difference]: Finished difference Result 566 states and 1670 transitions. [2020-02-10 20:20:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:38,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:38,063 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:20:38,063 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:20:38,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:20:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 381. [2020-02-10 20:20:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-02-10 20:20:38,072 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:38,072 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-02-10 20:20:38,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-02-10 20:20:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:38,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:38,072 INFO L415 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] [2020-02-10 20:20:38,073 INFO L427 AbstractCegarLoop]: === Iteration 1305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1719369164, now seen corresponding path program 1299 times [2020-02-10 20:20:38,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:38,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581251319] [2020-02-10 20:20:38,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:38,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581251319] [2020-02-10 20:20:38,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:38,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:38,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335053166] [2020-02-10 20:20:38,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:38,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:38,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:38,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:38,325 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:38,400 INFO L93 Difference]: Finished difference Result 569 states and 1676 transitions. [2020-02-10 20:20:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:38,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:38,402 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:20:38,402 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:20:38,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:20:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:20:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 20:20:38,411 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 20:20:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:38,411 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 20:20:38,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 20:20:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:38,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:38,412 INFO L415 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] [2020-02-10 20:20:38,412 INFO L427 AbstractCegarLoop]: === Iteration 1306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 643658008, now seen corresponding path program 1300 times [2020-02-10 20:20:38,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:38,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539973959] [2020-02-10 20:20:38,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:38,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539973959] [2020-02-10 20:20:38,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:38,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:38,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101619951] [2020-02-10 20:20:38,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:38,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:38,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:38,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:38,664 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:20:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:38,768 INFO L93 Difference]: Finished difference Result 574 states and 1685 transitions. [2020-02-10 20:20:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:38,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:38,770 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:20:38,770 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:20:38,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:20:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 381. [2020-02-10 20:20:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-02-10 20:20:38,779 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-02-10 20:20:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:38,779 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-02-10 20:20:38,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-02-10 20:20:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:38,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:38,780 INFO L415 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] [2020-02-10 20:20:38,780 INFO L427 AbstractCegarLoop]: === Iteration 1307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1729872268, now seen corresponding path program 1301 times [2020-02-10 20:20:38,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:38,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044431179] [2020-02-10 20:20:38,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:39,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044431179] [2020-02-10 20:20:39,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:39,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:39,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994746521] [2020-02-10 20:20:39,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:39,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:39,027 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:20:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:39,128 INFO L93 Difference]: Finished difference Result 572 states and 1682 transitions. [2020-02-10 20:20:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:39,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:39,130 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:20:39,130 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:20:39,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:20:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-02-10 20:20:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2020-02-10 20:20:39,139 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2020-02-10 20:20:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:39,139 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2020-02-10 20:20:39,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2020-02-10 20:20:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:39,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:39,140 INFO L415 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] [2020-02-10 20:20:39,140 INFO L427 AbstractCegarLoop]: === Iteration 1308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -956779846, now seen corresponding path program 1302 times [2020-02-10 20:20:39,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:39,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891491101] [2020-02-10 20:20:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:39,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891491101] [2020-02-10 20:20:39,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:39,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:39,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435784016] [2020-02-10 20:20:39,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:39,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:39,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:39,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:39,381 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:20:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:39,483 INFO L93 Difference]: Finished difference Result 576 states and 1688 transitions. [2020-02-10 20:20:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:39,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:39,485 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:20:39,485 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:20:39,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:20:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 380. [2020-02-10 20:20:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:20:39,494 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:39,494 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:20:39,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:20:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:39,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:39,495 INFO L415 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] [2020-02-10 20:20:39,495 INFO L427 AbstractCegarLoop]: === Iteration 1309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1032272856, now seen corresponding path program 1303 times [2020-02-10 20:20:39,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:39,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764824656] [2020-02-10 20:20:39,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:39,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764824656] [2020-02-10 20:20:39,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:39,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:39,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906707175] [2020-02-10 20:20:39,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:39,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:39,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:39,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:39,769 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:39,852 INFO L93 Difference]: Finished difference Result 562 states and 1662 transitions. [2020-02-10 20:20:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:39,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:39,854 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:20:39,854 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:20:39,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:20:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 20:20:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 20:20:39,863 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 20:20:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:39,864 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 20:20:39,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 20:20:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:39,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:39,865 INFO L415 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] [2020-02-10 20:20:39,865 INFO L427 AbstractCegarLoop]: === Iteration 1310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1651753482, now seen corresponding path program 1304 times [2020-02-10 20:20:39,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:39,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889682916] [2020-02-10 20:20:39,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:40,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889682916] [2020-02-10 20:20:40,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:40,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:40,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844301644] [2020-02-10 20:20:40,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:40,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:40,138 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:20:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:40,243 INFO L93 Difference]: Finished difference Result 563 states and 1663 transitions. [2020-02-10 20:20:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:40,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:40,244 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:20:40,244 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:20:40,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:20:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-02-10 20:20:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-02-10 20:20:40,253 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-02-10 20:20:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:40,253 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-02-10 20:20:40,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-02-10 20:20:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:40,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:40,254 INFO L415 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] [2020-02-10 20:20:40,254 INFO L427 AbstractCegarLoop]: === Iteration 1311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:40,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2044965388, now seen corresponding path program 1305 times [2020-02-10 20:20:40,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:40,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377939903] [2020-02-10 20:20:40,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:40,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377939903] [2020-02-10 20:20:40,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:40,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:40,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219368244] [2020-02-10 20:20:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:40,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:40,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:40,539 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:20:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:40,629 INFO L93 Difference]: Finished difference Result 563 states and 1664 transitions. [2020-02-10 20:20:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:40,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:40,630 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:20:40,631 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:20:40,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:20:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 382. [2020-02-10 20:20:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 20:20:40,640 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:40,640 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 20:20:40,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 20:20:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:40,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:40,641 INFO L415 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] [2020-02-10 20:20:40,641 INFO L427 AbstractCegarLoop]: === Iteration 1312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1714772106, now seen corresponding path program 1306 times [2020-02-10 20:20:40,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:40,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455409138] [2020-02-10 20:20:40,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:40,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455409138] [2020-02-10 20:20:40,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:40,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:40,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119595174] [2020-02-10 20:20:40,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:40,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:40,896 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:40,998 INFO L93 Difference]: Finished difference Result 557 states and 1661 transitions. [2020-02-10 20:20:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:40,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,000 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:20:41,000 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:20:41,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:20:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 381. [2020-02-10 20:20:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 20:20:41,009 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,010 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 20:20:41,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 20:20:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:41,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,010 INFO L415 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] [2020-02-10 20:20:41,010 INFO L427 AbstractCegarLoop]: === Iteration 1313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2055468492, now seen corresponding path program 1307 times [2020-02-10 20:20:41,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989487801] [2020-02-10 20:20:41,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:41,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989487801] [2020-02-10 20:20:41,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:41,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:41,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104713064] [2020-02-10 20:20:41,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:41,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:41,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:41,275 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:41,376 INFO L93 Difference]: Finished difference Result 565 states and 1668 transitions. [2020-02-10 20:20:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:41,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,377 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:20:41,378 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:20:41,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:20:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 383. [2020-02-10 20:20:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1305 transitions. [2020-02-10 20:20:41,386 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1305 transitions. Word has length 22 [2020-02-10 20:20:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,386 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1305 transitions. [2020-02-10 20:20:41,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1305 transitions. [2020-02-10 20:20:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:41,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,387 INFO L415 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] [2020-02-10 20:20:41,387 INFO L427 AbstractCegarLoop]: === Iteration 1314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 979757336, now seen corresponding path program 1308 times [2020-02-10 20:20:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272990679] [2020-02-10 20:20:41,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:41,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272990679] [2020-02-10 20:20:41,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:41,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:41,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209176252] [2020-02-10 20:20:41,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:41,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:41,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:41,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:41,647 INFO L87 Difference]: Start difference. First operand 383 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:20:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:41,746 INFO L93 Difference]: Finished difference Result 558 states and 1662 transitions. [2020-02-10 20:20:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:41,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,747 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:20:41,747 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:20:41,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:20:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 380. [2020-02-10 20:20:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 20:20:41,757 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 20:20:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,757 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 20:20:41,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 20:20:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:41,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,757 INFO L415 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] [2020-02-10 20:20:41,758 INFO L427 AbstractCegarLoop]: === Iteration 1315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1246900712, now seen corresponding path program 1309 times [2020-02-10 20:20:41,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669642184] [2020-02-10 20:20:41,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:42,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669642184] [2020-02-10 20:20:42,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:42,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:42,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617031344] [2020-02-10 20:20:42,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:42,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:42,005 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:20:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:42,082 INFO L93 Difference]: Finished difference Result 572 states and 1683 transitions. [2020-02-10 20:20:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:42,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:42,084 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:20:42,084 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:20:42,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:20:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 382. [2020-02-10 20:20:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 20:20:42,093 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:42,093 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 20:20:42,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 20:20:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:42,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:42,094 INFO L415 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] [2020-02-10 20:20:42,094 INFO L427 AbstractCegarLoop]: === Iteration 1316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1972355428, now seen corresponding path program 1310 times [2020-02-10 20:20:42,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:42,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284366619] [2020-02-10 20:20:42,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:42,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284366619] [2020-02-10 20:20:42,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:42,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:42,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125519792] [2020-02-10 20:20:42,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:42,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:42,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:42,333 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:42,442 INFO L93 Difference]: Finished difference Result 577 states and 1692 transitions. [2020-02-10 20:20:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:42,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:42,444 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:20:42,444 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:20:42,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:20:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 20:20:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 20:20:42,452 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:42,452 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 20:20:42,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 20:20:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:42,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:42,453 INFO L415 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] [2020-02-10 20:20:42,453 INFO L427 AbstractCegarLoop]: === Iteration 1317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1447628730, now seen corresponding path program 1311 times [2020-02-10 20:20:42,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:42,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196063700] [2020-02-10 20:20:42,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:42,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196063700] [2020-02-10 20:20:42,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:42,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:42,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103468526] [2020-02-10 20:20:42,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:42,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:42,716 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:42,792 INFO L93 Difference]: Finished difference Result 569 states and 1677 transitions. [2020-02-10 20:20:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:42,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:42,794 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:20:42,794 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:20:42,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:20:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 20:20:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1303 transitions. [2020-02-10 20:20:42,803 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1303 transitions. Word has length 22 [2020-02-10 20:20:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:42,804 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1303 transitions. [2020-02-10 20:20:42,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1303 transitions. [2020-02-10 20:20:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:42,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:42,804 INFO L415 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] [2020-02-10 20:20:42,804 INFO L427 AbstractCegarLoop]: === Iteration 1318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1982858532, now seen corresponding path program 1312 times [2020-02-10 20:20:42,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:42,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464288747] [2020-02-10 20:20:42,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:43,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464288747] [2020-02-10 20:20:43,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:43,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:43,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864492793] [2020-02-10 20:20:43,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:43,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:43,051 INFO L87 Difference]: Start difference. First operand 382 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:20:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:43,152 INFO L93 Difference]: Finished difference Result 563 states and 1674 transitions. [2020-02-10 20:20:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:43,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:43,154 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:20:43,154 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:20:43,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:20:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 381. [2020-02-10 20:20:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-02-10 20:20:43,163 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:43,163 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-02-10 20:20:43,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-02-10 20:20:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:43,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:43,163 INFO L415 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] [2020-02-10 20:20:43,164 INFO L427 AbstractCegarLoop]: === Iteration 1319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1384610106, now seen corresponding path program 1313 times [2020-02-10 20:20:43,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:43,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811023766] [2020-02-10 20:20:43,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:43,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811023766] [2020-02-10 20:20:43,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:43,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:43,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416528894] [2020-02-10 20:20:43,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:43,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:43,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:43,408 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:43,508 INFO L93 Difference]: Finished difference Result 577 states and 1695 transitions. [2020-02-10 20:20:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:43,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:43,510 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:20:43,510 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:20:43,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:20:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 20:20:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:20:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1308 transitions. [2020-02-10 20:20:43,519 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1308 transitions. Word has length 22 [2020-02-10 20:20:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:43,520 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1308 transitions. [2020-02-10 20:20:43,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1308 transitions. [2020-02-10 20:20:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:43,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:43,520 INFO L415 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] [2020-02-10 20:20:43,520 INFO L427 AbstractCegarLoop]: === Iteration 1320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1299416232, now seen corresponding path program 1314 times [2020-02-10 20:20:43,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:43,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368722184] [2020-02-10 20:20:43,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:43,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368722184] [2020-02-10 20:20:43,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:43,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:43,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477971811] [2020-02-10 20:20:43,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:43,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:43,764 INFO L87 Difference]: Start difference. First operand 385 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:20:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:43,866 INFO L93 Difference]: Finished difference Result 566 states and 1679 transitions. [2020-02-10 20:20:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:43,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:43,868 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:20:43,868 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:20:43,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:20:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-02-10 20:20:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 20:20:43,876 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 20:20:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:43,877 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 20:20:43,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 20:20:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:43,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:43,877 INFO L415 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] [2020-02-10 20:20:43,877 INFO L427 AbstractCegarLoop]: === Iteration 1321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash 689636470, now seen corresponding path program 1315 times [2020-02-10 20:20:43,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:43,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030998816] [2020-02-10 20:20:43,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030998816] [2020-02-10 20:20:44,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:44,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988232862] [2020-02-10 20:20:44,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:44,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:44,112 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:20:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:44,213 INFO L93 Difference]: Finished difference Result 578 states and 1698 transitions. [2020-02-10 20:20:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:44,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:44,215 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:20:44,215 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:20:44,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:20:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 384. [2020-02-10 20:20:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1309 transitions. [2020-02-10 20:20:44,225 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:44,225 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1309 transitions. [2020-02-10 20:20:44,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1309 transitions. [2020-02-10 20:20:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:44,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:44,226 INFO L415 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] [2020-02-10 20:20:44,226 INFO L427 AbstractCegarLoop]: === Iteration 1322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1997015644, now seen corresponding path program 1316 times [2020-02-10 20:20:44,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:44,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083292538] [2020-02-10 20:20:44,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083292538] [2020-02-10 20:20:44,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:44,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409076428] [2020-02-10 20:20:44,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:44,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:44,457 INFO L87 Difference]: Start difference. First operand 384 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:44,556 INFO L93 Difference]: Finished difference Result 582 states and 1704 transitions. [2020-02-10 20:20:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:44,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:44,558 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:20:44,558 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:20:44,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:20:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 20:20:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 20:20:44,567 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:44,567 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 20:20:44,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 20:20:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:44,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:44,568 INFO L415 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] [2020-02-10 20:20:44,568 INFO L427 AbstractCegarLoop]: === Iteration 1323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash -910801384, now seen corresponding path program 1317 times [2020-02-10 20:20:44,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:44,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404650598] [2020-02-10 20:20:44,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404650598] [2020-02-10 20:20:44,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:44,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563419443] [2020-02-10 20:20:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:44,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:44,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:44,808 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:44,919 INFO L93 Difference]: Finished difference Result 574 states and 1689 transitions. [2020-02-10 20:20:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:44,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:44,921 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:20:44,921 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:20:44,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:20:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 384. [2020-02-10 20:20:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:20:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1307 transitions. [2020-02-10 20:20:44,931 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1307 transitions. Word has length 22 [2020-02-10 20:20:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:44,931 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1307 transitions. [2020-02-10 20:20:44,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1307 transitions. [2020-02-10 20:20:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:44,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:44,931 INFO L415 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] [2020-02-10 20:20:44,932 INFO L427 AbstractCegarLoop]: === Iteration 1324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1986512540, now seen corresponding path program 1318 times [2020-02-10 20:20:44,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:44,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779148864] [2020-02-10 20:20:44,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:45,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779148864] [2020-02-10 20:20:45,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:45,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:45,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284464924] [2020-02-10 20:20:45,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:45,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:45,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:45,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:45,163 INFO L87 Difference]: Start difference. First operand 384 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:20:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,275 INFO L93 Difference]: Finished difference Result 567 states and 1683 transitions. [2020-02-10 20:20:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:45,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,277 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:20:45,277 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:20:45,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:20:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 20:20:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1302 transitions. [2020-02-10 20:20:45,287 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:45,287 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1302 transitions. [2020-02-10 20:20:45,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1302 transitions. [2020-02-10 20:20:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:45,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:45,287 INFO L415 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] [2020-02-10 20:20:45,287 INFO L427 AbstractCegarLoop]: === Iteration 1325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash -984323112, now seen corresponding path program 1319 times [2020-02-10 20:20:45,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:45,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584649311] [2020-02-10 20:20:45,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:45,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584649311] [2020-02-10 20:20:45,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:45,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:45,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331104875] [2020-02-10 20:20:45,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:45,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:45,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:45,533 INFO L87 Difference]: Start difference. First operand 382 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,632 INFO L93 Difference]: Finished difference Result 580 states and 1701 transitions. [2020-02-10 20:20:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:45,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,633 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:20:45,633 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:20:45,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:20:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 386. [2020-02-10 20:20:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:20:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1309 transitions. [2020-02-10 20:20:45,642 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:45,643 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1309 transitions. [2020-02-10 20:20:45,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1309 transitions. [2020-02-10 20:20:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:45,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:45,643 INFO L415 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] [2020-02-10 20:20:45,643 INFO L427 AbstractCegarLoop]: === Iteration 1326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash 626617846, now seen corresponding path program 1320 times [2020-02-10 20:20:45,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:45,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443168066] [2020-02-10 20:20:45,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:45,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443168066] [2020-02-10 20:20:45,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:45,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:45,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017160676] [2020-02-10 20:20:45,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:45,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:45,881 INFO L87 Difference]: Start difference. First operand 386 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,990 INFO L93 Difference]: Finished difference Result 569 states and 1685 transitions. [2020-02-10 20:20:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:45,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,992 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:20:45,992 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:20:45,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:20:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 376. [2020-02-10 20:20:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:20:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1292 transitions. [2020-02-10 20:20:46,001 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1292 transitions. Word has length 22 [2020-02-10 20:20:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:46,001 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1292 transitions. [2020-02-10 20:20:46,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1292 transitions. [2020-02-10 20:20:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:46,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:46,002 INFO L415 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] [2020-02-10 20:20:46,002 INFO L427 AbstractCegarLoop]: === Iteration 1327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:46,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1616354142, now seen corresponding path program 1321 times [2020-02-10 20:20:46,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:46,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790722991] [2020-02-10 20:20:46,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:46,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790722991] [2020-02-10 20:20:46,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:46,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:46,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116514849] [2020-02-10 20:20:46,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:46,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:46,282 INFO L87 Difference]: Start difference. First operand 376 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:20:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:46,385 INFO L93 Difference]: Finished difference Result 533 states and 1590 transitions. [2020-02-10 20:20:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:46,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:46,387 INFO L225 Difference]: With dead ends: 533 [2020-02-10 20:20:46,387 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 20:20:46,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 20:20:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-02-10 20:20:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1305 transitions. [2020-02-10 20:20:46,396 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1305 transitions. Word has length 22 [2020-02-10 20:20:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:46,397 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1305 transitions. [2020-02-10 20:20:46,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1305 transitions. [2020-02-10 20:20:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:46,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:46,397 INFO L415 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] [2020-02-10 20:20:46,397 INFO L427 AbstractCegarLoop]: === Iteration 1328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1233096144, now seen corresponding path program 1322 times [2020-02-10 20:20:46,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:46,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678594087] [2020-02-10 20:20:46,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:46,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678594087] [2020-02-10 20:20:46,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:46,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:46,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415391601] [2020-02-10 20:20:46,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:46,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:46,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:46,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:46,685 INFO L87 Difference]: Start difference. First operand 380 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:20:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:46,771 INFO L93 Difference]: Finished difference Result 531 states and 1585 transitions. [2020-02-10 20:20:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:46,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:46,772 INFO L225 Difference]: With dead ends: 531 [2020-02-10 20:20:46,772 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:20:46,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:20:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 379. [2020-02-10 20:20:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1303 transitions. [2020-02-10 20:20:46,781 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1303 transitions. Word has length 22 [2020-02-10 20:20:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:46,781 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1303 transitions. [2020-02-10 20:20:46,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1303 transitions. [2020-02-10 20:20:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:46,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:46,782 INFO L415 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] [2020-02-10 20:20:46,782 INFO L427 AbstractCegarLoop]: === Iteration 1329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1078175300, now seen corresponding path program 1323 times [2020-02-10 20:20:46,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:46,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552036357] [2020-02-10 20:20:46,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:47,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552036357] [2020-02-10 20:20:47,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:47,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:47,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580435860] [2020-02-10 20:20:47,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:47,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:47,073 INFO L87 Difference]: Start difference. First operand 379 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:20:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:47,179 INFO L93 Difference]: Finished difference Result 535 states and 1594 transitions. [2020-02-10 20:20:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:47,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:47,180 INFO L225 Difference]: With dead ends: 535 [2020-02-10 20:20:47,180 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 20:20:47,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 20:20:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2020-02-10 20:20:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 20:20:47,190 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 20:20:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:47,190 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 20:20:47,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 20:20:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:47,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:47,190 INFO L415 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] [2020-02-10 20:20:47,191 INFO L427 AbstractCegarLoop]: === Iteration 1330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1331268052, now seen corresponding path program 1324 times [2020-02-10 20:20:47,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:47,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252096012] [2020-02-10 20:20:47,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:47,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252096012] [2020-02-10 20:20:47,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:47,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:47,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535681893] [2020-02-10 20:20:47,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:47,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:47,481 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:20:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:47,592 INFO L93 Difference]: Finished difference Result 534 states and 1590 transitions. [2020-02-10 20:20:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:47,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:47,594 INFO L225 Difference]: With dead ends: 534 [2020-02-10 20:20:47,594 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 20:20:47,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 20:20:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 379. [2020-02-10 20:20:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 20:20:47,603 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:47,603 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 20:20:47,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 20:20:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:47,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:47,604 INFO L415 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] [2020-02-10 20:20:47,604 INFO L427 AbstractCegarLoop]: === Iteration 1331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1967779564, now seen corresponding path program 1325 times [2020-02-10 20:20:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:47,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781050828] [2020-02-10 20:20:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:47,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781050828] [2020-02-10 20:20:47,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:47,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:47,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979862255] [2020-02-10 20:20:47,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:47,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:47,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:47,895 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:47,970 INFO L93 Difference]: Finished difference Result 530 states and 1582 transitions. [2020-02-10 20:20:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:47,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:47,972 INFO L225 Difference]: With dead ends: 530 [2020-02-10 20:20:47,972 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:20:47,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:20:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-02-10 20:20:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 20:20:47,981 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 20:20:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:47,981 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 20:20:47,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 20:20:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:47,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:47,982 INFO L415 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] [2020-02-10 20:20:47,982 INFO L427 AbstractCegarLoop]: === Iteration 1332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -356838606, now seen corresponding path program 1326 times [2020-02-10 20:20:47,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:47,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491678422] [2020-02-10 20:20:47,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:48,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491678422] [2020-02-10 20:20:48,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:48,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:48,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280243252] [2020-02-10 20:20:48,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:48,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:48,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:48,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:48,268 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:20:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:48,383 INFO L93 Difference]: Finished difference Result 531 states and 1583 transitions. [2020-02-10 20:20:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:48,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:48,385 INFO L225 Difference]: With dead ends: 531 [2020-02-10 20:20:48,385 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 20:20:48,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 20:20:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 378. [2020-02-10 20:20:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:20:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1300 transitions. [2020-02-10 20:20:48,394 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1300 transitions. Word has length 22 [2020-02-10 20:20:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:48,394 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1300 transitions. [2020-02-10 20:20:48,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1300 transitions. [2020-02-10 20:20:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:48,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:48,395 INFO L415 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] [2020-02-10 20:20:48,395 INFO L427 AbstractCegarLoop]: === Iteration 1333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2081276496, now seen corresponding path program 1327 times [2020-02-10 20:20:48,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:48,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221114302] [2020-02-10 20:20:48,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:48,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221114302] [2020-02-10 20:20:48,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042316236] [2020-02-10 20:20:48,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:48,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:48,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:48,665 INFO L87 Difference]: Start difference. First operand 378 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:20:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:48,782 INFO L93 Difference]: Finished difference Result 538 states and 1600 transitions. [2020-02-10 20:20:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:48,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:48,783 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:20:48,784 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 20:20:48,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 20:20:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 380. [2020-02-10 20:20:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-02-10 20:20:48,793 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:48,793 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-02-10 20:20:48,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-02-10 20:20:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:48,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:48,794 INFO L415 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] [2020-02-10 20:20:48,794 INFO L427 AbstractCegarLoop]: === Iteration 1334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 635759486, now seen corresponding path program 1328 times [2020-02-10 20:20:48,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:48,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297698263] [2020-02-10 20:20:48,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:49,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297698263] [2020-02-10 20:20:49,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:49,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:49,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025869663] [2020-02-10 20:20:49,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:49,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:49,074 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,161 INFO L93 Difference]: Finished difference Result 536 states and 1595 transitions. [2020-02-10 20:20:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:49,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,163 INFO L225 Difference]: With dead ends: 536 [2020-02-10 20:20:49,163 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:20:49,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:20:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2020-02-10 20:20:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 20:20:49,171 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,172 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 20:20:49,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 20:20:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:49,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,172 INFO L415 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] [2020-02-10 20:20:49,172 INFO L427 AbstractCegarLoop]: === Iteration 1335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1200998268, now seen corresponding path program 1329 times [2020-02-10 20:20:49,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011459519] [2020-02-10 20:20:49,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:49,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011459519] [2020-02-10 20:20:49,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:49,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:49,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789885345] [2020-02-10 20:20:49,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:49,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:49,441 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,546 INFO L93 Difference]: Finished difference Result 545 states and 1615 transitions. [2020-02-10 20:20:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:49,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,548 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:20:49,548 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:20:49,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:20:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 382. [2020-02-10 20:20:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-02-10 20:20:49,557 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-02-10 20:20:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,557 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-02-10 20:20:49,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-02-10 20:20:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:49,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,558 INFO L415 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] [2020-02-10 20:20:49,558 INFO L427 AbstractCegarLoop]: === Iteration 1336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash 185036862, now seen corresponding path program 1330 times [2020-02-10 20:20:49,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212309407] [2020-02-10 20:20:49,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:49,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212309407] [2020-02-10 20:20:49,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:49,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:49,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713022720] [2020-02-10 20:20:49,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:49,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:49,829 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:20:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,944 INFO L93 Difference]: Finished difference Result 548 states and 1618 transitions. [2020-02-10 20:20:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:49,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,946 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:20:49,946 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:20:49,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:20:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-02-10 20:20:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 20:20:49,955 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,955 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 20:20:49,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 20:20:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:49,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,956 INFO L415 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] [2020-02-10 20:20:49,956 INFO L427 AbstractCegarLoop]: === Iteration 1337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash 48014164, now seen corresponding path program 1331 times [2020-02-10 20:20:49,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579718327] [2020-02-10 20:20:49,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:50,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579718327] [2020-02-10 20:20:50,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:50,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:50,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279787672] [2020-02-10 20:20:50,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:50,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:50,227 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:50,306 INFO L93 Difference]: Finished difference Result 539 states and 1600 transitions. [2020-02-10 20:20:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:50,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:50,308 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:20:50,308 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:20:50,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:20:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 380. [2020-02-10 20:20:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 20:20:50,317 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:50,317 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 20:20:50,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 20:20:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:50,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:50,318 INFO L415 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] [2020-02-10 20:20:50,318 INFO L427 AbstractCegarLoop]: === Iteration 1338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1027696992, now seen corresponding path program 1332 times [2020-02-10 20:20:50,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:50,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175212104] [2020-02-10 20:20:50,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:50,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175212104] [2020-02-10 20:20:50,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:50,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:50,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46441036] [2020-02-10 20:20:50,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:50,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:50,582 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:50,694 INFO L93 Difference]: Finished difference Result 544 states and 1609 transitions. [2020-02-10 20:20:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:50,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:50,695 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:20:50,695 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:20:50,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:20:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2020-02-10 20:20:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:20:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-02-10 20:20:50,704 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-02-10 20:20:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:50,704 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-02-10 20:20:50,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-02-10 20:20:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:50,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:50,705 INFO L415 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] [2020-02-10 20:20:50,705 INFO L427 AbstractCegarLoop]: === Iteration 1339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:50,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1888094576, now seen corresponding path program 1333 times [2020-02-10 20:20:50,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:50,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270321632] [2020-02-10 20:20:50,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:50,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270321632] [2020-02-10 20:20:50,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:50,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:50,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467797860] [2020-02-10 20:20:50,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:50,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:50,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:50,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:50,978 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:20:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:51,092 INFO L93 Difference]: Finished difference Result 544 states and 1616 transitions. [2020-02-10 20:20:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:51,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:51,093 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:20:51,094 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:20:51,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:20:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2020-02-10 20:20:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 20:20:51,103 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:51,103 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 20:20:51,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 20:20:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:51,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:51,104 INFO L415 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] [2020-02-10 20:20:51,104 INFO L427 AbstractCegarLoop]: === Iteration 1340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1635001824, now seen corresponding path program 1334 times [2020-02-10 20:20:51,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:51,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361327417] [2020-02-10 20:20:51,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:51,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361327417] [2020-02-10 20:20:51,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:51,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:51,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400872726] [2020-02-10 20:20:51,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:51,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:51,379 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:51,488 INFO L93 Difference]: Finished difference Result 543 states and 1612 transitions. [2020-02-10 20:20:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:51,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:51,490 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:20:51,490 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:20:51,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:20:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 380. [2020-02-10 20:20:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-02-10 20:20:51,499 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:51,499 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-02-10 20:20:51,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-02-10 20:20:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:51,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:51,500 INFO L415 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] [2020-02-10 20:20:51,500 INFO L427 AbstractCegarLoop]: === Iteration 1341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash 725035810, now seen corresponding path program 1335 times [2020-02-10 20:20:51,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:51,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655671829] [2020-02-10 20:20:51,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:51,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655671829] [2020-02-10 20:20:51,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:51,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:51,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184999788] [2020-02-10 20:20:51,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:51,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:51,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:51,769 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:51,868 INFO L93 Difference]: Finished difference Result 549 states and 1625 transitions. [2020-02-10 20:20:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:51,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:51,869 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:20:51,869 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:20:51,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:20:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 383. [2020-02-10 20:20:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:20:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-02-10 20:20:51,879 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-02-10 20:20:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:51,879 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-02-10 20:20:51,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-02-10 20:20:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:51,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:51,880 INFO L415 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] [2020-02-10 20:20:51,880 INFO L427 AbstractCegarLoop]: === Iteration 1342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2111070940, now seen corresponding path program 1336 times [2020-02-10 20:20:51,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:51,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791155752] [2020-02-10 20:20:51,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:52,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791155752] [2020-02-10 20:20:52,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:52,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720145210] [2020-02-10 20:20:52,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:52,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:52,148 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:20:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:52,253 INFO L93 Difference]: Finished difference Result 552 states and 1628 transitions. [2020-02-10 20:20:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:52,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:52,255 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:20:52,255 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:20:52,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:20:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 20:20:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 20:20:52,264 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:52,264 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 20:20:52,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 20:20:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:52,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:52,265 INFO L415 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] [2020-02-10 20:20:52,265 INFO L427 AbstractCegarLoop]: === Iteration 1343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2119055616, now seen corresponding path program 1337 times [2020-02-10 20:20:52,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:52,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126890904] [2020-02-10 20:20:52,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:52,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126890904] [2020-02-10 20:20:52,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:52,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824501516] [2020-02-10 20:20:52,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:52,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:52,542 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:52,643 INFO L93 Difference]: Finished difference Result 546 states and 1616 transitions. [2020-02-10 20:20:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:52,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:52,645 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:20:52,645 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:20:52,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:20:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-02-10 20:20:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 20:20:52,654 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 20:20:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:52,654 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 20:20:52,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 20:20:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:52,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:52,655 INFO L415 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] [2020-02-10 20:20:52,655 INFO L427 AbstractCegarLoop]: === Iteration 1344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1201105426, now seen corresponding path program 1338 times [2020-02-10 20:20:52,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:52,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285489499] [2020-02-10 20:20:52,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:52,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285489499] [2020-02-10 20:20:52,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:52,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188449060] [2020-02-10 20:20:52,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:52,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:52,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:52,952 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:20:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,058 INFO L93 Difference]: Finished difference Result 550 states and 1622 transitions. [2020-02-10 20:20:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:53,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,060 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:20:53,060 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:20:53,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:20:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 378. [2020-02-10 20:20:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:20:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-02-10 20:20:53,069 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-02-10 20:20:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:53,072 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-02-10 20:20:53,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-02-10 20:20:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:53,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:53,073 INFO L415 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] [2020-02-10 20:20:53,073 INFO L427 AbstractCegarLoop]: === Iteration 1345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1286951934, now seen corresponding path program 1339 times [2020-02-10 20:20:53,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:53,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956493624] [2020-02-10 20:20:53,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:53,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956493624] [2020-02-10 20:20:53,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:53,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:53,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935959222] [2020-02-10 20:20:53,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:53,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:53,356 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:20:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,445 INFO L93 Difference]: Finished difference Result 533 states and 1587 transitions. [2020-02-10 20:20:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:53,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,447 INFO L225 Difference]: With dead ends: 533 [2020-02-10 20:20:53,447 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 20:20:53,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 20:20:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 380. [2020-02-10 20:20:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 20:20:53,456 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:53,457 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 20:20:53,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 20:20:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:53,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:53,458 INFO L415 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] [2020-02-10 20:20:53,458 INFO L427 AbstractCegarLoop]: === Iteration 1346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:53,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:53,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1397074404, now seen corresponding path program 1340 times [2020-02-10 20:20:53,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:53,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560032114] [2020-02-10 20:20:53,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:53,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560032114] [2020-02-10 20:20:53,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:53,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:53,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71029951] [2020-02-10 20:20:53,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:53,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:53,742 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,841 INFO L93 Difference]: Finished difference Result 534 states and 1588 transitions. [2020-02-10 20:20:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:53,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,843 INFO L225 Difference]: With dead ends: 534 [2020-02-10 20:20:53,843 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 20:20:53,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 20:20:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2020-02-10 20:20:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 20:20:53,852 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 20:20:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:53,852 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 20:20:53,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 20:20:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:53,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:53,852 INFO L415 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] [2020-02-10 20:20:53,853 INFO L427 AbstractCegarLoop]: === Iteration 1347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:53,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:53,853 INFO L82 PathProgramCache]: Analyzing trace with hash -394884976, now seen corresponding path program 1341 times [2020-02-10 20:20:53,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:53,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411388299] [2020-02-10 20:20:53,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:54,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411388299] [2020-02-10 20:20:54,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:54,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:54,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250881682] [2020-02-10 20:20:54,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:54,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:54,117 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:20:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:54,193 INFO L93 Difference]: Finished difference Result 537 states and 1594 transitions. [2020-02-10 20:20:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:54,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:54,194 INFO L225 Difference]: With dead ends: 537 [2020-02-10 20:20:54,194 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:20:54,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:20:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 380. [2020-02-10 20:20:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:20:54,203 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:54,203 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:20:54,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:20:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:54,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:54,204 INFO L415 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] [2020-02-10 20:20:54,204 INFO L427 AbstractCegarLoop]: === Iteration 1348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1470596132, now seen corresponding path program 1342 times [2020-02-10 20:20:54,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:54,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669143784] [2020-02-10 20:20:54,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:54,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669143784] [2020-02-10 20:20:54,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:54,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:54,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284684387] [2020-02-10 20:20:54,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:54,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:54,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:54,465 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:54,564 INFO L93 Difference]: Finished difference Result 542 states and 1603 transitions. [2020-02-10 20:20:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:54,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:54,566 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:20:54,566 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 20:20:54,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 20:20:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 379. [2020-02-10 20:20:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 20:20:54,575 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 20:20:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:54,575 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 20:20:54,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 20:20:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:54,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:54,576 INFO L415 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] [2020-02-10 20:20:54,576 INFO L427 AbstractCegarLoop]: === Iteration 1349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -384381872, now seen corresponding path program 1343 times [2020-02-10 20:20:54,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:54,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674795728] [2020-02-10 20:20:54,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:54,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674795728] [2020-02-10 20:20:54,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:54,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:54,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006203844] [2020-02-10 20:20:54,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:54,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:54,857 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:20:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:54,955 INFO L93 Difference]: Finished difference Result 540 states and 1600 transitions. [2020-02-10 20:20:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:54,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:54,956 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:20:54,956 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:20:54,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:20:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 381. [2020-02-10 20:20:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 20:20:54,965 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:54,965 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 20:20:54,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 20:20:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:54,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:54,965 INFO L415 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] [2020-02-10 20:20:54,966 INFO L427 AbstractCegarLoop]: === Iteration 1350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:54,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1223933310, now seen corresponding path program 1344 times [2020-02-10 20:20:54,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:54,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440346598] [2020-02-10 20:20:54,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:55,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440346598] [2020-02-10 20:20:55,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:55,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:55,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158826876] [2020-02-10 20:20:55,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:55,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:55,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:55,232 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:55,336 INFO L93 Difference]: Finished difference Result 544 states and 1606 transitions. [2020-02-10 20:20:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:55,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:55,337 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:20:55,337 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:20:55,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:20:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 377. [2020-02-10 20:20:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:20:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-02-10 20:20:55,346 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-02-10 20:20:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:55,346 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-02-10 20:20:55,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-02-10 20:20:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:55,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:55,347 INFO L415 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] [2020-02-10 20:20:55,347 INFO L427 AbstractCegarLoop]: === Iteration 1351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2038839868, now seen corresponding path program 1345 times [2020-02-10 20:20:55,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:55,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407094241] [2020-02-10 20:20:55,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:55,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407094241] [2020-02-10 20:20:55,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:55,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:55,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229089410] [2020-02-10 20:20:55,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:55,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:55,637 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:20:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:55,737 INFO L93 Difference]: Finished difference Result 530 states and 1582 transitions. [2020-02-10 20:20:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:55,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:55,739 INFO L225 Difference]: With dead ends: 530 [2020-02-10 20:20:55,739 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 20:20:55,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 20:20:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 380. [2020-02-10 20:20:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-02-10 20:20:55,748 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-02-10 20:20:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:55,749 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-02-10 20:20:55,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-02-10 20:20:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:55,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:55,749 INFO L415 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] [2020-02-10 20:20:55,749 INFO L427 AbstractCegarLoop]: === Iteration 1352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash 810610418, now seen corresponding path program 1346 times [2020-02-10 20:20:55,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:55,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88622020] [2020-02-10 20:20:55,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88622020] [2020-02-10 20:20:56,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:56,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344347628] [2020-02-10 20:20:56,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:56,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:56,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:56,036 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:20:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:56,141 INFO L93 Difference]: Finished difference Result 528 states and 1577 transitions. [2020-02-10 20:20:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:56,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:56,143 INFO L225 Difference]: With dead ends: 528 [2020-02-10 20:20:56,143 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 20:20:56,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 20:20:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 379. [2020-02-10 20:20:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 20:20:56,151 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:56,152 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 20:20:56,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 20:20:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:56,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:56,152 INFO L415 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] [2020-02-10 20:20:56,152 INFO L427 AbstractCegarLoop]: === Iteration 1353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash 655689574, now seen corresponding path program 1347 times [2020-02-10 20:20:56,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:56,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547231540] [2020-02-10 20:20:56,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547231540] [2020-02-10 20:20:56,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:56,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846160319] [2020-02-10 20:20:56,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:56,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:56,442 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:56,558 INFO L93 Difference]: Finished difference Result 532 states and 1586 transitions. [2020-02-10 20:20:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:56,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:56,560 INFO L225 Difference]: With dead ends: 532 [2020-02-10 20:20:56,560 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:20:56,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:20:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 381. [2020-02-10 20:20:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:20:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1305 transitions. [2020-02-10 20:20:56,568 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1305 transitions. Word has length 22 [2020-02-10 20:20:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:56,568 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1305 transitions. [2020-02-10 20:20:56,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1305 transitions. [2020-02-10 20:20:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:56,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:56,569 INFO L415 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] [2020-02-10 20:20:56,569 INFO L427 AbstractCegarLoop]: === Iteration 1354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 908782326, now seen corresponding path program 1348 times [2020-02-10 20:20:56,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:56,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099235909] [2020-02-10 20:20:56,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099235909] [2020-02-10 20:20:56,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:56,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383750255] [2020-02-10 20:20:56,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:56,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:56,856 INFO L87 Difference]: Start difference. First operand 381 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:20:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:56,972 INFO L93 Difference]: Finished difference Result 531 states and 1582 transitions. [2020-02-10 20:20:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:56,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:56,973 INFO L225 Difference]: With dead ends: 531 [2020-02-10 20:20:56,973 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 20:20:56,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 20:20:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-02-10 20:20:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 20:20:56,982 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:56,982 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 20:20:56,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 20:20:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:56,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:56,983 INFO L415 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] [2020-02-10 20:20:56,983 INFO L427 AbstractCegarLoop]: === Iteration 1355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1904702006, now seen corresponding path program 1349 times [2020-02-10 20:20:56,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:56,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014661157] [2020-02-10 20:20:56,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:57,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014661157] [2020-02-10 20:20:57,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:57,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299527295] [2020-02-10 20:20:57,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:57,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:57,276 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:57,356 INFO L93 Difference]: Finished difference Result 527 states and 1574 transitions. [2020-02-10 20:20:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:57,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:57,357 INFO L225 Difference]: With dead ends: 527 [2020-02-10 20:20:57,358 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 20:20:57,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 20:20:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2020-02-10 20:20:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 20:20:57,367 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 20:20:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:57,367 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 20:20:57,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 20:20:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:57,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:57,368 INFO L415 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] [2020-02-10 20:20:57,368 INFO L427 AbstractCegarLoop]: === Iteration 1356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash -779324332, now seen corresponding path program 1350 times [2020-02-10 20:20:57,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:57,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733602869] [2020-02-10 20:20:57,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:57,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733602869] [2020-02-10 20:20:57,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:57,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:57,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882039026] [2020-02-10 20:20:57,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:57,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:57,654 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:20:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:57,781 INFO L93 Difference]: Finished difference Result 528 states and 1575 transitions. [2020-02-10 20:20:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:57,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:57,782 INFO L225 Difference]: With dead ends: 528 [2020-02-10 20:20:57,782 INFO L226 Difference]: Without dead ends: 516 [2020-02-10 20:20:57,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-02-10 20:20:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 378. [2020-02-10 20:20:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:20:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-02-10 20:20:57,791 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-02-10 20:20:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:57,791 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-02-10 20:20:57,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-02-10 20:20:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:57,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:57,792 INFO L415 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] [2020-02-10 20:20:57,792 INFO L427 AbstractCegarLoop]: === Iteration 1357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash -710142448, now seen corresponding path program 1351 times [2020-02-10 20:20:57,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:57,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690905249] [2020-02-10 20:20:57,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:58,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690905249] [2020-02-10 20:20:58,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:58,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:58,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841631688] [2020-02-10 20:20:58,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:58,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:58,082 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:20:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,196 INFO L93 Difference]: Finished difference Result 532 states and 1586 transitions. [2020-02-10 20:20:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:58,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,197 INFO L225 Difference]: With dead ends: 532 [2020-02-10 20:20:58,198 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:20:58,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:20:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-02-10 20:20:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 20:20:58,206 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 20:20:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,206 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 20:20:58,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 20:20:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:58,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,207 INFO L415 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] [2020-02-10 20:20:58,207 INFO L427 AbstractCegarLoop]: === Iteration 1358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2139307838, now seen corresponding path program 1352 times [2020-02-10 20:20:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605640196] [2020-02-10 20:20:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:58,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605640196] [2020-02-10 20:20:58,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:58,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:58,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875122380] [2020-02-10 20:20:58,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:58,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:58,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:58,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:58,490 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:20:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,577 INFO L93 Difference]: Finished difference Result 530 states and 1581 transitions. [2020-02-10 20:20:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:58,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,578 INFO L225 Difference]: With dead ends: 530 [2020-02-10 20:20:58,579 INFO L226 Difference]: Without dead ends: 520 [2020-02-10 20:20:58,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-02-10 20:20:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 379. [2020-02-10 20:20:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 20:20:58,587 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,587 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 20:20:58,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 20:20:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:58,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,588 INFO L415 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] [2020-02-10 20:20:58,588 INFO L427 AbstractCegarLoop]: === Iteration 1359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1297887770, now seen corresponding path program 1353 times [2020-02-10 20:20:58,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167202022] [2020-02-10 20:20:58,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:58,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167202022] [2020-02-10 20:20:58,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:58,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:58,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33593149] [2020-02-10 20:20:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:58,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:58,864 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:20:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,980 INFO L93 Difference]: Finished difference Result 534 states and 1592 transitions. [2020-02-10 20:20:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:58,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,981 INFO L225 Difference]: With dead ends: 534 [2020-02-10 20:20:58,981 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 20:20:58,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 20:20:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 382. [2020-02-10 20:20:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:20:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 20:20:58,990 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 20:20:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,990 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 20:20:58,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 20:20:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:58,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,991 INFO L415 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] [2020-02-10 20:20:58,991 INFO L427 AbstractCegarLoop]: === Iteration 1360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -995869826, now seen corresponding path program 1354 times [2020-02-10 20:20:58,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238561843] [2020-02-10 20:20:58,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:59,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238561843] [2020-02-10 20:20:59,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:59,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:59,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102771592] [2020-02-10 20:20:59,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:59,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:59,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:59,266 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:20:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:59,375 INFO L93 Difference]: Finished difference Result 526 states and 1583 transitions. [2020-02-10 20:20:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:59,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:59,377 INFO L225 Difference]: With dead ends: 526 [2020-02-10 20:20:59,377 INFO L226 Difference]: Without dead ends: 511 [2020-02-10 20:20:59,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-02-10 20:20:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 379. [2020-02-10 20:20:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:20:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 20:20:59,385 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 20:20:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:59,385 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 20:20:59,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 20:20:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:59,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:59,386 INFO L415 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] [2020-02-10 20:20:59,386 INFO L427 AbstractCegarLoop]: === Iteration 1361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash -48875338, now seen corresponding path program 1355 times [2020-02-10 20:20:59,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:59,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316176484] [2020-02-10 20:20:59,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:59,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316176484] [2020-02-10 20:20:59,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:59,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:20:59,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405941428] [2020-02-10 20:20:59,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:20:59,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:59,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:20:59,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:20:59,666 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:20:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:59,761 INFO L93 Difference]: Finished difference Result 530 states and 1581 transitions. [2020-02-10 20:20:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:20:59,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:20:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:59,763 INFO L225 Difference]: With dead ends: 530 [2020-02-10 20:20:59,763 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:20:59,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:20:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-02-10 20:20:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:20:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:20:59,772 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:20:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:59,772 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:20:59,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:20:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:20:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:20:59,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:59,773 INFO L415 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] [2020-02-10 20:20:59,773 INFO L427 AbstractCegarLoop]: === Iteration 1362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash 486354464, now seen corresponding path program 1356 times [2020-02-10 20:20:59,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:59,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689258585] [2020-02-10 20:20:59,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:00,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689258585] [2020-02-10 20:21:00,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:00,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:00,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98408155] [2020-02-10 20:21:00,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:00,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:00,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:00,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:00,053 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:00,161 INFO L93 Difference]: Finished difference Result 524 states and 1578 transitions. [2020-02-10 20:21:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:00,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:00,163 INFO L225 Difference]: With dead ends: 524 [2020-02-10 20:21:00,163 INFO L226 Difference]: Without dead ends: 510 [2020-02-10 20:21:00,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-02-10 20:21:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 378. [2020-02-10 20:21:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-02-10 20:21:00,173 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:00,173 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-02-10 20:21:00,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-02-10 20:21:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:00,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:00,174 INFO L415 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] [2020-02-10 20:21:00,174 INFO L427 AbstractCegarLoop]: === Iteration 1363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -384546224, now seen corresponding path program 1357 times [2020-02-10 20:21:00,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:00,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124901201] [2020-02-10 20:21:00,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:00,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124901201] [2020-02-10 20:21:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:00,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:00,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279049431] [2020-02-10 20:21:00,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:00,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:00,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:00,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:00,457 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:00,574 INFO L93 Difference]: Finished difference Result 537 states and 1599 transitions. [2020-02-10 20:21:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:00,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:00,575 INFO L225 Difference]: With dead ends: 537 [2020-02-10 20:21:00,575 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:21:00,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:21:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 382. [2020-02-10 20:21:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 20:21:00,584 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 20:21:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:00,584 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 20:21:00,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 20:21:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:00,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:00,585 INFO L415 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] [2020-02-10 20:21:00,585 INFO L427 AbstractCegarLoop]: === Iteration 1364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -131453472, now seen corresponding path program 1358 times [2020-02-10 20:21:00,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:00,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748001247] [2020-02-10 20:21:00,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748001247] [2020-02-10 20:21:00,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:00,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:00,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869516002] [2020-02-10 20:21:00,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:00,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:00,865 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:21:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:00,983 INFO L93 Difference]: Finished difference Result 536 states and 1595 transitions. [2020-02-10 20:21:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:00,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:00,985 INFO L225 Difference]: With dead ends: 536 [2020-02-10 20:21:00,985 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 20:21:00,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 20:21:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 380. [2020-02-10 20:21:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 20:21:00,994 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 20:21:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:00,994 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 20:21:00,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 20:21:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:00,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:00,994 INFO L415 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] [2020-02-10 20:21:00,995 INFO L427 AbstractCegarLoop]: === Iteration 1365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:00,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash 628146308, now seen corresponding path program 1359 times [2020-02-10 20:21:00,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:00,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374683652] [2020-02-10 20:21:00,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:01,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374683652] [2020-02-10 20:21:01,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:01,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:01,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752569338] [2020-02-10 20:21:01,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:01,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:01,275 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:21:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:01,403 INFO L93 Difference]: Finished difference Result 537 states and 1599 transitions. [2020-02-10 20:21:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:01,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:01,405 INFO L225 Difference]: With dead ends: 537 [2020-02-10 20:21:01,405 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:21:01,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:21:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 383. [2020-02-10 20:21:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1308 transitions. [2020-02-10 20:21:01,414 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1308 transitions. Word has length 22 [2020-02-10 20:21:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:01,414 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1308 transitions. [2020-02-10 20:21:01,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1308 transitions. [2020-02-10 20:21:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:01,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:01,415 INFO L415 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] [2020-02-10 20:21:01,415 INFO L427 AbstractCegarLoop]: === Iteration 1366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash 930164252, now seen corresponding path program 1360 times [2020-02-10 20:21:01,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:01,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346676594] [2020-02-10 20:21:01,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:01,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346676594] [2020-02-10 20:21:01,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:01,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:01,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560541049] [2020-02-10 20:21:01,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:01,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:01,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:01,707 INFO L87 Difference]: Start difference. First operand 383 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:21:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:01,819 INFO L93 Difference]: Finished difference Result 529 states and 1590 transitions. [2020-02-10 20:21:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:01,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:01,820 INFO L225 Difference]: With dead ends: 529 [2020-02-10 20:21:01,820 INFO L226 Difference]: Without dead ends: 514 [2020-02-10 20:21:01,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-02-10 20:21:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 380. [2020-02-10 20:21:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:21:01,829 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:01,829 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:21:01,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:21:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:01,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:01,830 INFO L415 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] [2020-02-10 20:21:01,830 INFO L427 AbstractCegarLoop]: === Iteration 1367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash -661860224, now seen corresponding path program 1361 times [2020-02-10 20:21:01,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:01,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159695082] [2020-02-10 20:21:01,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159695082] [2020-02-10 20:21:02,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:02,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482720699] [2020-02-10 20:21:02,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:02,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:02,104 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:02,215 INFO L93 Difference]: Finished difference Result 535 states and 1592 transitions. [2020-02-10 20:21:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:02,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:02,217 INFO L225 Difference]: With dead ends: 535 [2020-02-10 20:21:02,217 INFO L226 Difference]: Without dead ends: 525 [2020-02-10 20:21:02,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-02-10 20:21:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 382. [2020-02-10 20:21:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 20:21:02,226 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:02,226 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 20:21:02,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 20:21:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:02,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:02,227 INFO L415 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] [2020-02-10 20:21:02,227 INFO L427 AbstractCegarLoop]: === Iteration 1368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -835107916, now seen corresponding path program 1362 times [2020-02-10 20:21:02,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:02,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884976898] [2020-02-10 20:21:02,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:02,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884976898] [2020-02-10 20:21:02,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:02,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318361912] [2020-02-10 20:21:02,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:02,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:02,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:02,497 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:02,630 INFO L93 Difference]: Finished difference Result 528 states and 1586 transitions. [2020-02-10 20:21:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:02,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:02,631 INFO L225 Difference]: With dead ends: 528 [2020-02-10 20:21:02,631 INFO L226 Difference]: Without dead ends: 512 [2020-02-10 20:21:02,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-02-10 20:21:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2020-02-10 20:21:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-02-10 20:21:02,639 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:02,640 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-02-10 20:21:02,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-02-10 20:21:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:02,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:02,640 INFO L415 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] [2020-02-10 20:21:02,640 INFO L427 AbstractCegarLoop]: === Iteration 1369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1504467010, now seen corresponding path program 1363 times [2020-02-10 20:21:02,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:02,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823300056] [2020-02-10 20:21:02,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:02,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823300056] [2020-02-10 20:21:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753206448] [2020-02-10 20:21:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:02,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:02,932 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,027 INFO L93 Difference]: Finished difference Result 527 states and 1573 transitions. [2020-02-10 20:21:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:03,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,029 INFO L225 Difference]: With dead ends: 527 [2020-02-10 20:21:03,029 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 20:21:03,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 20:21:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2020-02-10 20:21:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:21:03,038 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:03,038 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:21:03,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:21:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:03,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:03,039 INFO L415 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] [2020-02-10 20:21:03,039 INFO L427 AbstractCegarLoop]: === Iteration 1370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:03,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash 106473948, now seen corresponding path program 1364 times [2020-02-10 20:21:03,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:03,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926554593] [2020-02-10 20:21:03,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926554593] [2020-02-10 20:21:03,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:03,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:03,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717563593] [2020-02-10 20:21:03,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:03,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:03,329 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,447 INFO L93 Difference]: Finished difference Result 528 states and 1574 transitions. [2020-02-10 20:21:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:03,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,448 INFO L225 Difference]: With dead ends: 528 [2020-02-10 20:21:03,448 INFO L226 Difference]: Without dead ends: 517 [2020-02-10 20:21:03,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-02-10 20:21:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 379. [2020-02-10 20:21:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 20:21:03,457 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:03,457 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 20:21:03,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 20:21:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:03,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:03,457 INFO L415 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] [2020-02-10 20:21:03,458 INFO L427 AbstractCegarLoop]: === Iteration 1371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:03,458 INFO L82 PathProgramCache]: Analyzing trace with hash -491774478, now seen corresponding path program 1365 times [2020-02-10 20:21:03,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:03,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905221444] [2020-02-10 20:21:03,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:03,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905221444] [2020-02-10 20:21:03,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:03,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:03,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209126871] [2020-02-10 20:21:03,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:03,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:03,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:03,736 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,823 INFO L93 Difference]: Finished difference Result 528 states and 1575 transitions. [2020-02-10 20:21:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:03,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,824 INFO L225 Difference]: With dead ends: 528 [2020-02-10 20:21:03,824 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 20:21:03,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 20:21:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 380. [2020-02-10 20:21:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 20:21:03,834 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:03,834 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 20:21:03,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 20:21:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:03,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:03,835 INFO L415 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] [2020-02-10 20:21:03,835 INFO L427 AbstractCegarLoop]: === Iteration 1372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 43455324, now seen corresponding path program 1366 times [2020-02-10 20:21:03,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:03,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545375339] [2020-02-10 20:21:03,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:04,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545375339] [2020-02-10 20:21:04,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:04,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:04,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341108075] [2020-02-10 20:21:04,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:04,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:04,106 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:04,222 INFO L93 Difference]: Finished difference Result 522 states and 1572 transitions. [2020-02-10 20:21:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:04,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:04,224 INFO L225 Difference]: With dead ends: 522 [2020-02-10 20:21:04,224 INFO L226 Difference]: Without dead ends: 509 [2020-02-10 20:21:04,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-02-10 20:21:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 379. [2020-02-10 20:21:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:21:04,233 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:04,233 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:21:04,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:21:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:04,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:04,233 INFO L415 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] [2020-02-10 20:21:04,234 INFO L427 AbstractCegarLoop]: === Iteration 1373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:04,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash -481271374, now seen corresponding path program 1367 times [2020-02-10 20:21:04,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:04,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383493077] [2020-02-10 20:21:04,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:04,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383493077] [2020-02-10 20:21:04,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:04,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624664937] [2020-02-10 20:21:04,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:04,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:04,511 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:04,638 INFO L93 Difference]: Finished difference Result 530 states and 1579 transitions. [2020-02-10 20:21:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:04,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:04,640 INFO L225 Difference]: With dead ends: 530 [2020-02-10 20:21:04,640 INFO L226 Difference]: Without dead ends: 520 [2020-02-10 20:21:04,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-02-10 20:21:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 381. [2020-02-10 20:21:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-02-10 20:21:04,649 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:04,649 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-02-10 20:21:04,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-02-10 20:21:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:04,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:04,650 INFO L415 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] [2020-02-10 20:21:04,650 INFO L427 AbstractCegarLoop]: === Iteration 1374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1556982530, now seen corresponding path program 1368 times [2020-02-10 20:21:04,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:04,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84292826] [2020-02-10 20:21:04,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:04,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84292826] [2020-02-10 20:21:04,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:04,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:04,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631394631] [2020-02-10 20:21:04,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:04,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:04,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:04,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:04,921 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:05,027 INFO L93 Difference]: Finished difference Result 523 states and 1573 transitions. [2020-02-10 20:21:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:05,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:05,029 INFO L225 Difference]: With dead ends: 523 [2020-02-10 20:21:05,029 INFO L226 Difference]: Without dead ends: 507 [2020-02-10 20:21:05,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2020-02-10 20:21:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 377. [2020-02-10 20:21:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1295 transitions. [2020-02-10 20:21:05,037 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1295 transitions. Word has length 22 [2020-02-10 20:21:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:05,038 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1295 transitions. [2020-02-10 20:21:05,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1295 transitions. [2020-02-10 20:21:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:05,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:05,038 INFO L415 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] [2020-02-10 20:21:05,038 INFO L427 AbstractCegarLoop]: === Iteration 1375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 321223556, now seen corresponding path program 1369 times [2020-02-10 20:21:05,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:05,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907509983] [2020-02-10 20:21:05,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:05,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907509983] [2020-02-10 20:21:05,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:05,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:05,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793816674] [2020-02-10 20:21:05,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:05,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:05,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:05,310 INFO L87 Difference]: Start difference. First operand 377 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:21:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:05,426 INFO L93 Difference]: Finished difference Result 543 states and 1613 transitions. [2020-02-10 20:21:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:05,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:05,428 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:21:05,428 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:21:05,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:21:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2020-02-10 20:21:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 20:21:05,437 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 20:21:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:05,438 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 20:21:05,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 20:21:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:05,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:05,438 INFO L415 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] [2020-02-10 20:21:05,438 INFO L427 AbstractCegarLoop]: === Iteration 1376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1124293454, now seen corresponding path program 1370 times [2020-02-10 20:21:05,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:05,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958951190] [2020-02-10 20:21:05,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:05,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958951190] [2020-02-10 20:21:05,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:05,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:05,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409483292] [2020-02-10 20:21:05,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:05,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:05,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:05,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:05,704 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:21:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:05,805 INFO L93 Difference]: Finished difference Result 541 states and 1608 transitions. [2020-02-10 20:21:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:05,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:05,807 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:21:05,807 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:21:05,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:21:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-02-10 20:21:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 20:21:05,816 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:05,817 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 20:21:05,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 20:21:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:05,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:05,817 INFO L415 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] [2020-02-10 20:21:05,817 INFO L427 AbstractCegarLoop]: === Iteration 1377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1333916088, now seen corresponding path program 1371 times [2020-02-10 20:21:05,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:05,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954162100] [2020-02-10 20:21:05,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:06,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954162100] [2020-02-10 20:21:06,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:06,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:06,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754108827] [2020-02-10 20:21:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:06,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:06,072 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:06,191 INFO L93 Difference]: Finished difference Result 550 states and 1628 transitions. [2020-02-10 20:21:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:06,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:06,193 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:21:06,193 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:21:06,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:21:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 382. [2020-02-10 20:21:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 20:21:06,202 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 20:21:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:06,202 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 20:21:06,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 20:21:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:06,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:06,202 INFO L415 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] [2020-02-10 20:21:06,203 INFO L427 AbstractCegarLoop]: === Iteration 1378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1575016078, now seen corresponding path program 1372 times [2020-02-10 20:21:06,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:06,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848313518] [2020-02-10 20:21:06,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:06,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848313518] [2020-02-10 20:21:06,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:06,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:06,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617527860] [2020-02-10 20:21:06,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:06,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:06,455 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:21:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:06,579 INFO L93 Difference]: Finished difference Result 553 states and 1631 transitions. [2020-02-10 20:21:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:06,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:06,581 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:21:06,581 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:21:06,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:21:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 379. [2020-02-10 20:21:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 20:21:06,589 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:06,590 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 20:21:06,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 20:21:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:06,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:06,590 INFO L415 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] [2020-02-10 20:21:06,590 INFO L427 AbstractCegarLoop]: === Iteration 1379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1712038776, now seen corresponding path program 1373 times [2020-02-10 20:21:06,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:06,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032411404] [2020-02-10 20:21:06,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:06,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032411404] [2020-02-10 20:21:06,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:06,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:06,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48108443] [2020-02-10 20:21:06,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:06,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:06,845 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:06,928 INFO L93 Difference]: Finished difference Result 544 states and 1613 transitions. [2020-02-10 20:21:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:06,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:06,930 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:21:06,930 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:21:06,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:21:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 20:21:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:21:06,944 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:06,944 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:21:06,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:21:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:06,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:06,945 INFO L415 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] [2020-02-10 20:21:06,945 INFO L427 AbstractCegarLoop]: === Iteration 1380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1507217364, now seen corresponding path program 1374 times [2020-02-10 20:21:06,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:06,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630695267] [2020-02-10 20:21:06,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630695267] [2020-02-10 20:21:07,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:07,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140267036] [2020-02-10 20:21:07,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:07,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:07,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:07,194 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:07,294 INFO L93 Difference]: Finished difference Result 549 states and 1622 transitions. [2020-02-10 20:21:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:07,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:07,295 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:21:07,296 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:21:07,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:21:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 378. [2020-02-10 20:21:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-02-10 20:21:07,305 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:07,305 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-02-10 20:21:07,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-02-10 20:21:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:07,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:07,306 INFO L415 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] [2020-02-10 20:21:07,306 INFO L427 AbstractCegarLoop]: === Iteration 1381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:07,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:07,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2047709662, now seen corresponding path program 1375 times [2020-02-10 20:21:07,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:07,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971974018] [2020-02-10 20:21:07,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971974018] [2020-02-10 20:21:07,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:07,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158386242] [2020-02-10 20:21:07,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:07,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:07,570 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:07,685 INFO L93 Difference]: Finished difference Result 540 states and 1606 transitions. [2020-02-10 20:21:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:07,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:07,687 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:21:07,687 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:07,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 20:21:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 20:21:07,696 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:07,696 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 20:21:07,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 20:21:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:07,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:07,697 INFO L415 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] [2020-02-10 20:21:07,697 INFO L427 AbstractCegarLoop]: === Iteration 1382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash 801740624, now seen corresponding path program 1376 times [2020-02-10 20:21:07,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:07,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17272414] [2020-02-10 20:21:07,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17272414] [2020-02-10 20:21:07,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:07,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489461064] [2020-02-10 20:21:07,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:07,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:07,962 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,065 INFO L93 Difference]: Finished difference Result 538 states and 1601 transitions. [2020-02-10 20:21:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:08,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,067 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:21:08,067 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:21:08,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:21:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-02-10 20:21:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 20:21:08,076 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,077 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 20:21:08,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 20:21:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:08,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,077 INFO L415 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] [2020-02-10 20:21:08,077 INFO L427 AbstractCegarLoop]: === Iteration 1383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1659512312, now seen corresponding path program 1377 times [2020-02-10 20:21:08,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478296381] [2020-02-10 20:21:08,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:08,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478296381] [2020-02-10 20:21:08,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:08,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508922914] [2020-02-10 20:21:08,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:08,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:08,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:08,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:08,338 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,441 INFO L93 Difference]: Finished difference Result 542 states and 1612 transitions. [2020-02-10 20:21:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:08,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,443 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:21:08,443 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:21:08,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:21:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2020-02-10 20:21:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 20:21:08,451 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 20:21:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,451 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 20:21:08,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 20:21:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:08,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,452 INFO L415 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] [2020-02-10 20:21:08,452 INFO L427 AbstractCegarLoop]: === Iteration 1384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1961530256, now seen corresponding path program 1378 times [2020-02-10 20:21:08,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270738302] [2020-02-10 20:21:08,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:08,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270738302] [2020-02-10 20:21:08,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:08,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:08,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908089109] [2020-02-10 20:21:08,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:08,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:08,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:08,712 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:21:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,846 INFO L93 Difference]: Finished difference Result 534 states and 1603 transitions. [2020-02-10 20:21:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:08,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,847 INFO L225 Difference]: With dead ends: 534 [2020-02-10 20:21:08,847 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 20:21:08,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 20:21:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-02-10 20:21:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 20:21:08,855 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,855 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 20:21:08,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 20:21:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:08,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,856 INFO L415 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] [2020-02-10 20:21:08,856 INFO L427 AbstractCegarLoop]: === Iteration 1385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1386442552, now seen corresponding path program 1379 times [2020-02-10 20:21:08,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541775722] [2020-02-10 20:21:08,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:09,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541775722] [2020-02-10 20:21:09,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:09,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:09,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409333100] [2020-02-10 20:21:09,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:09,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:09,115 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:09,210 INFO L93 Difference]: Finished difference Result 538 states and 1601 transitions. [2020-02-10 20:21:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:09,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:09,212 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:21:09,212 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:09,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 20:21:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 20:21:09,220 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:09,221 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 20:21:09,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 20:21:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:09,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:09,221 INFO L415 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] [2020-02-10 20:21:09,221 INFO L427 AbstractCegarLoop]: === Iteration 1386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -851212750, now seen corresponding path program 1380 times [2020-02-10 20:21:09,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:09,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243910444] [2020-02-10 20:21:09,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:09,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243910444] [2020-02-10 20:21:09,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:09,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344499172] [2020-02-10 20:21:09,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:09,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:09,473 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:09,599 INFO L93 Difference]: Finished difference Result 532 states and 1598 transitions. [2020-02-10 20:21:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:09,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:09,601 INFO L225 Difference]: With dead ends: 532 [2020-02-10 20:21:09,601 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 20:21:09,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 20:21:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2020-02-10 20:21:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-02-10 20:21:09,610 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:09,611 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-02-10 20:21:09,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-02-10 20:21:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:09,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:09,611 INFO L415 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] [2020-02-10 20:21:09,611 INFO L427 AbstractCegarLoop]: === Iteration 1387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:09,612 INFO L82 PathProgramCache]: Analyzing trace with hash 293680290, now seen corresponding path program 1381 times [2020-02-10 20:21:09,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:09,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481217185] [2020-02-10 20:21:09,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:09,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481217185] [2020-02-10 20:21:09,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:09,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:09,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987787027] [2020-02-10 20:21:09,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:09,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:09,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:09,868 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:09,984 INFO L93 Difference]: Finished difference Result 557 states and 1648 transitions. [2020-02-10 20:21:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:09,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:09,986 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:21:09,986 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:21:09,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:21:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 384. [2020-02-10 20:21:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 20:21:09,994 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 20:21:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:09,994 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 20:21:09,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 20:21:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:09,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:09,995 INFO L415 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] [2020-02-10 20:21:09,995 INFO L427 AbstractCegarLoop]: === Iteration 1388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1679715420, now seen corresponding path program 1382 times [2020-02-10 20:21:09,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:09,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137367463] [2020-02-10 20:21:09,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:10,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137367463] [2020-02-10 20:21:10,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:10,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:10,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516850526] [2020-02-10 20:21:10,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:10,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:10,246 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:21:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:10,358 INFO L93 Difference]: Finished difference Result 560 states and 1651 transitions. [2020-02-10 20:21:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:10,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:10,360 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:21:10,360 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:21:10,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:21:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-02-10 20:21:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1305 transitions. [2020-02-10 20:21:10,369 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1305 transitions. Word has length 22 [2020-02-10 20:21:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:10,370 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1305 transitions. [2020-02-10 20:21:10,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1305 transitions. [2020-02-10 20:21:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:10,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:10,370 INFO L415 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] [2020-02-10 20:21:10,370 INFO L427 AbstractCegarLoop]: === Iteration 1389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1306757564, now seen corresponding path program 1383 times [2020-02-10 20:21:10,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:10,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575952418] [2020-02-10 20:21:10,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:10,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575952418] [2020-02-10 20:21:10,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:10,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:10,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043270436] [2020-02-10 20:21:10,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:10,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:10,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:10,626 INFO L87 Difference]: Start difference. First operand 381 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:21:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:10,758 INFO L93 Difference]: Finished difference Result 552 states and 1636 transitions. [2020-02-10 20:21:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:10,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:10,759 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:21:10,759 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:21:10,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:21:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 384. [2020-02-10 20:21:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1310 transitions. [2020-02-10 20:21:10,768 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1310 transitions. Word has length 22 [2020-02-10 20:21:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:10,768 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1310 transitions. [2020-02-10 20:21:10,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1310 transitions. [2020-02-10 20:21:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:10,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:10,769 INFO L415 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] [2020-02-10 20:21:10,769 INFO L427 AbstractCegarLoop]: === Iteration 1390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1004739620, now seen corresponding path program 1384 times [2020-02-10 20:21:10,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:10,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497852282] [2020-02-10 20:21:10,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:11,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497852282] [2020-02-10 20:21:11,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:11,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:11,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571176812] [2020-02-10 20:21:11,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:11,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:11,023 INFO L87 Difference]: Start difference. First operand 384 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:21:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,143 INFO L93 Difference]: Finished difference Result 544 states and 1627 transitions. [2020-02-10 20:21:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:11,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,144 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:21:11,144 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:11,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-02-10 20:21:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 20:21:11,154 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,154 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 20:21:11,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 20:21:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:11,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,154 INFO L415 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] [2020-02-10 20:21:11,155 INFO L427 AbstractCegarLoop]: === Iteration 1391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1842630204, now seen corresponding path program 1385 times [2020-02-10 20:21:11,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641089363] [2020-02-10 20:21:11,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:11,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641089363] [2020-02-10 20:21:11,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:11,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:11,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790416063] [2020-02-10 20:21:11,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:11,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:11,406 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,509 INFO L93 Difference]: Finished difference Result 556 states and 1642 transitions. [2020-02-10 20:21:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:11,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,511 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:21:11,511 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:21:11,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:21:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 385. [2020-02-10 20:21:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:21:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1309 transitions. [2020-02-10 20:21:11,521 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1309 transitions. Word has length 22 [2020-02-10 20:21:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,521 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1309 transitions. [2020-02-10 20:21:11,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1309 transitions. [2020-02-10 20:21:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:11,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,521 INFO L415 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] [2020-02-10 20:21:11,522 INFO L427 AbstractCegarLoop]: === Iteration 1392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash -987323550, now seen corresponding path program 1386 times [2020-02-10 20:21:11,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369475415] [2020-02-10 20:21:11,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:11,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369475415] [2020-02-10 20:21:11,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:11,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:11,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004423208] [2020-02-10 20:21:11,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:11,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:11,770 INFO L87 Difference]: Start difference. First operand 385 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:21:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,886 INFO L93 Difference]: Finished difference Result 545 states and 1626 transitions. [2020-02-10 20:21:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:11,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,888 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:21:11,888 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:21:11,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:21:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 378. [2020-02-10 20:21:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-02-10 20:21:11,897 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,897 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-02-10 20:21:11,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-02-10 20:21:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:11,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,898 INFO L415 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] [2020-02-10 20:21:11,898 INFO L427 AbstractCegarLoop]: === Iteration 1393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash -826240496, now seen corresponding path program 1387 times [2020-02-10 20:21:11,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331805581] [2020-02-10 20:21:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:12,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331805581] [2020-02-10 20:21:12,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:12,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:12,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162043308] [2020-02-10 20:21:12,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:12,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:12,142 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:12,232 INFO L93 Difference]: Finished difference Result 545 states and 1615 transitions. [2020-02-10 20:21:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:12,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:12,234 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:21:12,234 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:21:12,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:21:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 380. [2020-02-10 20:21:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 20:21:12,243 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:12,243 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 20:21:12,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 20:21:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:12,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:12,244 INFO L415 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] [2020-02-10 20:21:12,244 INFO L427 AbstractCegarLoop]: === Iteration 1394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1901951652, now seen corresponding path program 1388 times [2020-02-10 20:21:12,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:12,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993927723] [2020-02-10 20:21:12,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:12,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993927723] [2020-02-10 20:21:12,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:12,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:12,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781510982] [2020-02-10 20:21:12,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:12,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:12,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:12,486 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:12,603 INFO L93 Difference]: Finished difference Result 550 states and 1624 transitions. [2020-02-10 20:21:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:12,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:12,605 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:21:12,605 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:21:12,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:21:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 379. [2020-02-10 20:21:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:21:12,620 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:12,620 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:21:12,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:21:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:12,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:12,621 INFO L415 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] [2020-02-10 20:21:12,621 INFO L427 AbstractCegarLoop]: === Iteration 1395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1868288946, now seen corresponding path program 1389 times [2020-02-10 20:21:12,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:12,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757761313] [2020-02-10 20:21:12,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:12,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757761313] [2020-02-10 20:21:12,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:12,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:12,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87759353] [2020-02-10 20:21:12,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:12,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:12,874 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:12,976 INFO L93 Difference]: Finished difference Result 542 states and 1609 transitions. [2020-02-10 20:21:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:12,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:12,978 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:21:12,978 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:21:12,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:21:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2020-02-10 20:21:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 20:21:12,987 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:12,987 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 20:21:12,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 20:21:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:12,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:12,988 INFO L415 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] [2020-02-10 20:21:12,988 INFO L427 AbstractCegarLoop]: === Iteration 1396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1891448548, now seen corresponding path program 1390 times [2020-02-10 20:21:12,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:12,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36570745] [2020-02-10 20:21:12,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36570745] [2020-02-10 20:21:13,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:13,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347832405] [2020-02-10 20:21:13,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:13,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:13,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:13,236 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:13,351 INFO L93 Difference]: Finished difference Result 536 states and 1606 transitions. [2020-02-10 20:21:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:13,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:13,353 INFO L225 Difference]: With dead ends: 536 [2020-02-10 20:21:13,353 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 20:21:13,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 20:21:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2020-02-10 20:21:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 20:21:13,362 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:13,363 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 20:21:13,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 20:21:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:13,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:13,363 INFO L415 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] [2020-02-10 20:21:13,363 INFO L427 AbstractCegarLoop]: === Iteration 1397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:13,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1805270322, now seen corresponding path program 1391 times [2020-02-10 20:21:13,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:13,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790643366] [2020-02-10 20:21:13,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790643366] [2020-02-10 20:21:13,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:13,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800815660] [2020-02-10 20:21:13,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:13,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:13,611 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:13,719 INFO L93 Difference]: Finished difference Result 550 states and 1627 transitions. [2020-02-10 20:21:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:13,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:13,721 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:21:13,721 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:21:13,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:21:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 383. [2020-02-10 20:21:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1304 transitions. [2020-02-10 20:21:13,730 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:13,730 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1304 transitions. [2020-02-10 20:21:13,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1304 transitions. [2020-02-10 20:21:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:13,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:13,731 INFO L415 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] [2020-02-10 20:21:13,731 INFO L427 AbstractCegarLoop]: === Iteration 1398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:13,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash -878756016, now seen corresponding path program 1392 times [2020-02-10 20:21:13,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:13,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602389842] [2020-02-10 20:21:13,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602389842] [2020-02-10 20:21:13,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:13,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442316313] [2020-02-10 20:21:13,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:13,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:13,977 INFO L87 Difference]: Start difference. First operand 383 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,094 INFO L93 Difference]: Finished difference Result 539 states and 1611 transitions. [2020-02-10 20:21:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:14,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,096 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:21:14,096 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:21:14,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:21:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 377. [2020-02-10 20:21:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-02-10 20:21:14,105 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-02-10 20:21:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,105 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-02-10 20:21:14,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-02-10 20:21:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:14,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,106 INFO L415 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] [2020-02-10 20:21:14,106 INFO L427 AbstractCegarLoop]: === Iteration 1399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 224334054, now seen corresponding path program 1393 times [2020-02-10 20:21:14,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405653167] [2020-02-10 20:21:14,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:14,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405653167] [2020-02-10 20:21:14,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:14,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:14,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560333816] [2020-02-10 20:21:14,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:14,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:14,361 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:21:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,475 INFO L93 Difference]: Finished difference Result 556 states and 1653 transitions. [2020-02-10 20:21:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:14,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,477 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:21:14,477 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:21:14,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:21:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 383. [2020-02-10 20:21:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 20:21:14,486 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 20:21:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,486 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 20:21:14,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 20:21:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:14,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,487 INFO L415 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] [2020-02-10 20:21:14,487 INFO L427 AbstractCegarLoop]: === Iteration 1400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash 477426806, now seen corresponding path program 1394 times [2020-02-10 20:21:14,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589946946] [2020-02-10 20:21:14,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:14,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589946946] [2020-02-10 20:21:14,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:14,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:14,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956891174] [2020-02-10 20:21:14,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:14,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:14,753 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:21:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,862 INFO L93 Difference]: Finished difference Result 555 states and 1649 transitions. [2020-02-10 20:21:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:14,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,864 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:21:14,864 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:21:14,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:21:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-02-10 20:21:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-02-10 20:21:14,873 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-02-10 20:21:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,874 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-02-10 20:21:14,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-02-10 20:21:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:14,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,874 INFO L415 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] [2020-02-10 20:21:14,874 INFO L427 AbstractCegarLoop]: === Iteration 1401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1457502856, now seen corresponding path program 1395 times [2020-02-10 20:21:14,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330179982] [2020-02-10 20:21:14,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:15,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330179982] [2020-02-10 20:21:15,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:15,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:15,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114777514] [2020-02-10 20:21:15,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:15,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:15,133 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:21:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:15,240 INFO L93 Difference]: Finished difference Result 561 states and 1662 transitions. [2020-02-10 20:21:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:15,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:15,242 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:21:15,242 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:21:15,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:21:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 384. [2020-02-10 20:21:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 20:21:15,251 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 20:21:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:15,252 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 20:21:15,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 20:21:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:15,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:15,252 INFO L415 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] [2020-02-10 20:21:15,252 INFO L427 AbstractCegarLoop]: === Iteration 1402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -71467726, now seen corresponding path program 1396 times [2020-02-10 20:21:15,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:15,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76027027] [2020-02-10 20:21:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:15,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76027027] [2020-02-10 20:21:15,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:15,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:15,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115016675] [2020-02-10 20:21:15,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:15,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:15,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:15,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:15,510 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 20:21:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:15,620 INFO L93 Difference]: Finished difference Result 564 states and 1665 transitions. [2020-02-10 20:21:15,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:15,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:15,622 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:21:15,622 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:21:15,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:21:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 381. [2020-02-10 20:21:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 20:21:15,631 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 20:21:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:15,631 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 20:21:15,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 20:21:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:15,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:15,632 INFO L415 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] [2020-02-10 20:21:15,632 INFO L427 AbstractCegarLoop]: === Iteration 1403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash -63483050, now seen corresponding path program 1397 times [2020-02-10 20:21:15,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:15,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905155344] [2020-02-10 20:21:15,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:15,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905155344] [2020-02-10 20:21:15,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:15,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:15,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539056851] [2020-02-10 20:21:15,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:15,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:15,884 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:21:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:15,984 INFO L93 Difference]: Finished difference Result 558 states and 1653 transitions. [2020-02-10 20:21:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:15,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:15,986 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:21:15,986 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:21:15,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:21:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 20:21:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-02-10 20:21:15,995 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-02-10 20:21:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:15,995 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-02-10 20:21:15,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-02-10 20:21:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:15,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:15,996 INFO L415 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] [2020-02-10 20:21:15,996 INFO L427 AbstractCegarLoop]: === Iteration 1404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -981433240, now seen corresponding path program 1398 times [2020-02-10 20:21:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:15,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063136273] [2020-02-10 20:21:15,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:16,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063136273] [2020-02-10 20:21:16,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:16,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:16,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281868053] [2020-02-10 20:21:16,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:16,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:16,246 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-02-10 20:21:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:16,355 INFO L93 Difference]: Finished difference Result 562 states and 1659 transitions. [2020-02-10 20:21:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:16,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:16,356 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:21:16,356 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:21:16,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:21:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 379. [2020-02-10 20:21:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 20:21:16,365 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:16,365 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 20:21:16,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 20:21:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:16,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:16,366 INFO L415 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] [2020-02-10 20:21:16,366 INFO L427 AbstractCegarLoop]: === Iteration 1405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2144599164, now seen corresponding path program 1399 times [2020-02-10 20:21:16,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:16,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303702153] [2020-02-10 20:21:16,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:16,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303702153] [2020-02-10 20:21:16,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:16,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:16,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973867298] [2020-02-10 20:21:16,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:16,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:16,639 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:16,758 INFO L93 Difference]: Finished difference Result 552 states and 1642 transitions. [2020-02-10 20:21:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:16,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:16,760 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:21:16,760 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:21:16,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:21:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2020-02-10 20:21:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 20:21:16,769 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 20:21:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:16,769 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 20:21:16,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 20:21:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:16,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:16,770 INFO L415 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] [2020-02-10 20:21:16,770 INFO L427 AbstractCegarLoop]: === Iteration 1406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1891506412, now seen corresponding path program 1400 times [2020-02-10 20:21:16,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:16,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347308754] [2020-02-10 20:21:16,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347308754] [2020-02-10 20:21:17,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:17,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92077366] [2020-02-10 20:21:17,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:17,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:17,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:17,033 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:21:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,145 INFO L93 Difference]: Finished difference Result 551 states and 1638 transitions. [2020-02-10 20:21:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:17,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,146 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:21:17,146 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:21:17,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:21:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 381. [2020-02-10 20:21:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 20:21:17,155 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 20:21:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:17,156 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 20:21:17,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 20:21:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:17,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:17,156 INFO L415 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] [2020-02-10 20:21:17,156 INFO L427 AbstractCegarLoop]: === Iteration 1407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1131906632, now seen corresponding path program 1401 times [2020-02-10 20:21:17,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:17,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546366288] [2020-02-10 20:21:17,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546366288] [2020-02-10 20:21:17,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:17,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655355528] [2020-02-10 20:21:17,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:17,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:17,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:17,416 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:21:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,525 INFO L93 Difference]: Finished difference Result 552 states and 1642 transitions. [2020-02-10 20:21:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:17,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,527 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:21:17,527 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:21:17,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:21:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 384. [2020-02-10 20:21:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-02-10 20:21:17,535 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-02-10 20:21:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:17,535 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-02-10 20:21:17,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-02-10 20:21:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:17,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:17,536 INFO L415 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] [2020-02-10 20:21:17,536 INFO L427 AbstractCegarLoop]: === Iteration 1408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -829888688, now seen corresponding path program 1402 times [2020-02-10 20:21:17,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:17,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493335962] [2020-02-10 20:21:17,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493335962] [2020-02-10 20:21:17,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:17,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951527538] [2020-02-10 20:21:17,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:17,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:17,799 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:21:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,919 INFO L93 Difference]: Finished difference Result 544 states and 1633 transitions. [2020-02-10 20:21:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:17,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,921 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:21:17,921 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:17,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-02-10 20:21:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-02-10 20:21:17,930 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:17,930 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-02-10 20:21:17,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-02-10 20:21:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:17,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:17,931 INFO L415 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] [2020-02-10 20:21:17,931 INFO L427 AbstractCegarLoop]: === Iteration 1409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1873054132, now seen corresponding path program 1403 times [2020-02-10 20:21:17,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:17,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200153865] [2020-02-10 20:21:17,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:18,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200153865] [2020-02-10 20:21:18,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:18,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:18,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573461157] [2020-02-10 20:21:18,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:18,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:18,186 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:18,293 INFO L93 Difference]: Finished difference Result 550 states and 1635 transitions. [2020-02-10 20:21:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:18,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:18,295 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:21:18,295 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:21:18,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:21:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 383. [2020-02-10 20:21:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1307 transitions. [2020-02-10 20:21:18,305 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1307 transitions. Word has length 22 [2020-02-10 20:21:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:18,305 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1307 transitions. [2020-02-10 20:21:18,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1307 transitions. [2020-02-10 20:21:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:18,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:18,306 INFO L415 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] [2020-02-10 20:21:18,306 INFO L427 AbstractCegarLoop]: === Iteration 1410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1699806440, now seen corresponding path program 1404 times [2020-02-10 20:21:18,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:18,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546836321] [2020-02-10 20:21:18,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:18,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546836321] [2020-02-10 20:21:18,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:18,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:18,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832325241] [2020-02-10 20:21:18,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:18,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:18,571 INFO L87 Difference]: Start difference. First operand 383 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:21:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:18,690 INFO L93 Difference]: Finished difference Result 543 states and 1629 transitions. [2020-02-10 20:21:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:18,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:18,692 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:21:18,692 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 20:21:18,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 20:21:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 379. [2020-02-10 20:21:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 20:21:18,702 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:18,702 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 20:21:18,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 20:21:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:18,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:18,702 INFO L415 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] [2020-02-10 20:21:18,703 INFO L427 AbstractCegarLoop]: === Iteration 1411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash -128805436, now seen corresponding path program 1405 times [2020-02-10 20:21:18,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:18,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248235264] [2020-02-10 20:21:18,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:18,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248235264] [2020-02-10 20:21:18,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:18,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:18,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439239292] [2020-02-10 20:21:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:18,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:18,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:18,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:18,963 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:19,081 INFO L93 Difference]: Finished difference Result 564 states and 1669 transitions. [2020-02-10 20:21:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:19,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:19,083 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:21:19,083 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:21:19,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:21:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 385. [2020-02-10 20:21:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:21:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1315 transitions. [2020-02-10 20:21:19,091 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1315 transitions. Word has length 22 [2020-02-10 20:21:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:19,091 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1315 transitions. [2020-02-10 20:21:19,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1315 transitions. [2020-02-10 20:21:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:19,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:19,092 INFO L415 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] [2020-02-10 20:21:19,092 INFO L427 AbstractCegarLoop]: === Iteration 1412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1257229694, now seen corresponding path program 1406 times [2020-02-10 20:21:19,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:19,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058545351] [2020-02-10 20:21:19,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:19,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058545351] [2020-02-10 20:21:19,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:19,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:19,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541749231] [2020-02-10 20:21:19,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:19,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:19,345 INFO L87 Difference]: Start difference. First operand 385 states and 1315 transitions. Second operand 9 states. [2020-02-10 20:21:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:19,454 INFO L93 Difference]: Finished difference Result 567 states and 1672 transitions. [2020-02-10 20:21:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:19,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:19,456 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:21:19,456 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:21:19,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:21:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 382. [2020-02-10 20:21:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-02-10 20:21:19,465 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-02-10 20:21:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:19,465 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-02-10 20:21:19,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-02-10 20:21:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:19,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:19,466 INFO L415 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] [2020-02-10 20:21:19,466 INFO L427 AbstractCegarLoop]: === Iteration 1413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:19,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1729243290, now seen corresponding path program 1407 times [2020-02-10 20:21:19,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:19,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996987666] [2020-02-10 20:21:19,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:19,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996987666] [2020-02-10 20:21:19,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:19,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:19,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374631704] [2020-02-10 20:21:19,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:19,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:19,726 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:21:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:19,838 INFO L93 Difference]: Finished difference Result 559 states and 1657 transitions. [2020-02-10 20:21:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:19,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:19,839 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:21:19,840 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:21:19,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:21:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 385. [2020-02-10 20:21:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:21:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1312 transitions. [2020-02-10 20:21:19,848 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1312 transitions. Word has length 22 [2020-02-10 20:21:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:19,848 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1312 transitions. [2020-02-10 20:21:19,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1312 transitions. [2020-02-10 20:21:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:19,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:19,849 INFO L415 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] [2020-02-10 20:21:19,849 INFO L427 AbstractCegarLoop]: === Iteration 1414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225346, now seen corresponding path program 1408 times [2020-02-10 20:21:19,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:19,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498989386] [2020-02-10 20:21:19,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498989386] [2020-02-10 20:21:20,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:20,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483006760] [2020-02-10 20:21:20,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:20,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:20,108 INFO L87 Difference]: Start difference. First operand 385 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:21:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:20,219 INFO L93 Difference]: Finished difference Result 551 states and 1648 transitions. [2020-02-10 20:21:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:20,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:20,221 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:21:20,221 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:21:20,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:21:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-02-10 20:21:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 20:21:20,230 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:20,230 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 20:21:20,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 20:21:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:20,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:20,231 INFO L415 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] [2020-02-10 20:21:20,231 INFO L427 AbstractCegarLoop]: === Iteration 1415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2029851366, now seen corresponding path program 1409 times [2020-02-10 20:21:20,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:20,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796086951] [2020-02-10 20:21:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796086951] [2020-02-10 20:21:20,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:20,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349805041] [2020-02-10 20:21:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:20,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:20,480 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:20,599 INFO L93 Difference]: Finished difference Result 563 states and 1663 transitions. [2020-02-10 20:21:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:20,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:20,600 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:21:20,600 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:21:20,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:21:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 386. [2020-02-10 20:21:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 20:21:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1311 transitions. [2020-02-10 20:21:20,609 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1311 transitions. Word has length 22 [2020-02-10 20:21:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:20,610 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1311 transitions. [2020-02-10 20:21:20,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1311 transitions. [2020-02-10 20:21:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:20,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:20,610 INFO L415 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] [2020-02-10 20:21:20,610 INFO L427 AbstractCegarLoop]: === Iteration 1416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1409809276, now seen corresponding path program 1410 times [2020-02-10 20:21:20,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:20,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698306179] [2020-02-10 20:21:20,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698306179] [2020-02-10 20:21:20,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:20,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317214704] [2020-02-10 20:21:20,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:20,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:20,858 INFO L87 Difference]: Start difference. First operand 386 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:21:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:20,972 INFO L93 Difference]: Finished difference Result 552 states and 1647 transitions. [2020-02-10 20:21:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:20,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:20,973 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:21:20,973 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:21:20,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:21:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 379. [2020-02-10 20:21:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 20:21:20,982 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:20,983 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 20:21:20,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 20:21:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:20,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:20,983 INFO L415 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] [2020-02-10 20:21:20,983 INFO L427 AbstractCegarLoop]: === Iteration 1417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash 673776822, now seen corresponding path program 1411 times [2020-02-10 20:21:20,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:20,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261217656] [2020-02-10 20:21:20,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:21,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261217656] [2020-02-10 20:21:21,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:21,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:21,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822435054] [2020-02-10 20:21:21,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:21,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:21,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:21,213 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:21,316 INFO L93 Difference]: Finished difference Result 558 states and 1651 transitions. [2020-02-10 20:21:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:21,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:21,318 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:21:21,318 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:21:21,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:21,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:21:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 20:21:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1307 transitions. [2020-02-10 20:21:21,327 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1307 transitions. Word has length 22 [2020-02-10 20:21:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:21,327 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1307 transitions. [2020-02-10 20:21:21,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1307 transitions. [2020-02-10 20:21:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:21,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:21,328 INFO L415 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] [2020-02-10 20:21:21,328 INFO L427 AbstractCegarLoop]: === Iteration 1418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash -244173368, now seen corresponding path program 1412 times [2020-02-10 20:21:21,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:21,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543528483] [2020-02-10 20:21:21,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:21,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543528483] [2020-02-10 20:21:21,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:21,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:21,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152170755] [2020-02-10 20:21:21,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:21,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:21,558 INFO L87 Difference]: Start difference. First operand 383 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:21:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:21,670 INFO L93 Difference]: Finished difference Result 562 states and 1657 transitions. [2020-02-10 20:21:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:21,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:21,672 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:21:21,672 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:21:21,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:21:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 381. [2020-02-10 20:21:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 20:21:21,681 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:21,681 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 20:21:21,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 20:21:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:21,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:21,682 INFO L415 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] [2020-02-10 20:21:21,682 INFO L427 AbstractCegarLoop]: === Iteration 1419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2010249516, now seen corresponding path program 1413 times [2020-02-10 20:21:21,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:21,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807342521] [2020-02-10 20:21:21,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:21,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807342521] [2020-02-10 20:21:21,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:21,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:21,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977176821] [2020-02-10 20:21:21,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:21,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:21,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:21,919 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:22,023 INFO L93 Difference]: Finished difference Result 554 states and 1642 transitions. [2020-02-10 20:21:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:22,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:22,024 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:21:22,025 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:21:22,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:21:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 383. [2020-02-10 20:21:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1305 transitions. [2020-02-10 20:21:22,034 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1305 transitions. Word has length 22 [2020-02-10 20:21:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:22,034 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1305 transitions. [2020-02-10 20:21:22,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1305 transitions. [2020-02-10 20:21:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:22,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:22,034 INFO L415 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] [2020-02-10 20:21:22,035 INFO L427 AbstractCegarLoop]: === Iteration 1420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2111470088, now seen corresponding path program 1414 times [2020-02-10 20:21:22,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:22,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400681257] [2020-02-10 20:21:22,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:22,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400681257] [2020-02-10 20:21:22,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:22,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:22,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270634849] [2020-02-10 20:21:22,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:22,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:22,266 INFO L87 Difference]: Start difference. First operand 383 states and 1305 transitions. Second operand 9 states. [2020-02-10 20:21:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:22,371 INFO L93 Difference]: Finished difference Result 547 states and 1636 transitions. [2020-02-10 20:21:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:22,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:22,372 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:21:22,372 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:21:22,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:21:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 381. [2020-02-10 20:21:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1300 transitions. [2020-02-10 20:21:22,382 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:22,382 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1300 transitions. [2020-02-10 20:21:22,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1300 transitions. [2020-02-10 20:21:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:22,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:22,383 INFO L415 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] [2020-02-10 20:21:22,383 INFO L427 AbstractCegarLoop]: === Iteration 1421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1319884524, now seen corresponding path program 1415 times [2020-02-10 20:21:22,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:22,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082533874] [2020-02-10 20:21:22,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:22,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082533874] [2020-02-10 20:21:22,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:22,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:22,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954749371] [2020-02-10 20:21:22,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:22,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:22,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:22,620 INFO L87 Difference]: Start difference. First operand 381 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:22,730 INFO L93 Difference]: Finished difference Result 560 states and 1654 transitions. [2020-02-10 20:21:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:22,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:22,731 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:21:22,732 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:21:22,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:21:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2020-02-10 20:21:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:21:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1307 transitions. [2020-02-10 20:21:22,740 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1307 transitions. Word has length 22 [2020-02-10 20:21:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:22,740 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1307 transitions. [2020-02-10 20:21:22,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1307 transitions. [2020-02-10 20:21:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:22,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:22,741 INFO L415 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] [2020-02-10 20:21:22,741 INFO L427 AbstractCegarLoop]: === Iteration 1422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash -575182026, now seen corresponding path program 1416 times [2020-02-10 20:21:22,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:22,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290951516] [2020-02-10 20:21:22,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:22,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290951516] [2020-02-10 20:21:22,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:22,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:22,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715435406] [2020-02-10 20:21:22,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:22,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:22,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:22,976 INFO L87 Difference]: Start difference. First operand 385 states and 1307 transitions. Second operand 9 states. [2020-02-10 20:21:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:23,100 INFO L93 Difference]: Finished difference Result 549 states and 1638 transitions. [2020-02-10 20:21:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:23,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:23,102 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:21:23,102 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:23,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 377. [2020-02-10 20:21:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1293 transitions. [2020-02-10 20:21:23,110 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1293 transitions. Word has length 22 [2020-02-10 20:21:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:23,110 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1293 transitions. [2020-02-10 20:21:23,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1293 transitions. [2020-02-10 20:21:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:23,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:23,111 INFO L415 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] [2020-02-10 20:21:23,111 INFO L427 AbstractCegarLoop]: === Iteration 1423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1318072458, now seen corresponding path program 1417 times [2020-02-10 20:21:23,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:23,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263634785] [2020-02-10 20:21:23,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:23,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263634785] [2020-02-10 20:21:23,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:23,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:23,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323936275] [2020-02-10 20:21:23,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:23,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:23,380 INFO L87 Difference]: Start difference. First operand 377 states and 1293 transitions. Second operand 9 states. [2020-02-10 20:21:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:23,476 INFO L93 Difference]: Finished difference Result 534 states and 1588 transitions. [2020-02-10 20:21:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:23,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:23,477 INFO L225 Difference]: With dead ends: 534 [2020-02-10 20:21:23,477 INFO L226 Difference]: Without dead ends: 525 [2020-02-10 20:21:23,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-02-10 20:21:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 380. [2020-02-10 20:21:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 20:21:23,486 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:23,487 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 20:21:23,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 20:21:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:23,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:23,487 INFO L415 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] [2020-02-10 20:21:23,487 INFO L427 AbstractCegarLoop]: === Iteration 1424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 292868500, now seen corresponding path program 1418 times [2020-02-10 20:21:23,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:23,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402429263] [2020-02-10 20:21:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:23,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402429263] [2020-02-10 20:21:23,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:23,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:23,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663814282] [2020-02-10 20:21:23,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:23,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:23,750 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:23,850 INFO L93 Difference]: Finished difference Result 535 states and 1589 transitions. [2020-02-10 20:21:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:23,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:23,852 INFO L225 Difference]: With dead ends: 535 [2020-02-10 20:21:23,852 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 20:21:23,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 20:21:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 379. [2020-02-10 20:21:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 20:21:23,861 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:23,861 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 20:21:23,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 20:21:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:23,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:23,862 INFO L415 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] [2020-02-10 20:21:23,862 INFO L427 AbstractCegarLoop]: === Iteration 1425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1295057928, now seen corresponding path program 1419 times [2020-02-10 20:21:23,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:23,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986492347] [2020-02-10 20:21:23,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:24,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986492347] [2020-02-10 20:21:24,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:24,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:24,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150627332] [2020-02-10 20:21:24,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:24,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:24,117 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,198 INFO L93 Difference]: Finished difference Result 538 states and 1595 transitions. [2020-02-10 20:21:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:24,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,200 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:21:24,200 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:24,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 20:21:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 20:21:24,209 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:24,209 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 20:21:24,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 20:21:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:24,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:24,210 INFO L415 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] [2020-02-10 20:21:24,210 INFO L427 AbstractCegarLoop]: === Iteration 1426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash 219346772, now seen corresponding path program 1420 times [2020-02-10 20:21:24,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:24,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344736733] [2020-02-10 20:21:24,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:24,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344736733] [2020-02-10 20:21:24,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:24,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:24,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790806401] [2020-02-10 20:21:24,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:24,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:24,460 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,579 INFO L93 Difference]: Finished difference Result 543 states and 1604 transitions. [2020-02-10 20:21:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:24,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,580 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:21:24,581 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:21:24,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:21:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-02-10 20:21:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:21:24,589 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:24,589 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:21:24,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:21:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:24,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:24,590 INFO L415 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] [2020-02-10 20:21:24,590 INFO L427 AbstractCegarLoop]: === Iteration 1427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1305561032, now seen corresponding path program 1421 times [2020-02-10 20:21:24,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:24,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817700552] [2020-02-10 20:21:24,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:24,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817700552] [2020-02-10 20:21:24,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:24,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:24,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561671378] [2020-02-10 20:21:24,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:24,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:24,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:24,844 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,960 INFO L93 Difference]: Finished difference Result 541 states and 1601 transitions. [2020-02-10 20:21:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:24,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,962 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:21:24,962 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:21:24,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:21:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 381. [2020-02-10 20:21:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-02-10 20:21:24,971 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:24,971 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-02-10 20:21:24,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-02-10 20:21:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:24,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:24,972 INFO L415 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] [2020-02-10 20:21:24,972 INFO L427 AbstractCegarLoop]: === Iteration 1428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1381091082, now seen corresponding path program 1422 times [2020-02-10 20:21:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640860147] [2020-02-10 20:21:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:25,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640860147] [2020-02-10 20:21:25,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:25,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:25,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274879000] [2020-02-10 20:21:25,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:25,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:25,211 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:25,327 INFO L93 Difference]: Finished difference Result 545 states and 1607 transitions. [2020-02-10 20:21:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:25,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:25,328 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:21:25,328 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:21:25,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:21:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2020-02-10 20:21:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-02-10 20:21:25,337 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:25,337 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-02-10 20:21:25,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-02-10 20:21:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:25,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:25,338 INFO L415 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] [2020-02-10 20:21:25,338 INFO L427 AbstractCegarLoop]: === Iteration 1429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash 607961620, now seen corresponding path program 1423 times [2020-02-10 20:21:25,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:25,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850877241] [2020-02-10 20:21:25,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:25,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850877241] [2020-02-10 20:21:25,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:25,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:25,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782302264] [2020-02-10 20:21:25,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:25,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:25,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:25,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:25,611 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:25,707 INFO L93 Difference]: Finished difference Result 531 states and 1581 transitions. [2020-02-10 20:21:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:25,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:25,709 INFO L225 Difference]: With dead ends: 531 [2020-02-10 20:21:25,709 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 20:21:25,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 20:21:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-02-10 20:21:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 20:21:25,717 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:25,717 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 20:21:25,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 20:21:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:25,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:25,717 INFO L415 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] [2020-02-10 20:21:25,718 INFO L427 AbstractCegarLoop]: === Iteration 1430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2076064718, now seen corresponding path program 1424 times [2020-02-10 20:21:25,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:25,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010240322] [2020-02-10 20:21:25,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:25,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010240322] [2020-02-10 20:21:25,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:25,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:25,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450966031] [2020-02-10 20:21:25,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:25,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:25,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:25,988 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:26,090 INFO L93 Difference]: Finished difference Result 532 states and 1582 transitions. [2020-02-10 20:21:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:26,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:26,092 INFO L225 Difference]: With dead ends: 532 [2020-02-10 20:21:26,092 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:21:26,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:21:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 379. [2020-02-10 20:21:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:21:26,101 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:26,102 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:21:26,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:21:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:26,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:26,102 INFO L415 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] [2020-02-10 20:21:26,103 INFO L427 AbstractCegarLoop]: === Iteration 1431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1620654152, now seen corresponding path program 1425 times [2020-02-10 20:21:26,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:26,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128993760] [2020-02-10 20:21:26,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:26,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128993760] [2020-02-10 20:21:26,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:26,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:26,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696059616] [2020-02-10 20:21:26,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:26,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:26,363 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:26,447 INFO L93 Difference]: Finished difference Result 532 states and 1583 transitions. [2020-02-10 20:21:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:26,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:26,449 INFO L225 Difference]: With dead ends: 532 [2020-02-10 20:21:26,449 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 20:21:26,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 20:21:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 380. [2020-02-10 20:21:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 20:21:26,458 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:26,458 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 20:21:26,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 20:21:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:26,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:26,459 INFO L415 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] [2020-02-10 20:21:26,459 INFO L427 AbstractCegarLoop]: === Iteration 1432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2139083342, now seen corresponding path program 1426 times [2020-02-10 20:21:26,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:26,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965901962] [2020-02-10 20:21:26,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:26,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965901962] [2020-02-10 20:21:26,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:26,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:26,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047845727] [2020-02-10 20:21:26,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:26,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:26,720 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:26,840 INFO L93 Difference]: Finished difference Result 526 states and 1580 transitions. [2020-02-10 20:21:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:26,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:26,841 INFO L225 Difference]: With dead ends: 526 [2020-02-10 20:21:26,841 INFO L226 Difference]: Without dead ends: 513 [2020-02-10 20:21:26,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-02-10 20:21:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 379. [2020-02-10 20:21:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 20:21:26,850 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:26,850 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 20:21:26,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 20:21:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:26,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:26,851 INFO L415 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] [2020-02-10 20:21:26,851 INFO L427 AbstractCegarLoop]: === Iteration 1433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1631157256, now seen corresponding path program 1427 times [2020-02-10 20:21:26,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:26,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469583914] [2020-02-10 20:21:26,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:27,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469583914] [2020-02-10 20:21:27,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:27,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:27,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396301043] [2020-02-10 20:21:27,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:27,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:27,108 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:27,213 INFO L93 Difference]: Finished difference Result 534 states and 1587 transitions. [2020-02-10 20:21:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:27,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:27,214 INFO L225 Difference]: With dead ends: 534 [2020-02-10 20:21:27,214 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 20:21:27,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 20:21:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2020-02-10 20:21:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1300 transitions. [2020-02-10 20:21:27,223 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:27,223 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1300 transitions. [2020-02-10 20:21:27,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1300 transitions. [2020-02-10 20:21:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:27,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:27,224 INFO L415 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] [2020-02-10 20:21:27,224 INFO L427 AbstractCegarLoop]: === Iteration 1434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash 555446100, now seen corresponding path program 1428 times [2020-02-10 20:21:27,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:27,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983670673] [2020-02-10 20:21:27,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:27,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983670673] [2020-02-10 20:21:27,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:27,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:27,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624532859] [2020-02-10 20:21:27,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:27,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:27,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:27,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:27,481 INFO L87 Difference]: Start difference. First operand 381 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:27,599 INFO L93 Difference]: Finished difference Result 527 states and 1581 transitions. [2020-02-10 20:21:27,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:27,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:27,601 INFO L225 Difference]: With dead ends: 527 [2020-02-10 20:21:27,601 INFO L226 Difference]: Without dead ends: 512 [2020-02-10 20:21:27,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-02-10 20:21:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2020-02-10 20:21:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1295 transitions. [2020-02-10 20:21:27,610 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1295 transitions. Word has length 22 [2020-02-10 20:21:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:27,610 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1295 transitions. [2020-02-10 20:21:27,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1295 transitions. [2020-02-10 20:21:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:27,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:27,611 INFO L415 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] [2020-02-10 20:21:27,611 INFO L427 AbstractCegarLoop]: === Iteration 1435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1671211948, now seen corresponding path program 1429 times [2020-02-10 20:21:27,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:27,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405855417] [2020-02-10 20:21:27,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:27,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405855417] [2020-02-10 20:21:27,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:27,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:27,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586271255] [2020-02-10 20:21:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:27,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:27,856 INFO L87 Difference]: Start difference. First operand 378 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:21:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:27,944 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-02-10 20:21:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:27,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:27,945 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:21:27,945 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:21:27,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:21:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2020-02-10 20:21:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 20:21:27,955 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:27,955 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 20:21:27,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 20:21:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:27,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:27,955 INFO L415 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] [2020-02-10 20:21:27,956 INFO L427 AbstractCegarLoop]: === Iteration 1436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1548044192, now seen corresponding path program 1430 times [2020-02-10 20:21:27,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:27,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309737795] [2020-02-10 20:21:27,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:28,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309737795] [2020-02-10 20:21:28,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:28,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:28,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365743371] [2020-02-10 20:21:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:28,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:28,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:28,201 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:28,311 INFO L93 Difference]: Finished difference Result 546 states and 1611 transitions. [2020-02-10 20:21:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:28,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:28,313 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:21:28,313 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:21:28,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:21:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-02-10 20:21:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 20:21:28,322 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:28,322 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 20:21:28,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 20:21:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:28,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:28,323 INFO L415 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] [2020-02-10 20:21:28,323 INFO L427 AbstractCegarLoop]: === Iteration 1437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:28,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:28,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1023317494, now seen corresponding path program 1431 times [2020-02-10 20:21:28,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:28,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535904436] [2020-02-10 20:21:28,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:28,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535904436] [2020-02-10 20:21:28,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:28,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:28,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737569771] [2020-02-10 20:21:28,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:28,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:28,575 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:28,658 INFO L93 Difference]: Finished difference Result 538 states and 1596 transitions. [2020-02-10 20:21:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:28,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:28,660 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:21:28,660 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:21:28,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:21:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 20:21:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-02-10 20:21:28,669 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:28,669 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-02-10 20:21:28,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-02-10 20:21:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:28,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:28,670 INFO L415 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] [2020-02-10 20:21:28,670 INFO L427 AbstractCegarLoop]: === Iteration 1438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:28,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:28,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1558547296, now seen corresponding path program 1432 times [2020-02-10 20:21:28,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:28,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889509419] [2020-02-10 20:21:28,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:28,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889509419] [2020-02-10 20:21:28,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:28,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:28,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864087322] [2020-02-10 20:21:28,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:28,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:28,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:28,923 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:29,034 INFO L93 Difference]: Finished difference Result 532 states and 1593 transitions. [2020-02-10 20:21:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:29,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:29,036 INFO L225 Difference]: With dead ends: 532 [2020-02-10 20:21:29,036 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 20:21:29,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 20:21:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-02-10 20:21:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 20:21:29,045 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:29,045 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 20:21:29,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 20:21:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:29,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:29,046 INFO L415 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] [2020-02-10 20:21:29,046 INFO L427 AbstractCegarLoop]: === Iteration 1439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:29,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash 960298870, now seen corresponding path program 1433 times [2020-02-10 20:21:29,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:29,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734531798] [2020-02-10 20:21:29,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:29,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734531798] [2020-02-10 20:21:29,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:29,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:29,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703871475] [2020-02-10 20:21:29,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:29,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:29,297 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:29,402 INFO L93 Difference]: Finished difference Result 546 states and 1614 transitions. [2020-02-10 20:21:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:29,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:29,404 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:21:29,404 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:21:29,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:21:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 383. [2020-02-10 20:21:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1303 transitions. [2020-02-10 20:21:29,413 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1303 transitions. Word has length 22 [2020-02-10 20:21:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:29,413 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1303 transitions. [2020-02-10 20:21:29,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1303 transitions. [2020-02-10 20:21:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:29,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:29,414 INFO L415 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] [2020-02-10 20:21:29,414 INFO L427 AbstractCegarLoop]: === Iteration 1440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1723727468, now seen corresponding path program 1434 times [2020-02-10 20:21:29,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:29,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056034473] [2020-02-10 20:21:29,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:29,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056034473] [2020-02-10 20:21:29,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:29,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:29,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488722759] [2020-02-10 20:21:29,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:29,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:29,658 INFO L87 Difference]: Start difference. First operand 383 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:21:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:29,772 INFO L93 Difference]: Finished difference Result 535 states and 1598 transitions. [2020-02-10 20:21:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:29,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:29,774 INFO L225 Difference]: With dead ends: 535 [2020-02-10 20:21:29,774 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 20:21:29,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 20:21:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2020-02-10 20:21:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1294 transitions. [2020-02-10 20:21:29,783 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1294 transitions. Word has length 22 [2020-02-10 20:21:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:29,783 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1294 transitions. [2020-02-10 20:21:29,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1294 transitions. [2020-02-10 20:21:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:29,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:29,783 INFO L415 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] [2020-02-10 20:21:29,784 INFO L427 AbstractCegarLoop]: === Iteration 1441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:29,784 INFO L82 PathProgramCache]: Analyzing trace with hash 265325234, now seen corresponding path program 1435 times [2020-02-10 20:21:29,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:29,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460666480] [2020-02-10 20:21:29,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:30,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460666480] [2020-02-10 20:21:30,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:30,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:30,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285452445] [2020-02-10 20:21:30,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:30,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:30,012 INFO L87 Difference]: Start difference. First operand 378 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:21:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:30,129 INFO L93 Difference]: Finished difference Result 547 states and 1617 transitions. [2020-02-10 20:21:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:30,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:30,131 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:21:30,131 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:21:30,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:21:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 382. [2020-02-10 20:21:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 20:21:30,140 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:30,141 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 20:21:30,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 20:21:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:30,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:30,141 INFO L415 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] [2020-02-10 20:21:30,141 INFO L427 AbstractCegarLoop]: === Iteration 1442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1873640416, now seen corresponding path program 1436 times [2020-02-10 20:21:30,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:30,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691866985] [2020-02-10 20:21:30,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:30,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691866985] [2020-02-10 20:21:30,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:30,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:30,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093669753] [2020-02-10 20:21:30,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:30,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:30,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:30,368 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:30,477 INFO L93 Difference]: Finished difference Result 551 states and 1623 transitions. [2020-02-10 20:21:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:30,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:30,479 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:21:30,479 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:21:30,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:21:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 20:21:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 20:21:30,487 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:30,487 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 20:21:30,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 20:21:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:30,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:30,488 INFO L415 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] [2020-02-10 20:21:30,488 INFO L427 AbstractCegarLoop]: === Iteration 1443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1335112620, now seen corresponding path program 1437 times [2020-02-10 20:21:30,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:30,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930416758] [2020-02-10 20:21:30,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:30,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930416758] [2020-02-10 20:21:30,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:30,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:30,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926648574] [2020-02-10 20:21:30,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:30,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:30,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:30,718 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:30,838 INFO L93 Difference]: Finished difference Result 543 states and 1608 transitions. [2020-02-10 20:21:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:30,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:30,840 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:21:30,840 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:21:30,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:21:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2020-02-10 20:21:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1302 transitions. [2020-02-10 20:21:30,849 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:30,849 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1302 transitions. [2020-02-10 20:21:30,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1302 transitions. [2020-02-10 20:21:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:30,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:30,850 INFO L415 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] [2020-02-10 20:21:30,850 INFO L427 AbstractCegarLoop]: === Iteration 1444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1884143520, now seen corresponding path program 1438 times [2020-02-10 20:21:30,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:30,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361591402] [2020-02-10 20:21:30,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:31,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361591402] [2020-02-10 20:21:31,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:31,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218868374] [2020-02-10 20:21:31,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:31,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:31,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:31,089 INFO L87 Difference]: Start difference. First operand 382 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:31,199 INFO L93 Difference]: Finished difference Result 536 states and 1602 transitions. [2020-02-10 20:21:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:31,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:31,201 INFO L225 Difference]: With dead ends: 536 [2020-02-10 20:21:31,201 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 20:21:31,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 20:21:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-02-10 20:21:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1297 transitions. [2020-02-10 20:21:31,210 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:31,210 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1297 transitions. [2020-02-10 20:21:31,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1297 transitions. [2020-02-10 20:21:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:31,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:31,210 INFO L415 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] [2020-02-10 20:21:31,211 INFO L427 AbstractCegarLoop]: === Iteration 1445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:31,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1408634348, now seen corresponding path program 1439 times [2020-02-10 20:21:31,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:31,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17341610] [2020-02-10 20:21:31,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:31,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17341610] [2020-02-10 20:21:31,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:31,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562807268] [2020-02-10 20:21:31,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:31,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:31,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:31,441 INFO L87 Difference]: Start difference. First operand 380 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:31,552 INFO L93 Difference]: Finished difference Result 549 states and 1620 transitions. [2020-02-10 20:21:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:31,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:31,554 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:21:31,554 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:21:31,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:21:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 384. [2020-02-10 20:21:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1304 transitions. [2020-02-10 20:21:31,563 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:31,563 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1304 transitions. [2020-02-10 20:21:31,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1304 transitions. [2020-02-10 20:21:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:31,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:31,564 INFO L415 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] [2020-02-10 20:21:31,564 INFO L427 AbstractCegarLoop]: === Iteration 1446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash 202306610, now seen corresponding path program 1440 times [2020-02-10 20:21:31,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:31,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354695936] [2020-02-10 20:21:31,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:31,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354695936] [2020-02-10 20:21:31,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:31,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505345778] [2020-02-10 20:21:31,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:31,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:31,796 INFO L87 Difference]: Start difference. First operand 384 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:31,910 INFO L93 Difference]: Finished difference Result 538 states and 1604 transitions. [2020-02-10 20:21:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:31,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:31,912 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:21:31,912 INFO L226 Difference]: Without dead ends: 515 [2020-02-10 20:21:31,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-02-10 20:21:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 373. [2020-02-10 20:21:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:21:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1286 transitions. [2020-02-10 20:21:31,921 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1286 transitions. Word has length 22 [2020-02-10 20:21:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:31,921 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1286 transitions. [2020-02-10 20:21:31,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1286 transitions. [2020-02-10 20:21:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:31,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:31,922 INFO L415 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] [2020-02-10 20:21:31,922 INFO L427 AbstractCegarLoop]: === Iteration 1447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1828499748, now seen corresponding path program 1441 times [2020-02-10 20:21:31,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:31,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448669251] [2020-02-10 20:21:31,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:32,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448669251] [2020-02-10 20:21:32,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:32,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:32,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645320118] [2020-02-10 20:21:32,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:32,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:32,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:32,219 INFO L87 Difference]: Start difference. First operand 373 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:21:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:32,319 INFO L93 Difference]: Finished difference Result 578 states and 1693 transitions. [2020-02-10 20:21:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:32,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:32,321 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:21:32,321 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:21:32,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:21:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 20:21:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 20:21:32,329 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 20:21:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:32,329 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 20:21:32,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 20:21:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:32,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:32,330 INFO L415 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] [2020-02-10 20:21:32,330 INFO L427 AbstractCegarLoop]: === Iteration 1448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -876201662, now seen corresponding path program 1442 times [2020-02-10 20:21:32,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:32,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338719898] [2020-02-10 20:21:32,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:32,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338719898] [2020-02-10 20:21:32,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:32,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:32,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874208759] [2020-02-10 20:21:32,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:32,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:32,613 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:21:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:32,724 INFO L93 Difference]: Finished difference Result 573 states and 1680 transitions. [2020-02-10 20:21:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:32,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:32,725 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:21:32,726 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:21:32,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:21:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 377. [2020-02-10 20:21:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1298 transitions. [2020-02-10 20:21:32,734 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:32,735 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1298 transitions. [2020-02-10 20:21:32,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1298 transitions. [2020-02-10 20:21:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:32,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:32,735 INFO L415 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] [2020-02-10 20:21:32,735 INFO L427 AbstractCegarLoop]: === Iteration 1449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1113917228, now seen corresponding path program 1443 times [2020-02-10 20:21:32,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:32,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245714969] [2020-02-10 20:21:32,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:33,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245714969] [2020-02-10 20:21:33,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:33,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:33,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489683470] [2020-02-10 20:21:33,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:33,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:33,017 INFO L87 Difference]: Start difference. First operand 377 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:33,101 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2020-02-10 20:21:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:33,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:33,103 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:21:33,103 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:21:33,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:21:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 379. [2020-02-10 20:21:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 20:21:33,112 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:33,112 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 20:21:33,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 20:21:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:33,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:33,112 INFO L415 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] [2020-02-10 20:21:33,113 INFO L427 AbstractCegarLoop]: === Iteration 1450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -552848736, now seen corresponding path program 1444 times [2020-02-10 20:21:33,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:33,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946857575] [2020-02-10 20:21:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:33,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946857575] [2020-02-10 20:21:33,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:33,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:33,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862806569] [2020-02-10 20:21:33,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:33,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:33,406 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:33,505 INFO L93 Difference]: Finished difference Result 567 states and 1666 transitions. [2020-02-10 20:21:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:33,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:33,507 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:21:33,507 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:21:33,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:21:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2020-02-10 20:21:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-02-10 20:21:33,517 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:33,517 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-02-10 20:21:33,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-02-10 20:21:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:33,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:33,518 INFO L415 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] [2020-02-10 20:21:33,518 INFO L427 AbstractCegarLoop]: === Iteration 1451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:33,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1986759862, now seen corresponding path program 1445 times [2020-02-10 20:21:33,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:33,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894689632] [2020-02-10 20:21:33,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:33,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894689632] [2020-02-10 20:21:33,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:33,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:33,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120487853] [2020-02-10 20:21:33,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:33,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:33,798 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:33,904 INFO L93 Difference]: Finished difference Result 563 states and 1659 transitions. [2020-02-10 20:21:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:33,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:33,906 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:21:33,906 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:21:33,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:21:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 378. [2020-02-10 20:21:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-02-10 20:21:33,915 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-02-10 20:21:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:33,915 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-02-10 20:21:33,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-02-10 20:21:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:33,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:33,916 INFO L415 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] [2020-02-10 20:21:33,916 INFO L427 AbstractCegarLoop]: === Iteration 1452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash 541242852, now seen corresponding path program 1446 times [2020-02-10 20:21:33,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:33,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780018869] [2020-02-10 20:21:33,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:34,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780018869] [2020-02-10 20:21:34,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:34,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:34,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808767470] [2020-02-10 20:21:34,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:34,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:34,202 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:21:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:34,304 INFO L93 Difference]: Finished difference Result 561 states and 1654 transitions. [2020-02-10 20:21:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:34,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:34,306 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:21:34,306 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:21:34,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:21:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 375. [2020-02-10 20:21:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:21:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1292 transitions. [2020-02-10 20:21:34,315 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1292 transitions. Word has length 22 [2020-02-10 20:21:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:34,315 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1292 transitions. [2020-02-10 20:21:34,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1292 transitions. [2020-02-10 20:21:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:34,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:34,316 INFO L415 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] [2020-02-10 20:21:34,316 INFO L427 AbstractCegarLoop]: === Iteration 1453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1406014022, now seen corresponding path program 1447 times [2020-02-10 20:21:34,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:34,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108865027] [2020-02-10 20:21:34,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:34,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108865027] [2020-02-10 20:21:34,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:34,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:34,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443512241] [2020-02-10 20:21:34,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:34,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:34,599 INFO L87 Difference]: Start difference. First operand 375 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:21:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:34,707 INFO L93 Difference]: Finished difference Result 582 states and 1703 transitions. [2020-02-10 20:21:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:34,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:34,709 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:21:34,709 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:21:34,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:21:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 20:21:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 20:21:34,719 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 20:21:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:34,719 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 20:21:34,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 20:21:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:34,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:34,719 INFO L415 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] [2020-02-10 20:21:34,720 INFO L427 AbstractCegarLoop]: === Iteration 1454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1298687388, now seen corresponding path program 1448 times [2020-02-10 20:21:34,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:34,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099095294] [2020-02-10 20:21:34,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:34,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099095294] [2020-02-10 20:21:34,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:34,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:34,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61501518] [2020-02-10 20:21:34,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:34,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:34,999 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:21:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:35,133 INFO L93 Difference]: Finished difference Result 577 states and 1690 transitions. [2020-02-10 20:21:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:35,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:35,135 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:21:35,135 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:21:35,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:21:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 378. [2020-02-10 20:21:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-02-10 20:21:35,144 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:35,144 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-02-10 20:21:35,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-02-10 20:21:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:35,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:35,145 INFO L415 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] [2020-02-10 20:21:35,145 INFO L427 AbstractCegarLoop]: === Iteration 1455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1506926194, now seen corresponding path program 1449 times [2020-02-10 20:21:35,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:35,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992538087] [2020-02-10 20:21:35,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:35,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992538087] [2020-02-10 20:21:35,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:35,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:35,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805050632] [2020-02-10 20:21:35,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:35,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:35,433 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:35,544 INFO L93 Difference]: Finished difference Result 580 states and 1695 transitions. [2020-02-10 20:21:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:35,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:35,545 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:21:35,546 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:21:35,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:21:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 381. [2020-02-10 20:21:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-02-10 20:21:35,554 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-02-10 20:21:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:35,554 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-02-10 20:21:35,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-02-10 20:21:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:35,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:35,555 INFO L415 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] [2020-02-10 20:21:35,555 INFO L427 AbstractCegarLoop]: === Iteration 1456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1633562568, now seen corresponding path program 1450 times [2020-02-10 20:21:35,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:35,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058186915] [2020-02-10 20:21:35,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:35,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058186915] [2020-02-10 20:21:35,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:35,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:35,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509015359] [2020-02-10 20:21:35,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:35,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:35,835 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:21:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:35,960 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2020-02-10 20:21:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:35,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:35,962 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:21:35,962 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:21:35,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:21:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 378. [2020-02-10 20:21:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-02-10 20:21:35,972 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:35,972 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-02-10 20:21:35,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-02-10 20:21:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:35,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:35,972 INFO L415 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] [2020-02-10 20:21:35,972 INFO L427 AbstractCegarLoop]: === Iteration 1457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash -781455600, now seen corresponding path program 1451 times [2020-02-10 20:21:35,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:35,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633976338] [2020-02-10 20:21:35,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:36,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633976338] [2020-02-10 20:21:36,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:36,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:36,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289194860] [2020-02-10 20:21:36,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:36,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:36,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:36,260 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:36,371 INFO L93 Difference]: Finished difference Result 569 states and 1672 transitions. [2020-02-10 20:21:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:36,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:36,373 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:21:36,373 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:21:36,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:21:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 20:21:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 20:21:36,382 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:36,382 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 20:21:36,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 20:21:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:36,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:36,382 INFO L415 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] [2020-02-10 20:21:36,382 INFO L427 AbstractCegarLoop]: === Iteration 1458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash 560477188, now seen corresponding path program 1452 times [2020-02-10 20:21:36,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:36,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053441126] [2020-02-10 20:21:36,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:36,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053441126] [2020-02-10 20:21:36,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:36,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:36,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695403680] [2020-02-10 20:21:36,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:36,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:36,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:36,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:36,663 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:36,799 INFO L93 Difference]: Finished difference Result 568 states and 1668 transitions. [2020-02-10 20:21:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:36,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:36,801 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:21:36,801 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:21:36,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:21:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 375. [2020-02-10 20:21:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:21:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1290 transitions. [2020-02-10 20:21:36,810 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1290 transitions. Word has length 22 [2020-02-10 20:21:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:36,810 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1290 transitions. [2020-02-10 20:21:36,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1290 transitions. [2020-02-10 20:21:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:36,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:36,811 INFO L415 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] [2020-02-10 20:21:36,811 INFO L427 AbstractCegarLoop]: === Iteration 1459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:36,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1132505132, now seen corresponding path program 1453 times [2020-02-10 20:21:36,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:36,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771623272] [2020-02-10 20:21:36,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:37,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771623272] [2020-02-10 20:21:37,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:37,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:37,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431013993] [2020-02-10 20:21:37,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:37,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:37,101 INFO L87 Difference]: Start difference. First operand 375 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:21:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:37,207 INFO L93 Difference]: Finished difference Result 572 states and 1674 transitions. [2020-02-10 20:21:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:37,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:37,208 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:21:37,208 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:21:37,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:21:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-02-10 20:21:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:21:37,218 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:37,218 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:21:37,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:21:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:37,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:37,218 INFO L415 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] [2020-02-10 20:21:37,219 INFO L427 AbstractCegarLoop]: === Iteration 1460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash -571436640, now seen corresponding path program 1454 times [2020-02-10 20:21:37,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:37,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241559882] [2020-02-10 20:21:37,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:37,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241559882] [2020-02-10 20:21:37,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:37,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:37,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977828184] [2020-02-10 20:21:37,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:37,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:37,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:37,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:37,532 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:37,650 INFO L93 Difference]: Finished difference Result 565 states and 1659 transitions. [2020-02-10 20:21:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:37,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:37,652 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:21:37,652 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:21:37,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:21:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 377. [2020-02-10 20:21:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-02-10 20:21:37,661 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-02-10 20:21:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:37,662 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-02-10 20:21:37,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-02-10 20:21:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:37,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:37,662 INFO L415 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] [2020-02-10 20:21:37,662 INFO L427 AbstractCegarLoop]: === Iteration 1461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1562024310, now seen corresponding path program 1455 times [2020-02-10 20:21:37,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:37,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574311611] [2020-02-10 20:21:37,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:37,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574311611] [2020-02-10 20:21:37,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:37,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:37,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19014667] [2020-02-10 20:21:37,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:37,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:37,964 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:21:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:38,072 INFO L93 Difference]: Finished difference Result 574 states and 1677 transitions. [2020-02-10 20:21:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:38,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:38,074 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:21:38,074 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:21:38,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:21:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 20:21:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-02-10 20:21:38,083 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:38,083 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-02-10 20:21:38,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-02-10 20:21:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:38,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:38,084 INFO L415 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] [2020-02-10 20:21:38,084 INFO L427 AbstractCegarLoop]: === Iteration 1462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 599820648, now seen corresponding path program 1456 times [2020-02-10 20:21:38,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:38,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337525244] [2020-02-10 20:21:38,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:38,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337525244] [2020-02-10 20:21:38,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:38,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:38,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782963177] [2020-02-10 20:21:38,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:38,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:38,409 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:38,565 INFO L93 Difference]: Finished difference Result 568 states and 1663 transitions. [2020-02-10 20:21:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:38,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:38,567 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:21:38,567 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:21:38,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:21:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 377. [2020-02-10 20:21:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 20:21:38,577 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 20:21:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:38,578 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 20:21:38,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 20:21:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:38,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:38,578 INFO L415 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] [2020-02-10 20:21:38,578 INFO L427 AbstractCegarLoop]: === Iteration 1463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1616746536, now seen corresponding path program 1457 times [2020-02-10 20:21:38,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:38,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71633394] [2020-02-10 20:21:38,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:38,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71633394] [2020-02-10 20:21:38,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:38,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:38,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943065637] [2020-02-10 20:21:38,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:38,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:38,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:38,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:38,873 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:21:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:38,966 INFO L93 Difference]: Finished difference Result 558 states and 1644 transitions. [2020-02-10 20:21:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:38,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:38,967 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:21:38,967 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:21:38,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:21:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 378. [2020-02-10 20:21:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1293 transitions. [2020-02-10 20:21:38,976 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1293 transitions. Word has length 22 [2020-02-10 20:21:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:38,976 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1293 transitions. [2020-02-10 20:21:38,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1293 transitions. [2020-02-10 20:21:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:38,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:38,977 INFO L415 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] [2020-02-10 20:21:38,977 INFO L427 AbstractCegarLoop]: === Iteration 1464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1067279802, now seen corresponding path program 1458 times [2020-02-10 20:21:38,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:38,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400458762] [2020-02-10 20:21:38,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:39,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400458762] [2020-02-10 20:21:39,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:39,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:39,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114011086] [2020-02-10 20:21:39,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:39,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:39,270 INFO L87 Difference]: Start difference. First operand 378 states and 1293 transitions. Second operand 9 states. [2020-02-10 20:21:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:39,391 INFO L93 Difference]: Finished difference Result 559 states and 1645 transitions. [2020-02-10 20:21:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:39,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:39,393 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:21:39,393 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:21:39,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:21:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 375. [2020-02-10 20:21:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:21:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1288 transitions. [2020-02-10 20:21:39,402 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1288 transitions. Word has length 22 [2020-02-10 20:21:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:39,402 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1288 transitions. [2020-02-10 20:21:39,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1288 transitions. [2020-02-10 20:21:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:39,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:39,403 INFO L415 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] [2020-02-10 20:21:39,403 INFO L427 AbstractCegarLoop]: === Iteration 1465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:39,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1525272818, now seen corresponding path program 1459 times [2020-02-10 20:21:39,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:39,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577047945] [2020-02-10 20:21:39,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:39,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577047945] [2020-02-10 20:21:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:39,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:39,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357798912] [2020-02-10 20:21:39,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:39,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:39,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:39,693 INFO L87 Difference]: Start difference. First operand 375 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:21:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:39,827 INFO L93 Difference]: Finished difference Result 553 states and 1636 transitions. [2020-02-10 20:21:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:39,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:39,828 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:21:39,829 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:21:39,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:21:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 377. [2020-02-10 20:21:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 20:21:39,837 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 20:21:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:39,837 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 20:21:39,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 20:21:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:39,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:39,838 INFO L415 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] [2020-02-10 20:21:39,838 INFO L427 AbstractCegarLoop]: === Iteration 1466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 79755808, now seen corresponding path program 1460 times [2020-02-10 20:21:39,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:39,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128743184] [2020-02-10 20:21:39,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:40,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128743184] [2020-02-10 20:21:40,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:40,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:40,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265003567] [2020-02-10 20:21:40,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:40,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:40,132 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:21:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:40,249 INFO L93 Difference]: Finished difference Result 551 states and 1631 transitions. [2020-02-10 20:21:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:40,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:40,251 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:21:40,251 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:21:40,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:21:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 376. [2020-02-10 20:21:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1290 transitions. [2020-02-10 20:21:40,260 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1290 transitions. Word has length 22 [2020-02-10 20:21:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:40,260 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1290 transitions. [2020-02-10 20:21:40,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1290 transitions. [2020-02-10 20:21:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:40,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:40,261 INFO L415 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] [2020-02-10 20:21:40,261 INFO L427 AbstractCegarLoop]: === Iteration 1467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -75165036, now seen corresponding path program 1461 times [2020-02-10 20:21:40,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:40,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133853526] [2020-02-10 20:21:40,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:40,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133853526] [2020-02-10 20:21:40,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:40,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:40,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573223002] [2020-02-10 20:21:40,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:40,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:40,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:40,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:40,551 INFO L87 Difference]: Start difference. First operand 376 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:21:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:40,669 INFO L93 Difference]: Finished difference Result 555 states and 1640 transitions. [2020-02-10 20:21:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:40,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:40,671 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:21:40,671 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:21:40,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:21:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 378. [2020-02-10 20:21:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1293 transitions. [2020-02-10 20:21:40,681 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1293 transitions. Word has length 22 [2020-02-10 20:21:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:40,681 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1293 transitions. [2020-02-10 20:21:40,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1293 transitions. [2020-02-10 20:21:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:40,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:40,681 INFO L415 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] [2020-02-10 20:21:40,681 INFO L427 AbstractCegarLoop]: === Iteration 1468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash 177927716, now seen corresponding path program 1462 times [2020-02-10 20:21:40,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:40,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698450854] [2020-02-10 20:21:40,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:40,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698450854] [2020-02-10 20:21:40,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:40,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:40,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492643009] [2020-02-10 20:21:40,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:40,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:40,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:40,975 INFO L87 Difference]: Start difference. First operand 378 states and 1293 transitions. Second operand 9 states. [2020-02-10 20:21:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:41,113 INFO L93 Difference]: Finished difference Result 554 states and 1636 transitions. [2020-02-10 20:21:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:41,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:41,114 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:21:41,115 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:21:41,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:21:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 376. [2020-02-10 20:21:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1289 transitions. [2020-02-10 20:21:41,124 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1289 transitions. Word has length 22 [2020-02-10 20:21:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:41,124 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1289 transitions. [2020-02-10 20:21:41,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1289 transitions. [2020-02-10 20:21:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:41,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:41,124 INFO L415 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] [2020-02-10 20:21:41,124 INFO L427 AbstractCegarLoop]: === Iteration 1469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:41,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1173847396, now seen corresponding path program 1463 times [2020-02-10 20:21:41,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:41,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127209147] [2020-02-10 20:21:41,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:41,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127209147] [2020-02-10 20:21:41,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:41,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:41,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057518594] [2020-02-10 20:21:41,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:41,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:41,423 INFO L87 Difference]: Start difference. First operand 376 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:21:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:41,534 INFO L93 Difference]: Finished difference Result 550 states and 1628 transitions. [2020-02-10 20:21:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:41,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:41,535 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:21:41,535 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:21:41,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:21:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 377. [2020-02-10 20:21:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 20:21:41,543 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 20:21:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:41,544 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 20:21:41,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 20:21:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:41,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:41,544 INFO L415 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] [2020-02-10 20:21:41,544 INFO L427 AbstractCegarLoop]: === Iteration 1470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1510178942, now seen corresponding path program 1464 times [2020-02-10 20:21:41,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:41,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589593096] [2020-02-10 20:21:41,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:41,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589593096] [2020-02-10 20:21:41,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:41,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:41,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526696641] [2020-02-10 20:21:41,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:41,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:41,839 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:21:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:41,949 INFO L93 Difference]: Finished difference Result 551 states and 1629 transitions. [2020-02-10 20:21:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:41,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:41,951 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:21:41,951 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:21:41,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:21:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 373. [2020-02-10 20:21:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:21:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1284 transitions. [2020-02-10 20:21:41,960 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1284 transitions. Word has length 22 [2020-02-10 20:21:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:41,960 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1284 transitions. [2020-02-10 20:21:41,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1284 transitions. [2020-02-10 20:21:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:41,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:41,961 INFO L415 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] [2020-02-10 20:21:41,961 INFO L427 AbstractCegarLoop]: === Iteration 1471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1193533840, now seen corresponding path program 1465 times [2020-02-10 20:21:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869935504] [2020-02-10 20:21:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:42,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869935504] [2020-02-10 20:21:42,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:42,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:42,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256702067] [2020-02-10 20:21:42,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:42,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:42,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:42,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:42,244 INFO L87 Difference]: Start difference. First operand 373 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:21:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:42,352 INFO L93 Difference]: Finished difference Result 584 states and 1708 transitions. [2020-02-10 20:21:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:42,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:42,354 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:21:42,354 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:21:42,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:21:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 20:21:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-02-10 20:21:42,363 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:42,364 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-02-10 20:21:42,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-02-10 20:21:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:42,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:42,364 INFO L415 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] [2020-02-10 20:21:42,365 INFO L427 AbstractCegarLoop]: === Iteration 1472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 396732046, now seen corresponding path program 1466 times [2020-02-10 20:21:42,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:42,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014767442] [2020-02-10 20:21:42,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:42,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014767442] [2020-02-10 20:21:42,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:42,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:42,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360096032] [2020-02-10 20:21:42,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:42,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:42,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:42,654 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:42,784 INFO L93 Difference]: Finished difference Result 579 states and 1695 transitions. [2020-02-10 20:21:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:42,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:42,786 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:21:42,786 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:21:42,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:21:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 377. [2020-02-10 20:21:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-02-10 20:21:42,795 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:42,795 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-02-10 20:21:42,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-02-10 20:21:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:42,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:42,796 INFO L415 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] [2020-02-10 20:21:42,796 INFO L427 AbstractCegarLoop]: === Iteration 1473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash 159016480, now seen corresponding path program 1467 times [2020-02-10 20:21:42,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:42,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232564034] [2020-02-10 20:21:42,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232564034] [2020-02-10 20:21:43,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:43,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830846547] [2020-02-10 20:21:43,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:43,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:43,075 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,182 INFO L93 Difference]: Finished difference Result 580 states and 1696 transitions. [2020-02-10 20:21:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:43,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,184 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:21:43,184 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:21:43,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:21:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 379. [2020-02-10 20:21:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 20:21:43,194 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:43,194 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 20:21:43,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 20:21:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:43,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:43,194 INFO L415 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] [2020-02-10 20:21:43,195 INFO L427 AbstractCegarLoop]: === Iteration 1474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash 720084972, now seen corresponding path program 1468 times [2020-02-10 20:21:43,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:43,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301524075] [2020-02-10 20:21:43,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301524075] [2020-02-10 20:21:43,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:43,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194780871] [2020-02-10 20:21:43,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:43,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:43,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:43,470 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,565 INFO L93 Difference]: Finished difference Result 573 states and 1681 transitions. [2020-02-10 20:21:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:43,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,566 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:21:43,567 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:21:43,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:21:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-02-10 20:21:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-02-10 20:21:43,575 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-02-10 20:21:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:43,575 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-02-10 20:21:43,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-02-10 20:21:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:43,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:43,576 INFO L415 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] [2020-02-10 20:21:43,576 INFO L427 AbstractCegarLoop]: === Iteration 1475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1035273726, now seen corresponding path program 1469 times [2020-02-10 20:21:43,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:43,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600588057] [2020-02-10 20:21:43,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600588057] [2020-02-10 20:21:43,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:43,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298167161] [2020-02-10 20:21:43,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:43,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:43,859 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:21:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,990 INFO L93 Difference]: Finished difference Result 569 states and 1674 transitions. [2020-02-10 20:21:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:43,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,992 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:21:43,992 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:21:43,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:21:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 378. [2020-02-10 20:21:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1295 transitions. [2020-02-10 20:21:44,001 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1295 transitions. Word has length 22 [2020-02-10 20:21:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:44,002 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1295 transitions. [2020-02-10 20:21:44,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1295 transitions. [2020-02-10 20:21:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:44,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:44,002 INFO L415 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] [2020-02-10 20:21:44,002 INFO L427 AbstractCegarLoop]: === Iteration 1476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1814176560, now seen corresponding path program 1470 times [2020-02-10 20:21:44,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:44,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344068646] [2020-02-10 20:21:44,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:44,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344068646] [2020-02-10 20:21:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50985848] [2020-02-10 20:21:44,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:44,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:44,288 INFO L87 Difference]: Start difference. First operand 378 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:21:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:44,374 INFO L93 Difference]: Finished difference Result 567 states and 1669 transitions. [2020-02-10 20:21:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:44,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:44,376 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:21:44,376 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:21:44,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:21:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-02-10 20:21:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:21:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1290 transitions. [2020-02-10 20:21:44,385 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1290 transitions. Word has length 22 [2020-02-10 20:21:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:44,385 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1290 transitions. [2020-02-10 20:21:44,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1290 transitions. [2020-02-10 20:21:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:44,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:44,385 INFO L415 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] [2020-02-10 20:21:44,385 INFO L427 AbstractCegarLoop]: === Iteration 1477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:44,386 INFO L82 PathProgramCache]: Analyzing trace with hash 918894790, now seen corresponding path program 1471 times [2020-02-10 20:21:44,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:44,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605338123] [2020-02-10 20:21:44,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:44,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605338123] [2020-02-10 20:21:44,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:44,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:44,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992585633] [2020-02-10 20:21:44,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:44,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:44,666 INFO L87 Difference]: Start difference. First operand 375 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:21:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:44,749 INFO L93 Difference]: Finished difference Result 594 states and 1735 transitions. [2020-02-10 20:21:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:44,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:44,751 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:21:44,751 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:21:44,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:21:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 383. [2020-02-10 20:21:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1310 transitions. [2020-02-10 20:21:44,760 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1310 transitions. Word has length 22 [2020-02-10 20:21:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:44,761 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1310 transitions. [2020-02-10 20:21:44,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1310 transitions. [2020-02-10 20:21:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:44,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:44,761 INFO L415 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] [2020-02-10 20:21:44,762 INFO L427 AbstractCegarLoop]: === Iteration 1478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:44,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1785806620, now seen corresponding path program 1472 times [2020-02-10 20:21:44,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:44,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024134327] [2020-02-10 20:21:44,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:45,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024134327] [2020-02-10 20:21:45,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:45,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:45,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719251875] [2020-02-10 20:21:45,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:45,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:45,046 INFO L87 Difference]: Start difference. First operand 383 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:21:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:45,178 INFO L93 Difference]: Finished difference Result 589 states and 1722 transitions. [2020-02-10 20:21:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:45,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:45,180 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:21:45,180 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:21:45,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:21:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 20:21:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 20:21:45,189 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:45,189 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 20:21:45,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 20:21:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:45,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:45,190 INFO L415 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] [2020-02-10 20:21:45,190 INFO L427 AbstractCegarLoop]: === Iteration 1479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash -429781962, now seen corresponding path program 1473 times [2020-02-10 20:21:45,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:45,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207425869] [2020-02-10 20:21:45,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:45,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207425869] [2020-02-10 20:21:45,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:45,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:45,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849243210] [2020-02-10 20:21:45,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:45,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:45,471 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:45,581 INFO L93 Difference]: Finished difference Result 596 states and 1736 transitions. [2020-02-10 20:21:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:45,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:45,583 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:21:45,583 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:21:45,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:21:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 20:21:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1308 transitions. [2020-02-10 20:21:45,592 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1308 transitions. Word has length 22 [2020-02-10 20:21:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:45,592 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1308 transitions. [2020-02-10 20:21:45,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1308 transitions. [2020-02-10 20:21:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:45,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:45,593 INFO L415 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] [2020-02-10 20:21:45,593 INFO L427 AbstractCegarLoop]: === Iteration 1480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2131109864, now seen corresponding path program 1474 times [2020-02-10 20:21:45,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:45,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847158492] [2020-02-10 20:21:45,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:45,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847158492] [2020-02-10 20:21:45,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:45,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:45,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237679099] [2020-02-10 20:21:45,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:45,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:45,879 INFO L87 Difference]: Start difference. First operand 384 states and 1308 transitions. Second operand 9 states. [2020-02-10 20:21:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:46,011 INFO L93 Difference]: Finished difference Result 592 states and 1724 transitions. [2020-02-10 20:21:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:46,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:46,013 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:21:46,013 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:21:46,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:21:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-02-10 20:21:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 20:21:46,022 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:46,022 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 20:21:46,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 20:21:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:46,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:46,023 INFO L415 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] [2020-02-10 20:21:46,023 INFO L427 AbstractCegarLoop]: === Iteration 1481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1645078376, now seen corresponding path program 1475 times [2020-02-10 20:21:46,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:46,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493256588] [2020-02-10 20:21:46,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:46,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493256588] [2020-02-10 20:21:46,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:46,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423736834] [2020-02-10 20:21:46,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:46,308 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:46,441 INFO L93 Difference]: Finished difference Result 584 states and 1709 transitions. [2020-02-10 20:21:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:46,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:46,443 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:21:46,443 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:21:46,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:21:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 382. [2020-02-10 20:21:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1301 transitions. [2020-02-10 20:21:46,452 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1301 transitions. Word has length 22 [2020-02-10 20:21:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:46,452 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1301 transitions. [2020-02-10 20:21:46,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1301 transitions. [2020-02-10 20:21:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:46,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:46,453 INFO L415 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] [2020-02-10 20:21:46,453 INFO L427 AbstractCegarLoop]: === Iteration 1482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash -771337696, now seen corresponding path program 1476 times [2020-02-10 20:21:46,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:46,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243346383] [2020-02-10 20:21:46,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:46,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243346383] [2020-02-10 20:21:46,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:46,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:46,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681944734] [2020-02-10 20:21:46,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:46,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:46,734 INFO L87 Difference]: Start difference. First operand 382 states and 1301 transitions. Second operand 9 states. [2020-02-10 20:21:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:46,869 INFO L93 Difference]: Finished difference Result 585 states and 1708 transitions. [2020-02-10 20:21:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:46,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:46,870 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:21:46,871 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:21:46,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:21:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 375. [2020-02-10 20:21:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:21:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1288 transitions. [2020-02-10 20:21:46,879 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1288 transitions. Word has length 22 [2020-02-10 20:21:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:46,880 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1288 transitions. [2020-02-10 20:21:46,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1288 transitions. [2020-02-10 20:21:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:46,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:46,880 INFO L415 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] [2020-02-10 20:21:46,880 INFO L427 AbstractCegarLoop]: === Iteration 1483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash -290926944, now seen corresponding path program 1477 times [2020-02-10 20:21:46,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:46,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944814437] [2020-02-10 20:21:46,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:47,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944814437] [2020-02-10 20:21:47,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:47,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:47,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991859195] [2020-02-10 20:21:47,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:47,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:47,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:47,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:47,154 INFO L87 Difference]: Start difference. First operand 375 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:21:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:47,262 INFO L93 Difference]: Finished difference Result 582 states and 1699 transitions. [2020-02-10 20:21:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:47,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:47,263 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:21:47,263 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:21:47,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:21:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 379. [2020-02-10 20:21:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 20:21:47,273 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:47,273 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 20:21:47,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 20:21:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:47,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:47,273 INFO L415 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] [2020-02-10 20:21:47,273 INFO L427 AbstractCegarLoop]: === Iteration 1484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 270141548, now seen corresponding path program 1478 times [2020-02-10 20:21:47,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:47,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149689568] [2020-02-10 20:21:47,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:47,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149689568] [2020-02-10 20:21:47,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:47,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:47,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842204432] [2020-02-10 20:21:47,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:47,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:47,565 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:47,654 INFO L93 Difference]: Finished difference Result 575 states and 1684 transitions. [2020-02-10 20:21:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:47,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:47,656 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:21:47,656 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:21:47,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:21:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 377. [2020-02-10 20:21:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 20:21:47,665 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 20:21:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:47,665 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 20:21:47,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 20:21:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:47,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:47,666 INFO L415 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] [2020-02-10 20:21:47,666 INFO L427 AbstractCegarLoop]: === Iteration 1485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash -878672266, now seen corresponding path program 1479 times [2020-02-10 20:21:47,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:47,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002898065] [2020-02-10 20:21:47,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:47,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002898065] [2020-02-10 20:21:47,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:47,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:47,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094988647] [2020-02-10 20:21:47,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:47,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:47,945 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:21:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:48,054 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-02-10 20:21:48,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:48,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:48,056 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:21:48,056 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:21:48,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:21:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 382. [2020-02-10 20:21:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1300 transitions. [2020-02-10 20:21:48,065 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1300 transitions. Word has length 22 [2020-02-10 20:21:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:48,065 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1300 transitions. [2020-02-10 20:21:48,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1300 transitions. [2020-02-10 20:21:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:48,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:48,066 INFO L415 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] [2020-02-10 20:21:48,066 INFO L427 AbstractCegarLoop]: === Iteration 1486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1143244392, now seen corresponding path program 1480 times [2020-02-10 20:21:48,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:48,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980767557] [2020-02-10 20:21:48,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:48,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980767557] [2020-02-10 20:21:48,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:48,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:48,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523594993] [2020-02-10 20:21:48,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:48,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:48,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:48,343 INFO L87 Difference]: Start difference. First operand 382 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:21:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:48,449 INFO L93 Difference]: Finished difference Result 584 states and 1700 transitions. [2020-02-10 20:21:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:48,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:48,451 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:21:48,451 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:21:48,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:21:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 377. [2020-02-10 20:21:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 20:21:48,460 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 20:21:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:48,460 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 20:21:48,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 20:21:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:48,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:48,461 INFO L415 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] [2020-02-10 20:21:48,461 INFO L427 AbstractCegarLoop]: === Iteration 1487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash -823950040, now seen corresponding path program 1481 times [2020-02-10 20:21:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:48,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821815642] [2020-02-10 20:21:48,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:48,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821815642] [2020-02-10 20:21:48,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:48,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:48,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955472381] [2020-02-10 20:21:48,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:48,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:48,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:48,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:48,745 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:21:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:48,859 INFO L93 Difference]: Finished difference Result 570 states and 1673 transitions. [2020-02-10 20:21:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:48,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:48,861 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:21:48,861 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:21:48,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:21:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 378. [2020-02-10 20:21:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 20:21:48,870 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 20:21:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:48,870 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 20:21:48,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 20:21:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:48,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:48,870 INFO L415 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] [2020-02-10 20:21:48,871 INFO L427 AbstractCegarLoop]: === Iteration 1488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash -288720238, now seen corresponding path program 1482 times [2020-02-10 20:21:48,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:48,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874326518] [2020-02-10 20:21:48,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:49,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874326518] [2020-02-10 20:21:49,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:49,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:49,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403197377] [2020-02-10 20:21:49,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:49,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:49,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:49,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:49,151 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:21:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:49,273 INFO L93 Difference]: Finished difference Result 573 states and 1678 transitions. [2020-02-10 20:21:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:49,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:49,274 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:21:49,274 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:21:49,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:21:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-02-10 20:21:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:21:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1286 transitions. [2020-02-10 20:21:49,284 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1286 transitions. Word has length 22 [2020-02-10 20:21:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:49,284 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1286 transitions. [2020-02-10 20:21:49,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1286 transitions. [2020-02-10 20:21:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:49,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:49,285 INFO L415 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] [2020-02-10 20:21:49,285 INFO L427 AbstractCegarLoop]: === Iteration 1489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:49,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1928116290, now seen corresponding path program 1483 times [2020-02-10 20:21:49,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:49,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058468792] [2020-02-10 20:21:49,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:49,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058468792] [2020-02-10 20:21:49,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:49,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:49,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489100674] [2020-02-10 20:21:49,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:49,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:49,565 INFO L87 Difference]: Start difference. First operand 375 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:21:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:49,698 INFO L93 Difference]: Finished difference Result 562 states and 1658 transitions. [2020-02-10 20:21:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:49,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:49,700 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:21:49,700 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:21:49,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:21:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 377. [2020-02-10 20:21:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 20:21:49,708 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 20:21:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:49,708 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 20:21:49,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 20:21:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:49,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:49,709 INFO L415 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] [2020-02-10 20:21:49,709 INFO L427 AbstractCegarLoop]: === Iteration 1490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:49,709 INFO L82 PathProgramCache]: Analyzing trace with hash 921333996, now seen corresponding path program 1484 times [2020-02-10 20:21:49,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:49,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255357571] [2020-02-10 20:21:49,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:49,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255357571] [2020-02-10 20:21:49,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:49,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:49,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174606006] [2020-02-10 20:21:49,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:49,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:49,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:49,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:49,999 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:21:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:50,111 INFO L93 Difference]: Finished difference Result 560 states and 1653 transitions. [2020-02-10 20:21:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:50,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:50,113 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:21:50,113 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:21:50,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:21:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 376. [2020-02-10 20:21:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1288 transitions. [2020-02-10 20:21:50,121 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1288 transitions. Word has length 22 [2020-02-10 20:21:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:50,121 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1288 transitions. [2020-02-10 20:21:50,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1288 transitions. [2020-02-10 20:21:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:50,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:50,122 INFO L415 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] [2020-02-10 20:21:50,122 INFO L427 AbstractCegarLoop]: === Iteration 1491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1779105684, now seen corresponding path program 1485 times [2020-02-10 20:21:50,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:50,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558557961] [2020-02-10 20:21:50,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:50,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558557961] [2020-02-10 20:21:50,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:50,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:50,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742351025] [2020-02-10 20:21:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:50,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:50,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:50,403 INFO L87 Difference]: Start difference. First operand 376 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:21:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:50,519 INFO L93 Difference]: Finished difference Result 567 states and 1669 transitions. [2020-02-10 20:21:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:50,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:50,521 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:21:50,521 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:21:50,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:21:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-02-10 20:21:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1293 transitions. [2020-02-10 20:21:50,530 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1293 transitions. Word has length 22 [2020-02-10 20:21:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:50,530 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1293 transitions. [2020-02-10 20:21:50,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1293 transitions. [2020-02-10 20:21:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:50,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:50,531 INFO L415 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] [2020-02-10 20:21:50,531 INFO L427 AbstractCegarLoop]: === Iteration 1492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2081123628, now seen corresponding path program 1486 times [2020-02-10 20:21:50,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:50,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084179761] [2020-02-10 20:21:50,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:50,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084179761] [2020-02-10 20:21:50,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:50,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:50,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24737486] [2020-02-10 20:21:50,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:50,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:50,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:50,811 INFO L87 Difference]: Start difference. First operand 379 states and 1293 transitions. Second operand 9 states. [2020-02-10 20:21:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:50,941 INFO L93 Difference]: Finished difference Result 568 states and 1668 transitions. [2020-02-10 20:21:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:50,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:50,943 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:21:50,943 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:21:50,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:21:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 376. [2020-02-10 20:21:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1287 transitions. [2020-02-10 20:21:50,952 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1287 transitions. Word has length 22 [2020-02-10 20:21:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:50,952 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1287 transitions. [2020-02-10 20:21:50,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1287 transitions. [2020-02-10 20:21:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:50,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:50,953 INFO L415 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] [2020-02-10 20:21:50,953 INFO L427 AbstractCegarLoop]: === Iteration 1493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1266849180, now seen corresponding path program 1487 times [2020-02-10 20:21:50,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:50,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283405532] [2020-02-10 20:21:50,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:51,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283405532] [2020-02-10 20:21:51,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:51,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:51,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730391260] [2020-02-10 20:21:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:51,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:51,242 INFO L87 Difference]: Start difference. First operand 376 states and 1287 transitions. Second operand 9 states. [2020-02-10 20:21:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:51,353 INFO L93 Difference]: Finished difference Result 561 states and 1654 transitions. [2020-02-10 20:21:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:51,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:51,355 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:21:51,355 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:21:51,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:21:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 377. [2020-02-10 20:21:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:21:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 20:21:51,363 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 20:21:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:51,363 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 20:21:51,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 20:21:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:51,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:51,364 INFO L415 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] [2020-02-10 20:21:51,364 INFO L427 AbstractCegarLoop]: === Iteration 1494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:51,364 INFO L82 PathProgramCache]: Analyzing trace with hash -731619378, now seen corresponding path program 1488 times [2020-02-10 20:21:51,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:51,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110529208] [2020-02-10 20:21:51,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:51,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110529208] [2020-02-10 20:21:51,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:51,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:51,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367078781] [2020-02-10 20:21:51,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:51,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:51,638 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:21:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:51,772 INFO L93 Difference]: Finished difference Result 564 states and 1659 transitions. [2020-02-10 20:21:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:51,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:51,774 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:21:51,774 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:21:51,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:21:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 373. [2020-02-10 20:21:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:21:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1282 transitions. [2020-02-10 20:21:51,782 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1282 transitions. Word has length 22 [2020-02-10 20:21:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:51,782 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1282 transitions. [2020-02-10 20:21:51,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1282 transitions. [2020-02-10 20:21:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:51,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:51,783 INFO L415 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] [2020-02-10 20:21:51,783 INFO L427 AbstractCegarLoop]: === Iteration 1495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:51,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1828175184, now seen corresponding path program 1489 times [2020-02-10 20:21:51,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:51,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409615582] [2020-02-10 20:21:51,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:52,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409615582] [2020-02-10 20:21:52,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:52,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:52,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924099849] [2020-02-10 20:21:52,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:52,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:52,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:52,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:52,068 INFO L87 Difference]: Start difference. First operand 373 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:21:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:52,150 INFO L93 Difference]: Finished difference Result 596 states and 1746 transitions. [2020-02-10 20:21:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:52,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:52,152 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:21:52,152 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:21:52,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:21:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 383. [2020-02-10 20:21:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 20:21:52,162 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 20:21:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:52,162 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 20:21:52,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 20:21:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:52,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:52,163 INFO L415 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] [2020-02-10 20:21:52,163 INFO L427 AbstractCegarLoop]: === Iteration 1496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:52,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash -237909298, now seen corresponding path program 1490 times [2020-02-10 20:21:52,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:52,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326672263] [2020-02-10 20:21:52,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:52,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326672263] [2020-02-10 20:21:52,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:52,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:52,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651306819] [2020-02-10 20:21:52,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:52,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:52,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:52,456 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 20:21:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:52,584 INFO L93 Difference]: Finished difference Result 591 states and 1733 transitions. [2020-02-10 20:21:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:52,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:52,586 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:21:52,586 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:21:52,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:21:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 379. [2020-02-10 20:21:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 20:21:52,595 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:52,595 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 20:21:52,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 20:21:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:52,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:52,596 INFO L415 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] [2020-02-10 20:21:52,596 INFO L427 AbstractCegarLoop]: === Iteration 1497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1727263012, now seen corresponding path program 1491 times [2020-02-10 20:21:52,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:52,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025665671] [2020-02-10 20:21:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:52,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025665671] [2020-02-10 20:21:52,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:52,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:52,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538292008] [2020-02-10 20:21:52,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:52,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:52,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:52,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:52,877 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:52,983 INFO L93 Difference]: Finished difference Result 594 states and 1738 transitions. [2020-02-10 20:21:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:52,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:52,985 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:21:52,985 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:21:52,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:21:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 382. [2020-02-10 20:21:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 20:21:52,993 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 20:21:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:52,993 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 20:21:52,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 20:21:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:52,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:52,994 INFO L415 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] [2020-02-10 20:21:52,994 INFO L427 AbstractCegarLoop]: === Iteration 1498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1600626638, now seen corresponding path program 1492 times [2020-02-10 20:21:52,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:52,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634548305] [2020-02-10 20:21:52,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:53,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634548305] [2020-02-10 20:21:53,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:53,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:53,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886512550] [2020-02-10 20:21:53,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:53,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:53,272 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 20:21:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:53,404 INFO L93 Difference]: Finished difference Result 588 states and 1724 transitions. [2020-02-10 20:21:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:53,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:53,405 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:21:53,405 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:21:53,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:21:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-02-10 20:21:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 20:21:53,415 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 20:21:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:53,415 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 20:21:53,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 20:21:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:53,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:53,416 INFO L415 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] [2020-02-10 20:21:53,416 INFO L427 AbstractCegarLoop]: === Iteration 1499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash 279322490, now seen corresponding path program 1493 times [2020-02-10 20:21:53,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:53,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966948634] [2020-02-10 20:21:53,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:53,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966948634] [2020-02-10 20:21:53,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:53,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:53,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248026527] [2020-02-10 20:21:53,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:53,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:53,697 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:21:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:53,826 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2020-02-10 20:21:53,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:53,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:53,828 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:21:53,828 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:21:53,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:21:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-02-10 20:21:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 20:21:53,837 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:53,837 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 20:21:53,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 20:21:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:53,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:53,838 INFO L415 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] [2020-02-10 20:21:53,838 INFO L427 AbstractCegarLoop]: === Iteration 1500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1621255278, now seen corresponding path program 1494 times [2020-02-10 20:21:53,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:53,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369856517] [2020-02-10 20:21:53,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:54,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369856517] [2020-02-10 20:21:54,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:54,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:54,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985524609] [2020-02-10 20:21:54,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:54,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:54,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:54,124 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:54,234 INFO L93 Difference]: Finished difference Result 582 states and 1711 transitions. [2020-02-10 20:21:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:54,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:54,236 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:21:54,236 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:21:54,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:21:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-02-10 20:21:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1292 transitions. [2020-02-10 20:21:54,245 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1292 transitions. Word has length 22 [2020-02-10 20:21:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:54,245 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1292 transitions. [2020-02-10 20:21:54,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1292 transitions. [2020-02-10 20:21:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:54,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:54,246 INFO L415 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] [2020-02-10 20:21:54,246 INFO L427 AbstractCegarLoop]: === Iteration 1501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash 706739172, now seen corresponding path program 1495 times [2020-02-10 20:21:54,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:54,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271973553] [2020-02-10 20:21:54,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:54,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271973553] [2020-02-10 20:21:54,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:54,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:54,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470035922] [2020-02-10 20:21:54,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:54,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:54,525 INFO L87 Difference]: Start difference. First operand 376 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:21:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:54,607 INFO L93 Difference]: Finished difference Result 602 states and 1760 transitions. [2020-02-10 20:21:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:54,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:54,609 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:21:54,609 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:21:54,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:21:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 384. [2020-02-10 20:21:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-02-10 20:21:54,618 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-02-10 20:21:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:54,619 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-02-10 20:21:54,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-02-10 20:21:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:54,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:54,619 INFO L415 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] [2020-02-10 20:21:54,619 INFO L427 AbstractCegarLoop]: === Iteration 1502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1997962238, now seen corresponding path program 1496 times [2020-02-10 20:21:54,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:54,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830984491] [2020-02-10 20:21:54,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:54,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830984491] [2020-02-10 20:21:54,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:54,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:54,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809826547] [2020-02-10 20:21:54,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:54,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:54,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:54,906 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-02-10 20:21:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,003 INFO L93 Difference]: Finished difference Result 597 states and 1747 transitions. [2020-02-10 20:21:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:55,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,005 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:21:55,005 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:21:55,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:21:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 380. [2020-02-10 20:21:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 20:21:55,015 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 20:21:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,015 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 20:21:55,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 20:21:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:55,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,016 INFO L415 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] [2020-02-10 20:21:55,016 INFO L427 AbstractCegarLoop]: === Iteration 1503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash -641937580, now seen corresponding path program 1497 times [2020-02-10 20:21:55,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699147517] [2020-02-10 20:21:55,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:55,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699147517] [2020-02-10 20:21:55,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:55,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:55,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978651890] [2020-02-10 20:21:55,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:55,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:55,303 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 20:21:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,378 INFO L93 Difference]: Finished difference Result 604 states and 1761 transitions. [2020-02-10 20:21:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:55,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,380 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:21:55,380 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:21:55,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:21:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 385. [2020-02-10 20:21:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:21:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1310 transitions. [2020-02-10 20:21:55,388 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1310 transitions. Word has length 22 [2020-02-10 20:21:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,388 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1310 transitions. [2020-02-10 20:21:55,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1310 transitions. [2020-02-10 20:21:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:55,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,389 INFO L415 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] [2020-02-10 20:21:55,389 INFO L427 AbstractCegarLoop]: === Iteration 1504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1951701814, now seen corresponding path program 1498 times [2020-02-10 20:21:55,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467971046] [2020-02-10 20:21:55,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:55,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467971046] [2020-02-10 20:21:55,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:55,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:55,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942627843] [2020-02-10 20:21:55,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:55,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:55,670 INFO L87 Difference]: Start difference. First operand 385 states and 1310 transitions. Second operand 9 states. [2020-02-10 20:21:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,772 INFO L93 Difference]: Finished difference Result 600 states and 1749 transitions. [2020-02-10 20:21:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:55,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,774 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:21:55,774 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:21:55,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:21:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 380. [2020-02-10 20:21:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-02-10 20:21:55,784 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-02-10 20:21:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,784 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-02-10 20:21:55,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-02-10 20:21:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:55,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,784 INFO L415 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] [2020-02-10 20:21:55,784 INFO L427 AbstractCegarLoop]: === Iteration 1505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1857233994, now seen corresponding path program 1499 times [2020-02-10 20:21:55,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998575114] [2020-02-10 20:21:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:56,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998575114] [2020-02-10 20:21:56,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:56,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:56,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674557993] [2020-02-10 20:21:56,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:56,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:56,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:56,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:56,064 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:21:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:56,168 INFO L93 Difference]: Finished difference Result 592 states and 1734 transitions. [2020-02-10 20:21:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:56,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:56,170 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:21:56,170 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:21:56,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:21:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 383. [2020-02-10 20:21:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:21:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1303 transitions. [2020-02-10 20:21:56,180 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1303 transitions. Word has length 22 [2020-02-10 20:21:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:56,180 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1303 transitions. [2020-02-10 20:21:56,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1303 transitions. [2020-02-10 20:21:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:56,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:56,181 INFO L415 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] [2020-02-10 20:21:56,181 INFO L427 AbstractCegarLoop]: === Iteration 1506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -983493314, now seen corresponding path program 1500 times [2020-02-10 20:21:56,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:56,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034580673] [2020-02-10 20:21:56,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034580673] [2020-02-10 20:21:56,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:56,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:56,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065151755] [2020-02-10 20:21:56,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:56,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:56,463 INFO L87 Difference]: Start difference. First operand 383 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:21:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:56,565 INFO L93 Difference]: Finished difference Result 593 states and 1733 transitions. [2020-02-10 20:21:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:56,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:56,567 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:21:56,567 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:21:56,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:21:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-02-10 20:21:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1289 transitions. [2020-02-10 20:21:56,575 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1289 transitions. Word has length 22 [2020-02-10 20:21:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:56,575 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1289 transitions. [2020-02-10 20:21:56,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1289 transitions. [2020-02-10 20:21:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:56,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:56,576 INFO L415 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] [2020-02-10 20:21:56,576 INFO L427 AbstractCegarLoop]: === Iteration 1507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1969222452, now seen corresponding path program 1501 times [2020-02-10 20:21:56,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:56,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671134680] [2020-02-10 20:21:56,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:56,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671134680] [2020-02-10 20:21:56,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:56,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:56,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445381234] [2020-02-10 20:21:56,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:56,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:56,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:56,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:56,852 INFO L87 Difference]: Start difference. First operand 376 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:21:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:56,930 INFO L93 Difference]: Finished difference Result 596 states and 1740 transitions. [2020-02-10 20:21:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:56,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:56,932 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:21:56,932 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:21:56,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:21:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 382. [2020-02-10 20:21:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:21:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1303 transitions. [2020-02-10 20:21:56,941 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1303 transitions. Word has length 22 [2020-02-10 20:21:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:56,941 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1303 transitions. [2020-02-10 20:21:56,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1303 transitions. [2020-02-10 20:21:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:56,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:56,942 INFO L415 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] [2020-02-10 20:21:56,942 INFO L427 AbstractCegarLoop]: === Iteration 1508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:56,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2095858826, now seen corresponding path program 1502 times [2020-02-10 20:21:56,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:56,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124216934] [2020-02-10 20:21:56,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:57,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124216934] [2020-02-10 20:21:57,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:57,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:57,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475677404] [2020-02-10 20:21:57,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:57,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:57,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:57,210 INFO L87 Difference]: Start difference. First operand 382 states and 1303 transitions. Second operand 9 states. [2020-02-10 20:21:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:57,311 INFO L93 Difference]: Finished difference Result 590 states and 1726 transitions. [2020-02-10 20:21:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:57,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:57,313 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:21:57,313 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:21:57,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:21:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 20:21:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 20:21:57,325 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:57,325 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 20:21:57,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 20:21:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:57,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:57,326 INFO L415 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] [2020-02-10 20:21:57,326 INFO L427 AbstractCegarLoop]: === Iteration 1509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 893511296, now seen corresponding path program 1503 times [2020-02-10 20:21:57,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:57,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246954204] [2020-02-10 20:21:57,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:57,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246954204] [2020-02-10 20:21:57,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:57,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:57,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865254792] [2020-02-10 20:21:57,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:57,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:57,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:57,612 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:57,691 INFO L93 Difference]: Finished difference Result 600 states and 1747 transitions. [2020-02-10 20:21:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:57,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:57,693 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:21:57,693 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:21:57,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:21:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 20:21:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:21:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1304 transitions. [2020-02-10 20:21:57,702 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1304 transitions. Word has length 22 [2020-02-10 20:21:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:57,702 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1304 transitions. [2020-02-10 20:21:57,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1304 transitions. [2020-02-10 20:21:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:57,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:57,703 INFO L415 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] [2020-02-10 20:21:57,703 INFO L427 AbstractCegarLoop]: === Iteration 1510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:57,703 INFO L82 PathProgramCache]: Analyzing trace with hash 785011850, now seen corresponding path program 1504 times [2020-02-10 20:21:57,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:57,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902805129] [2020-02-10 20:21:57,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:57,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902805129] [2020-02-10 20:21:57,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:57,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:57,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766031390] [2020-02-10 20:21:57,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:57,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:57,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:57,982 INFO L87 Difference]: Start difference. First operand 384 states and 1304 transitions. Second operand 9 states. [2020-02-10 20:21:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:58,083 INFO L93 Difference]: Finished difference Result 596 states and 1735 transitions. [2020-02-10 20:21:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:58,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:58,085 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:21:58,085 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:21:58,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:21:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 379. [2020-02-10 20:21:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:21:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1293 transitions. [2020-02-10 20:21:58,094 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1293 transitions. Word has length 22 [2020-02-10 20:21:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:58,095 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1293 transitions. [2020-02-10 20:21:58,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1293 transitions. [2020-02-10 20:21:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:58,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:58,095 INFO L415 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] [2020-02-10 20:21:58,095 INFO L427 AbstractCegarLoop]: === Iteration 1511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1126023090, now seen corresponding path program 1505 times [2020-02-10 20:21:58,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:58,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024710074] [2020-02-10 20:21:58,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:58,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024710074] [2020-02-10 20:21:58,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:58,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:58,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012454479] [2020-02-10 20:21:58,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:58,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:58,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:58,365 INFO L87 Difference]: Start difference. First operand 379 states and 1293 transitions. Second operand 9 states. [2020-02-10 20:21:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:58,469 INFO L93 Difference]: Finished difference Result 585 states and 1714 transitions. [2020-02-10 20:21:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:58,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:58,470 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:21:58,471 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:21:58,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:21:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2020-02-10 20:21:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:21:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1296 transitions. [2020-02-10 20:21:58,479 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:58,479 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1296 transitions. [2020-02-10 20:21:58,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1296 transitions. [2020-02-10 20:21:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:58,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:58,479 INFO L415 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] [2020-02-10 20:21:58,480 INFO L427 AbstractCegarLoop]: === Iteration 1512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:58,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1299270782, now seen corresponding path program 1506 times [2020-02-10 20:21:58,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:58,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312610796] [2020-02-10 20:21:58,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:58,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312610796] [2020-02-10 20:21:58,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:58,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:58,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629195559] [2020-02-10 20:21:58,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:58,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:58,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:58,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:58,748 INFO L87 Difference]: Start difference. First operand 381 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:58,852 INFO L93 Difference]: Finished difference Result 587 states and 1716 transitions. [2020-02-10 20:21:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:58,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:58,853 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:21:58,853 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:21:58,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:21:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 376. [2020-02-10 20:21:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:21:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1286 transitions. [2020-02-10 20:21:58,863 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1286 transitions. Word has length 22 [2020-02-10 20:21:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:58,863 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1286 transitions. [2020-02-10 20:21:58,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1286 transitions. [2020-02-10 20:21:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:58,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:58,864 INFO L415 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] [2020-02-10 20:21:58,864 INFO L427 AbstractCegarLoop]: === Iteration 1513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 774932246, now seen corresponding path program 1507 times [2020-02-10 20:21:58,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:58,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526481540] [2020-02-10 20:21:58,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:59,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526481540] [2020-02-10 20:21:59,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:59,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:59,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477517380] [2020-02-10 20:21:59,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:59,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:59,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:59,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:59,145 INFO L87 Difference]: Start difference. First operand 376 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:21:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:59,245 INFO L93 Difference]: Finished difference Result 576 states and 1698 transitions. [2020-02-10 20:21:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:59,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:59,247 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:21:59,247 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:21:59,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:21:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 380. [2020-02-10 20:21:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:21:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1296 transitions. [2020-02-10 20:21:59,256 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1296 transitions. Word has length 22 [2020-02-10 20:21:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:59,256 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1296 transitions. [2020-02-10 20:21:59,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1296 transitions. [2020-02-10 20:21:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:59,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:59,257 INFO L415 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] [2020-02-10 20:21:59,257 INFO L427 AbstractCegarLoop]: === Iteration 1514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2116865034, now seen corresponding path program 1508 times [2020-02-10 20:21:59,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731783729] [2020-02-10 20:21:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:59,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731783729] [2020-02-10 20:21:59,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:59,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:59,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894587938] [2020-02-10 20:21:59,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:59,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:59,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:59,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:59,541 INFO L87 Difference]: Start difference. First operand 380 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:21:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:59,654 INFO L93 Difference]: Finished difference Result 575 states and 1694 transitions. [2020-02-10 20:21:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:21:59,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:21:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:59,655 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:21:59,656 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:21:59,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:21:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 378. [2020-02-10 20:21:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:21:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 20:21:59,665 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 20:21:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:59,665 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 20:21:59,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:21:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 20:21:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:21:59,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:59,665 INFO L415 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] [2020-02-10 20:21:59,666 INFO L427 AbstractCegarLoop]: === Iteration 1515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash -300778910, now seen corresponding path program 1509 times [2020-02-10 20:21:59,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:59,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70020863] [2020-02-10 20:21:59,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:59,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70020863] [2020-02-10 20:21:59,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:59,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:21:59,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093639947] [2020-02-10 20:21:59,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:21:59,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:21:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:21:59,952 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:22:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:00,052 INFO L93 Difference]: Finished difference Result 579 states and 1703 transitions. [2020-02-10 20:22:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:00,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:00,053 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:22:00,053 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:22:00,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:22:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 20:22:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:22:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1296 transitions. [2020-02-10 20:22:00,063 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1296 transitions. Word has length 22 [2020-02-10 20:22:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:00,063 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1296 transitions. [2020-02-10 20:22:00,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1296 transitions. [2020-02-10 20:22:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:00,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:00,064 INFO L415 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] [2020-02-10 20:22:00,064 INFO L427 AbstractCegarLoop]: === Iteration 1516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177070, now seen corresponding path program 1510 times [2020-02-10 20:22:00,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:00,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091733680] [2020-02-10 20:22:00,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:00,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091733680] [2020-02-10 20:22:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:00,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:00,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150778257] [2020-02-10 20:22:00,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:00,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:00,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:00,344 INFO L87 Difference]: Start difference. First operand 381 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:22:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:00,443 INFO L93 Difference]: Finished difference Result 580 states and 1702 transitions. [2020-02-10 20:22:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:00,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:00,444 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:00,444 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:22:00,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:22:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2020-02-10 20:22:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1289 transitions. [2020-02-10 20:22:00,454 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1289 transitions. Word has length 22 [2020-02-10 20:22:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:00,454 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1289 transitions. [2020-02-10 20:22:00,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1289 transitions. [2020-02-10 20:22:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:00,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:00,455 INFO L415 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] [2020-02-10 20:22:00,455 INFO L427 AbstractCegarLoop]: === Iteration 1517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash -31931502, now seen corresponding path program 1511 times [2020-02-10 20:22:00,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:00,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323313823] [2020-02-10 20:22:00,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:00,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323313823] [2020-02-10 20:22:00,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:00,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:00,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98165752] [2020-02-10 20:22:00,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:00,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:00,737 INFO L87 Difference]: Start difference. First operand 378 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:22:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:00,834 INFO L93 Difference]: Finished difference Result 576 states and 1694 transitions. [2020-02-10 20:22:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:00,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:00,836 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:22:00,836 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:22:00,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:22:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 380. [2020-02-10 20:22:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:22:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1292 transitions. [2020-02-10 20:22:00,845 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1292 transitions. Word has length 22 [2020-02-10 20:22:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:00,845 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1292 transitions. [2020-02-10 20:22:00,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1292 transitions. [2020-02-10 20:22:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:00,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:00,846 INFO L415 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] [2020-02-10 20:22:00,846 INFO L427 AbstractCegarLoop]: === Iteration 1518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash -205179194, now seen corresponding path program 1512 times [2020-02-10 20:22:00,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:00,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304600885] [2020-02-10 20:22:00,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304600885] [2020-02-10 20:22:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:01,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125027780] [2020-02-10 20:22:01,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:01,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:01,121 INFO L87 Difference]: Start difference. First operand 380 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:22:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:01,225 INFO L93 Difference]: Finished difference Result 578 states and 1696 transitions. [2020-02-10 20:22:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:01,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:01,227 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:01,227 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:22:01,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:22:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-02-10 20:22:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1280 transitions. [2020-02-10 20:22:01,235 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1280 transitions. Word has length 22 [2020-02-10 20:22:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:01,235 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1280 transitions. [2020-02-10 20:22:01,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1280 transitions. [2020-02-10 20:22:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:01,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:01,236 INFO L415 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] [2020-02-10 20:22:01,236 INFO L427 AbstractCegarLoop]: === Iteration 1519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2099117908, now seen corresponding path program 1513 times [2020-02-10 20:22:01,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:01,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465630060] [2020-02-10 20:22:01,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:01,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465630060] [2020-02-10 20:22:01,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:01,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:01,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308382567] [2020-02-10 20:22:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:01,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:01,521 INFO L87 Difference]: Start difference. First operand 373 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:22:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:01,596 INFO L93 Difference]: Finished difference Result 574 states and 1677 transitions. [2020-02-10 20:22:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:01,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:01,597 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:22:01,597 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:22:01,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:22:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 379. [2020-02-10 20:22:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 20:22:01,606 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 20:22:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:01,606 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 20:22:01,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 20:22:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:01,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:01,607 INFO L415 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] [2020-02-10 20:22:01,607 INFO L427 AbstractCegarLoop]: === Iteration 1520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1634780896, now seen corresponding path program 1514 times [2020-02-10 20:22:01,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:01,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67376908] [2020-02-10 20:22:01,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:01,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67376908] [2020-02-10 20:22:01,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:01,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:01,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559772058] [2020-02-10 20:22:01,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:01,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:01,885 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:22:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:01,960 INFO L93 Difference]: Finished difference Result 567 states and 1662 transitions. [2020-02-10 20:22:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:01,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:01,962 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:22:01,962 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:01,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2020-02-10 20:22:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 20:22:01,971 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 20:22:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:01,971 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 20:22:01,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 20:22:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:01,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:01,972 INFO L415 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] [2020-02-10 20:22:01,972 INFO L427 AbstractCegarLoop]: === Iteration 1521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash 498680054, now seen corresponding path program 1515 times [2020-02-10 20:22:01,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:01,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213333811] [2020-02-10 20:22:01,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:02,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213333811] [2020-02-10 20:22:02,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:02,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574880192] [2020-02-10 20:22:02,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:02,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:02,251 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:22:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:02,323 INFO L93 Difference]: Finished difference Result 576 states and 1680 transitions. [2020-02-10 20:22:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:02,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:02,325 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:22:02,325 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:02,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 380. [2020-02-10 20:22:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:22:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1296 transitions. [2020-02-10 20:22:02,334 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1296 transitions. Word has length 22 [2020-02-10 20:22:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:02,334 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1296 transitions. [2020-02-10 20:22:02,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1296 transitions. [2020-02-10 20:22:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:02,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:02,335 INFO L415 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] [2020-02-10 20:22:02,335 INFO L427 AbstractCegarLoop]: === Iteration 1522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:02,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -463523608, now seen corresponding path program 1516 times [2020-02-10 20:22:02,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:02,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135227173] [2020-02-10 20:22:02,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:02,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135227173] [2020-02-10 20:22:02,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:02,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:02,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854915656] [2020-02-10 20:22:02,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:02,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:02,615 INFO L87 Difference]: Start difference. First operand 380 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:22:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:02,711 INFO L93 Difference]: Finished difference Result 570 states and 1666 transitions. [2020-02-10 20:22:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:02,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:02,713 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:22:02,713 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:22:02,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:22:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 377. [2020-02-10 20:22:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 20:22:02,721 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 20:22:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:02,721 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 20:22:02,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 20:22:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:02,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:02,722 INFO L415 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] [2020-02-10 20:22:02,722 INFO L427 AbstractCegarLoop]: === Iteration 1523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash 553402280, now seen corresponding path program 1517 times [2020-02-10 20:22:02,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:02,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086559378] [2020-02-10 20:22:02,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:03,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086559378] [2020-02-10 20:22:03,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:03,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:03,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848958817] [2020-02-10 20:22:03,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:03,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:03,010 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:22:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:03,093 INFO L93 Difference]: Finished difference Result 560 states and 1647 transitions. [2020-02-10 20:22:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:03,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:03,095 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:22:03,095 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:22:03,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:22:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 378. [2020-02-10 20:22:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 20:22:03,104 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 20:22:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:03,104 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 20:22:03,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 20:22:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:03,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:03,104 INFO L415 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] [2020-02-10 20:22:03,104 INFO L427 AbstractCegarLoop]: === Iteration 1524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:03,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2130624058, now seen corresponding path program 1518 times [2020-02-10 20:22:03,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:03,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909671372] [2020-02-10 20:22:03,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:03,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909671372] [2020-02-10 20:22:03,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:03,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:03,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087998636] [2020-02-10 20:22:03,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:03,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:03,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:03,387 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:22:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:03,499 INFO L93 Difference]: Finished difference Result 561 states and 1648 transitions. [2020-02-10 20:22:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:03,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:03,500 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:22:03,500 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:22:03,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:22:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 375. [2020-02-10 20:22:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1286 transitions. [2020-02-10 20:22:03,509 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:03,509 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1286 transitions. [2020-02-10 20:22:03,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1286 transitions. [2020-02-10 20:22:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:03,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:03,510 INFO L415 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] [2020-02-10 20:22:03,510 INFO L427 AbstractCegarLoop]: === Iteration 1525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash -867151968, now seen corresponding path program 1519 times [2020-02-10 20:22:03,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:03,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630949928] [2020-02-10 20:22:03,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:03,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630949928] [2020-02-10 20:22:03,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:03,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029494185] [2020-02-10 20:22:03,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:03,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:03,791 INFO L87 Difference]: Start difference. First operand 375 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:03,864 INFO L93 Difference]: Finished difference Result 578 states and 1685 transitions. [2020-02-10 20:22:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:03,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:03,866 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:03,866 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:03,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 379. [2020-02-10 20:22:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1294 transitions. [2020-02-10 20:22:03,875 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1294 transitions. Word has length 22 [2020-02-10 20:22:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:03,875 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1294 transitions. [2020-02-10 20:22:03,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1294 transitions. [2020-02-10 20:22:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:03,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:03,876 INFO L415 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] [2020-02-10 20:22:03,876 INFO L427 AbstractCegarLoop]: === Iteration 1526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash -306083476, now seen corresponding path program 1520 times [2020-02-10 20:22:03,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:03,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595062542] [2020-02-10 20:22:03,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:04,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595062542] [2020-02-10 20:22:04,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:04,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:04,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157753466] [2020-02-10 20:22:04,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:04,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:04,155 INFO L87 Difference]: Start difference. First operand 379 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:22:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,229 INFO L93 Difference]: Finished difference Result 571 states and 1670 transitions. [2020-02-10 20:22:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:04,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,230 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:22:04,230 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:04,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 377. [2020-02-10 20:22:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 20:22:04,238 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 20:22:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,238 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 20:22:04,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 20:22:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:04,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,239 INFO L415 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] [2020-02-10 20:22:04,239 INFO L427 AbstractCegarLoop]: === Iteration 1527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1454897290, now seen corresponding path program 1521 times [2020-02-10 20:22:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774913022] [2020-02-10 20:22:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:04,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774913022] [2020-02-10 20:22:04,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:04,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992983317] [2020-02-10 20:22:04,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:04,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:04,522 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:22:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,593 INFO L93 Difference]: Finished difference Result 584 states and 1698 transitions. [2020-02-10 20:22:04,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:04,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,595 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:22:04,595 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:22:04,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:22:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-02-10 20:22:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:22:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1298 transitions. [2020-02-10 20:22:04,603 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1298 transitions. Word has length 22 [2020-02-10 20:22:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,603 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1298 transitions. [2020-02-10 20:22:04,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1298 transitions. [2020-02-10 20:22:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:04,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,604 INFO L415 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] [2020-02-10 20:22:04,604 INFO L427 AbstractCegarLoop]: === Iteration 1528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash 567019368, now seen corresponding path program 1522 times [2020-02-10 20:22:04,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085209749] [2020-02-10 20:22:04,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:04,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085209749] [2020-02-10 20:22:04,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:04,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:04,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050616632] [2020-02-10 20:22:04,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:04,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:04,881 INFO L87 Difference]: Start difference. First operand 382 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:22:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,986 INFO L93 Difference]: Finished difference Result 580 states and 1686 transitions. [2020-02-10 20:22:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:04,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,988 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:04,988 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:22:04,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:22:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 377. [2020-02-10 20:22:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 20:22:04,997 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 20:22:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,997 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 20:22:04,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 20:22:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:04,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,998 INFO L415 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] [2020-02-10 20:22:04,998 INFO L427 AbstractCegarLoop]: === Iteration 1529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1400175064, now seen corresponding path program 1523 times [2020-02-10 20:22:04,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727413157] [2020-02-10 20:22:04,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:05,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727413157] [2020-02-10 20:22:05,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:05,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:05,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001784574] [2020-02-10 20:22:05,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:05,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:05,280 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:22:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:05,353 INFO L93 Difference]: Finished difference Result 566 states and 1659 transitions. [2020-02-10 20:22:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:05,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:05,355 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:22:05,355 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:22:05,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:22:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 378. [2020-02-10 20:22:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1289 transitions. [2020-02-10 20:22:05,364 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1289 transitions. Word has length 22 [2020-02-10 20:22:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:05,365 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1289 transitions. [2020-02-10 20:22:05,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1289 transitions. [2020-02-10 20:22:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:05,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:05,365 INFO L415 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] [2020-02-10 20:22:05,365 INFO L427 AbstractCegarLoop]: === Iteration 1530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash -864945262, now seen corresponding path program 1524 times [2020-02-10 20:22:05,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:05,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791891674] [2020-02-10 20:22:05,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:05,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791891674] [2020-02-10 20:22:05,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:05,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:05,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305009416] [2020-02-10 20:22:05,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:05,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:05,641 INFO L87 Difference]: Start difference. First operand 378 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:22:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:05,739 INFO L93 Difference]: Finished difference Result 569 states and 1664 transitions. [2020-02-10 20:22:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:05,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:05,741 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:22:05,741 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:22:05,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:22:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 375. [2020-02-10 20:22:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1284 transitions. [2020-02-10 20:22:05,749 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1284 transitions. Word has length 22 [2020-02-10 20:22:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:05,750 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1284 transitions. [2020-02-10 20:22:05,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1284 transitions. [2020-02-10 20:22:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:05,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:05,750 INFO L415 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] [2020-02-10 20:22:05,750 INFO L427 AbstractCegarLoop]: === Iteration 1531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash -541555744, now seen corresponding path program 1525 times [2020-02-10 20:22:05,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:05,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888076652] [2020-02-10 20:22:05,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:06,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888076652] [2020-02-10 20:22:06,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:06,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:06,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665442193] [2020-02-10 20:22:06,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:06,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:06,028 INFO L87 Difference]: Start difference. First operand 375 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:22:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:06,100 INFO L93 Difference]: Finished difference Result 584 states and 1700 transitions. [2020-02-10 20:22:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:06,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:06,101 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:22:06,102 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:22:06,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:22:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 20:22:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:22:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-02-10 20:22:06,110 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-02-10 20:22:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:06,110 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-02-10 20:22:06,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-02-10 20:22:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:06,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:06,111 INFO L415 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] [2020-02-10 20:22:06,111 INFO L427 AbstractCegarLoop]: === Iteration 1532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1503759406, now seen corresponding path program 1526 times [2020-02-10 20:22:06,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:06,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724373679] [2020-02-10 20:22:06,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:06,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:06,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724373679] [2020-02-10 20:22:06,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:06,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:06,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627702166] [2020-02-10 20:22:06,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:06,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:06,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:06,383 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:22:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:06,477 INFO L93 Difference]: Finished difference Result 578 states and 1686 transitions. [2020-02-10 20:22:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:06,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:06,479 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:06,479 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:22:06,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:22:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2020-02-10 20:22:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 20:22:06,488 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 20:22:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:06,488 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 20:22:06,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 20:22:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:06,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:06,489 INFO L415 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] [2020-02-10 20:22:06,489 INFO L427 AbstractCegarLoop]: === Iteration 1533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash 471136788, now seen corresponding path program 1527 times [2020-02-10 20:22:06,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:06,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261102898] [2020-02-10 20:22:06,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:06,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261102898] [2020-02-10 20:22:06,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:06,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:06,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571711144] [2020-02-10 20:22:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:06,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:06,775 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:22:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:06,849 INFO L93 Difference]: Finished difference Result 588 states and 1707 transitions. [2020-02-10 20:22:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:06,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:06,850 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:22:06,850 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:22:06,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:22:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2020-02-10 20:22:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:22:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1299 transitions. [2020-02-10 20:22:06,859 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1299 transitions. Word has length 22 [2020-02-10 20:22:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:06,859 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1299 transitions. [2020-02-10 20:22:06,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1299 transitions. [2020-02-10 20:22:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:06,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:06,860 INFO L415 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] [2020-02-10 20:22:06,860 INFO L427 AbstractCegarLoop]: === Iteration 1534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:06,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1801913850, now seen corresponding path program 1528 times [2020-02-10 20:22:06,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:06,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65080208] [2020-02-10 20:22:06,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:07,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65080208] [2020-02-10 20:22:07,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:07,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:07,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276954109] [2020-02-10 20:22:07,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:07,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:07,140 INFO L87 Difference]: Start difference. First operand 383 states and 1299 transitions. Second operand 9 states. [2020-02-10 20:22:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:07,239 INFO L93 Difference]: Finished difference Result 584 states and 1695 transitions. [2020-02-10 20:22:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:07,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:07,241 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:22:07,241 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:22:07,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:22:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-02-10 20:22:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 20:22:07,250 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 20:22:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:07,250 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 20:22:07,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 20:22:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:07,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:07,251 INFO L415 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] [2020-02-10 20:22:07,251 INFO L427 AbstractCegarLoop]: === Iteration 1535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1187715758, now seen corresponding path program 1529 times [2020-02-10 20:22:07,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:07,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798316069] [2020-02-10 20:22:07,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798316069] [2020-02-10 20:22:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:07,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:07,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402306494] [2020-02-10 20:22:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:07,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:07,524 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:22:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:07,633 INFO L93 Difference]: Finished difference Result 573 states and 1674 transitions. [2020-02-10 20:22:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:07,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:07,635 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:22:07,635 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:22:07,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:22:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-02-10 20:22:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:22:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1291 transitions. [2020-02-10 20:22:07,644 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1291 transitions. Word has length 22 [2020-02-10 20:22:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:07,645 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1291 transitions. [2020-02-10 20:22:07,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1291 transitions. [2020-02-10 20:22:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:07,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:07,645 INFO L415 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] [2020-02-10 20:22:07,646 INFO L427 AbstractCegarLoop]: === Iteration 1536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1014468066, now seen corresponding path program 1530 times [2020-02-10 20:22:07,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:07,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811435626] [2020-02-10 20:22:07,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:07,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811435626] [2020-02-10 20:22:07,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:07,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:07,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739009359] [2020-02-10 20:22:07,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:07,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:07,924 INFO L87 Difference]: Start difference. First operand 380 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:22:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:08,028 INFO L93 Difference]: Finished difference Result 575 states and 1676 transitions. [2020-02-10 20:22:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:08,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:08,030 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:22:08,030 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:22:08,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:22:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-02-10 20:22:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-02-10 20:22:08,038 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:08,038 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-02-10 20:22:08,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-02-10 20:22:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:08,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:08,039 INFO L415 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] [2020-02-10 20:22:08,039 INFO L427 AbstractCegarLoop]: === Iteration 1537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 996301420, now seen corresponding path program 1531 times [2020-02-10 20:22:08,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:08,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966842054] [2020-02-10 20:22:08,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:08,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966842054] [2020-02-10 20:22:08,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:08,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913723573] [2020-02-10 20:22:08,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:08,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:08,333 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:08,411 INFO L93 Difference]: Finished difference Result 553 states and 1631 transitions. [2020-02-10 20:22:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:08,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:08,412 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:22:08,412 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:22:08,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:22:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 377. [2020-02-10 20:22:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1286 transitions. [2020-02-10 20:22:08,421 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:08,421 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1286 transitions. [2020-02-10 20:22:08,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1286 transitions. [2020-02-10 20:22:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:08,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:08,421 INFO L415 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] [2020-02-10 20:22:08,421 INFO L427 AbstractCegarLoop]: === Iteration 1538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:08,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1687724918, now seen corresponding path program 1532 times [2020-02-10 20:22:08,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:08,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022232534] [2020-02-10 20:22:08,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:08,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022232534] [2020-02-10 20:22:08,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:08,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:08,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123463679] [2020-02-10 20:22:08,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:08,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:08,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:08,712 INFO L87 Difference]: Start difference. First operand 377 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:08,815 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-02-10 20:22:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:08,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:08,817 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:22:08,817 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:22:08,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:22:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 376. [2020-02-10 20:22:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1284 transitions. [2020-02-10 20:22:08,825 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1284 transitions. Word has length 22 [2020-02-10 20:22:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:08,825 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1284 transitions. [2020-02-10 20:22:08,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1284 transitions. [2020-02-10 20:22:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:08,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:08,826 INFO L415 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] [2020-02-10 20:22:08,826 INFO L427 AbstractCegarLoop]: === Iteration 1539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2008993952, now seen corresponding path program 1533 times [2020-02-10 20:22:08,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:08,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862622390] [2020-02-10 20:22:08,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:09,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862622390] [2020-02-10 20:22:09,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:09,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:09,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727791456] [2020-02-10 20:22:09,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:09,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:09,111 INFO L87 Difference]: Start difference. First operand 376 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:22:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:09,190 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 20:22:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:09,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:09,191 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:22:09,191 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:22:09,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:22:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 377. [2020-02-10 20:22:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1285 transitions. [2020-02-10 20:22:09,200 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1285 transitions. Word has length 22 [2020-02-10 20:22:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:09,200 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1285 transitions. [2020-02-10 20:22:09,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1285 transitions. [2020-02-10 20:22:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:09,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:09,201 INFO L415 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] [2020-02-10 20:22:09,201 INFO L427 AbstractCegarLoop]: === Iteration 1540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1750743542, now seen corresponding path program 1534 times [2020-02-10 20:22:09,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:09,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511966472] [2020-02-10 20:22:09,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:09,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511966472] [2020-02-10 20:22:09,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:09,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:09,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168734421] [2020-02-10 20:22:09,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:09,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:09,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:09,477 INFO L87 Difference]: Start difference. First operand 377 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:22:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:09,589 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-02-10 20:22:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:09,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:09,590 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:22:09,590 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:22:09,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:22:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 376. [2020-02-10 20:22:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 20:22:09,599 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:09,599 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 20:22:09,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 20:22:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:09,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:09,600 INFO L415 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] [2020-02-10 20:22:09,600 INFO L427 AbstractCegarLoop]: === Iteration 1541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2019497056, now seen corresponding path program 1535 times [2020-02-10 20:22:09,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:09,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485021909] [2020-02-10 20:22:09,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:09,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485021909] [2020-02-10 20:22:09,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:09,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:09,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667615208] [2020-02-10 20:22:09,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:09,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:09,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:09,881 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:09,979 INFO L93 Difference]: Finished difference Result 558 states and 1640 transitions. [2020-02-10 20:22:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:09,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:09,981 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:22:09,981 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:22:09,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:22:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 378. [2020-02-10 20:22:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 20:22:09,989 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:09,989 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 20:22:09,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 20:22:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:09,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:09,990 INFO L415 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] [2020-02-10 20:22:09,990 INFO L427 AbstractCegarLoop]: === Iteration 1542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 943785900, now seen corresponding path program 1536 times [2020-02-10 20:22:09,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:09,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141609607] [2020-02-10 20:22:09,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:10,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141609607] [2020-02-10 20:22:10,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:10,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:10,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419085197] [2020-02-10 20:22:10,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:10,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:10,273 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:10,376 INFO L93 Difference]: Finished difference Result 560 states and 1642 transitions. [2020-02-10 20:22:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:10,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:10,377 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:22:10,378 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:22:10,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:22:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 373. [2020-02-10 20:22:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-02-10 20:22:10,386 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:10,386 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-02-10 20:22:10,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-02-10 20:22:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:10,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:10,387 INFO L415 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] [2020-02-10 20:22:10,387 INFO L427 AbstractCegarLoop]: === Iteration 1543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash -383042890, now seen corresponding path program 1537 times [2020-02-10 20:22:10,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:10,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181511979] [2020-02-10 20:22:10,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:10,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181511979] [2020-02-10 20:22:10,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:10,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:10,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938691021] [2020-02-10 20:22:10,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:10,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:10,679 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:10,779 INFO L93 Difference]: Finished difference Result 542 states and 1608 transitions. [2020-02-10 20:22:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:10,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:10,781 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:22:10,781 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:22:10,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:22:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 376. [2020-02-10 20:22:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1286 transitions. [2020-02-10 20:22:10,790 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:10,790 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1286 transitions. [2020-02-10 20:22:10,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1286 transitions. [2020-02-10 20:22:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:10,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:10,791 INFO L415 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] [2020-02-10 20:22:10,791 INFO L427 AbstractCegarLoop]: === Iteration 1544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1828559900, now seen corresponding path program 1538 times [2020-02-10 20:22:10,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:10,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479174530] [2020-02-10 20:22:10,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:11,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479174530] [2020-02-10 20:22:11,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:11,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:11,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330906172] [2020-02-10 20:22:11,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:11,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:11,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:11,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:11,088 INFO L87 Difference]: Start difference. First operand 376 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:11,167 INFO L93 Difference]: Finished difference Result 540 states and 1603 transitions. [2020-02-10 20:22:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:11,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:11,168 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:22:11,168 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:22:11,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:22:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 375. [2020-02-10 20:22:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1284 transitions. [2020-02-10 20:22:11,177 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1284 transitions. Word has length 22 [2020-02-10 20:22:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:11,177 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1284 transitions. [2020-02-10 20:22:11,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1284 transitions. [2020-02-10 20:22:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:11,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:11,177 INFO L415 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] [2020-02-10 20:22:11,178 INFO L427 AbstractCegarLoop]: === Iteration 1545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1983480744, now seen corresponding path program 1539 times [2020-02-10 20:22:11,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:11,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614828472] [2020-02-10 20:22:11,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:11,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614828472] [2020-02-10 20:22:11,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:11,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:11,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211770541] [2020-02-10 20:22:11,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:11,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:11,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:11,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:11,469 INFO L87 Difference]: Start difference. First operand 375 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:22:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:11,568 INFO L93 Difference]: Finished difference Result 544 states and 1612 transitions. [2020-02-10 20:22:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:11,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:11,569 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:22:11,570 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:22:11,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:22:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 377. [2020-02-10 20:22:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1287 transitions. [2020-02-10 20:22:11,578 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1287 transitions. Word has length 22 [2020-02-10 20:22:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:11,578 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1287 transitions. [2020-02-10 20:22:11,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1287 transitions. [2020-02-10 20:22:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:11,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:11,579 INFO L415 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] [2020-02-10 20:22:11,579 INFO L427 AbstractCegarLoop]: === Iteration 1546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1730387992, now seen corresponding path program 1540 times [2020-02-10 20:22:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:11,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966627269] [2020-02-10 20:22:11,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:11,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966627269] [2020-02-10 20:22:11,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:11,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:11,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173305376] [2020-02-10 20:22:11,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:11,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:11,869 INFO L87 Difference]: Start difference. First operand 377 states and 1287 transitions. Second operand 9 states. [2020-02-10 20:22:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:11,971 INFO L93 Difference]: Finished difference Result 543 states and 1608 transitions. [2020-02-10 20:22:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:11,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:11,973 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:22:11,973 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:22:11,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:22:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 375. [2020-02-10 20:22:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1283 transitions. [2020-02-10 20:22:11,983 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:11,983 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1283 transitions. [2020-02-10 20:22:11,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1283 transitions. [2020-02-10 20:22:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:11,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:11,984 INFO L415 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] [2020-02-10 20:22:11,984 INFO L427 AbstractCegarLoop]: === Iteration 1547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash -734468312, now seen corresponding path program 1541 times [2020-02-10 20:22:11,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:11,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258583776] [2020-02-10 20:22:11,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:12,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258583776] [2020-02-10 20:22:12,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:12,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:12,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180612482] [2020-02-10 20:22:12,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:12,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:12,288 INFO L87 Difference]: Start difference. First operand 375 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:12,362 INFO L93 Difference]: Finished difference Result 539 states and 1600 transitions. [2020-02-10 20:22:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:12,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:12,364 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:22:12,364 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:22:12,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:22:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 376. [2020-02-10 20:22:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1284 transitions. [2020-02-10 20:22:12,373 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1284 transitions. Word has length 22 [2020-02-10 20:22:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:12,373 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1284 transitions. [2020-02-10 20:22:12,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1284 transitions. [2020-02-10 20:22:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:12,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:12,374 INFO L415 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] [2020-02-10 20:22:12,374 INFO L427 AbstractCegarLoop]: === Iteration 1548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash 876472646, now seen corresponding path program 1542 times [2020-02-10 20:22:12,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:12,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932471057] [2020-02-10 20:22:12,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:12,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932471057] [2020-02-10 20:22:12,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:12,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:12,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040957354] [2020-02-10 20:22:12,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:12,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:12,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:12,673 INFO L87 Difference]: Start difference. First operand 376 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:22:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:12,774 INFO L93 Difference]: Finished difference Result 540 states and 1601 transitions. [2020-02-10 20:22:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:12,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:12,776 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:22:12,776 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:22:12,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:22:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 374. [2020-02-10 20:22:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1281 transitions. [2020-02-10 20:22:12,784 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1281 transitions. Word has length 22 [2020-02-10 20:22:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:12,784 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1281 transitions. [2020-02-10 20:22:12,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1281 transitions. [2020-02-10 20:22:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:12,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:12,785 INFO L415 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] [2020-02-10 20:22:12,785 INFO L427 AbstractCegarLoop]: === Iteration 1549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash 945654530, now seen corresponding path program 1543 times [2020-02-10 20:22:12,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:12,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264003293] [2020-02-10 20:22:12,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:13,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264003293] [2020-02-10 20:22:13,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:13,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:13,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018021993] [2020-02-10 20:22:13,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:13,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:13,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:13,088 INFO L87 Difference]: Start difference. First operand 374 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:22:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:13,187 INFO L93 Difference]: Finished difference Result 545 states and 1614 transitions. [2020-02-10 20:22:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:13,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:13,188 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:22:13,188 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:22:13,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:22:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 376. [2020-02-10 20:22:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 20:22:13,198 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 20:22:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:13,198 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 20:22:13,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 20:22:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:13,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:13,199 INFO L415 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] [2020-02-10 20:22:13,199 INFO L427 AbstractCegarLoop]: === Iteration 1550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash -499862480, now seen corresponding path program 1544 times [2020-02-10 20:22:13,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:13,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551904770] [2020-02-10 20:22:13,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:13,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551904770] [2020-02-10 20:22:13,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:13,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:13,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835799963] [2020-02-10 20:22:13,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:13,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:13,490 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:22:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:13,572 INFO L93 Difference]: Finished difference Result 543 states and 1609 transitions. [2020-02-10 20:22:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:13,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:13,574 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:22:13,574 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:22:13,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:22:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 375. [2020-02-10 20:22:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1283 transitions. [2020-02-10 20:22:13,583 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:13,583 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1283 transitions. [2020-02-10 20:22:13,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1283 transitions. [2020-02-10 20:22:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:13,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:13,584 INFO L415 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] [2020-02-10 20:22:13,584 INFO L427 AbstractCegarLoop]: === Iteration 1551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash 357909208, now seen corresponding path program 1545 times [2020-02-10 20:22:13,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:13,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113471291] [2020-02-10 20:22:13,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:13,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113471291] [2020-02-10 20:22:13,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:13,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:13,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460928352] [2020-02-10 20:22:13,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:13,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:13,871 INFO L87 Difference]: Start difference. First operand 375 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:13,974 INFO L93 Difference]: Finished difference Result 550 states and 1625 transitions. [2020-02-10 20:22:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:13,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:13,975 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:22:13,975 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:22:13,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:22:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 378. [2020-02-10 20:22:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 20:22:13,985 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 20:22:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:13,985 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 20:22:13,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 20:22:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:13,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:13,986 INFO L415 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] [2020-02-10 20:22:13,986 INFO L427 AbstractCegarLoop]: === Iteration 1552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash 659927152, now seen corresponding path program 1546 times [2020-02-10 20:22:13,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:13,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349566659] [2020-02-10 20:22:13,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:14,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349566659] [2020-02-10 20:22:14,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:14,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:14,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965816470] [2020-02-10 20:22:14,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:14,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:14,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:14,274 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:22:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:14,402 INFO L93 Difference]: Finished difference Result 551 states and 1624 transitions. [2020-02-10 20:22:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:14,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:14,404 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:22:14,404 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 20:22:14,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 20:22:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 375. [2020-02-10 20:22:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-02-10 20:22:14,413 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:14,414 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-02-10 20:22:14,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-02-10 20:22:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:14,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:14,414 INFO L415 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] [2020-02-10 20:22:14,414 INFO L427 AbstractCegarLoop]: === Iteration 1553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1606921640, now seen corresponding path program 1547 times [2020-02-10 20:22:14,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:14,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401139998] [2020-02-10 20:22:14,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:14,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401139998] [2020-02-10 20:22:14,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:14,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:14,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432281272] [2020-02-10 20:22:14,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:14,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:14,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:14,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:14,703 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:14,806 INFO L93 Difference]: Finished difference Result 544 states and 1610 transitions. [2020-02-10 20:22:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:14,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:14,808 INFO L225 Difference]: With dead ends: 544 [2020-02-10 20:22:14,808 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:22:14,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:22:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 376. [2020-02-10 20:22:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 20:22:14,817 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:14,817 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 20:22:14,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 20:22:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:14,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:14,817 INFO L415 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] [2020-02-10 20:22:14,818 INFO L427 AbstractCegarLoop]: === Iteration 1554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2142151442, now seen corresponding path program 1548 times [2020-02-10 20:22:14,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:14,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323527126] [2020-02-10 20:22:14,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:15,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323527126] [2020-02-10 20:22:15,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:15,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:15,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706525403] [2020-02-10 20:22:15,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:15,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:15,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:15,100 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:15,200 INFO L93 Difference]: Finished difference Result 547 states and 1615 transitions. [2020-02-10 20:22:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:15,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:15,202 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:22:15,202 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:22:15,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:22:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 374. [2020-02-10 20:22:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1280 transitions. [2020-02-10 20:22:15,211 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1280 transitions. Word has length 22 [2020-02-10 20:22:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:15,211 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1280 transitions. [2020-02-10 20:22:15,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1280 transitions. [2020-02-10 20:22:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:15,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:15,211 INFO L415 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] [2020-02-10 20:22:15,212 INFO L427 AbstractCegarLoop]: === Iteration 1555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1271250754, now seen corresponding path program 1549 times [2020-02-10 20:22:15,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:15,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924832105] [2020-02-10 20:22:15,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:15,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924832105] [2020-02-10 20:22:15,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:15,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:15,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440417556] [2020-02-10 20:22:15,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:15,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:15,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:15,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:15,504 INFO L87 Difference]: Start difference. First operand 374 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:22:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:15,604 INFO L93 Difference]: Finished difference Result 551 states and 1630 transitions. [2020-02-10 20:22:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:15,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:15,606 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:22:15,606 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:22:15,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:22:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 378. [2020-02-10 20:22:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1290 transitions. [2020-02-10 20:22:15,616 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1290 transitions. Word has length 22 [2020-02-10 20:22:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:15,616 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1290 transitions. [2020-02-10 20:22:15,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1290 transitions. [2020-02-10 20:22:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:15,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:15,617 INFO L415 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] [2020-02-10 20:22:15,617 INFO L427 AbstractCegarLoop]: === Iteration 1556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1524343506, now seen corresponding path program 1550 times [2020-02-10 20:22:15,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:15,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444756288] [2020-02-10 20:22:15,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:15,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444756288] [2020-02-10 20:22:15,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:15,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:15,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000186371] [2020-02-10 20:22:15,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:15,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:15,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:15,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:15,914 INFO L87 Difference]: Start difference. First operand 378 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:22:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:16,014 INFO L93 Difference]: Finished difference Result 550 states and 1626 transitions. [2020-02-10 20:22:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:16,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:16,015 INFO L225 Difference]: With dead ends: 550 [2020-02-10 20:22:16,015 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:22:16,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:22:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 376. [2020-02-10 20:22:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 20:22:16,024 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 20:22:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:16,025 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 20:22:16,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 20:22:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:16,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:16,025 INFO L415 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] [2020-02-10 20:22:16,025 INFO L427 AbstractCegarLoop]: === Iteration 1557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2011024010, now seen corresponding path program 1551 times [2020-02-10 20:22:16,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:16,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729903850] [2020-02-10 20:22:16,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:16,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729903850] [2020-02-10 20:22:16,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:16,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:16,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785716037] [2020-02-10 20:22:16,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:16,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:16,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:16,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:16,310 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:22:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:16,413 INFO L93 Difference]: Finished difference Result 554 states and 1635 transitions. [2020-02-10 20:22:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:16,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:16,415 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:22:16,415 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:22:16,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:22:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2020-02-10 20:22:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-02-10 20:22:16,424 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-02-10 20:22:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:16,424 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-02-10 20:22:16,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-02-10 20:22:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:16,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:16,425 INFO L415 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] [2020-02-10 20:22:16,425 INFO L427 AbstractCegarLoop]: === Iteration 1558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1709006066, now seen corresponding path program 1552 times [2020-02-10 20:22:16,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:16,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301050064] [2020-02-10 20:22:16,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:16,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301050064] [2020-02-10 20:22:16,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:16,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:16,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535493961] [2020-02-10 20:22:16,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:16,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:16,720 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:22:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:16,824 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 20:22:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:16,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:16,826 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:22:16,826 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:22:16,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:22:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 376. [2020-02-10 20:22:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 20:22:16,835 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:16,835 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 20:22:16,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 20:22:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:16,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:16,835 INFO L415 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] [2020-02-10 20:22:16,835 INFO L427 AbstractCegarLoop]: === Iteration 1559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 993936754, now seen corresponding path program 1553 times [2020-02-10 20:22:16,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:16,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533912603] [2020-02-10 20:22:16,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533912603] [2020-02-10 20:22:17,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:17,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40872884] [2020-02-10 20:22:17,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:17,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:17,118 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:17,218 INFO L93 Difference]: Finished difference Result 551 states and 1626 transitions. [2020-02-10 20:22:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:17,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:17,219 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:22:17,219 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:22:17,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:22:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 378. [2020-02-10 20:22:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 20:22:17,228 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:17,228 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 20:22:17,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 20:22:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:17,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:17,229 INFO L415 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] [2020-02-10 20:22:17,229 INFO L427 AbstractCegarLoop]: === Iteration 1560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash 820689062, now seen corresponding path program 1554 times [2020-02-10 20:22:17,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:17,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828319236] [2020-02-10 20:22:17,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828319236] [2020-02-10 20:22:17,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:17,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65322860] [2020-02-10 20:22:17,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:17,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:17,513 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:17,620 INFO L93 Difference]: Finished difference Result 553 states and 1628 transitions. [2020-02-10 20:22:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:17,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:17,621 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:22:17,622 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:22:17,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:22:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-02-10 20:22:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1279 transitions. [2020-02-10 20:22:17,631 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1279 transitions. Word has length 22 [2020-02-10 20:22:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:17,631 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1279 transitions. [2020-02-10 20:22:17,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1279 transitions. [2020-02-10 20:22:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:17,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:17,632 INFO L415 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] [2020-02-10 20:22:17,632 INFO L427 AbstractCegarLoop]: === Iteration 1561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 151329968, now seen corresponding path program 1555 times [2020-02-10 20:22:17,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:17,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502820945] [2020-02-10 20:22:17,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502820945] [2020-02-10 20:22:17,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:17,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943293045] [2020-02-10 20:22:17,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:17,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:17,934 INFO L87 Difference]: Start difference. First operand 374 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:22:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,015 INFO L93 Difference]: Finished difference Result 540 states and 1601 transitions. [2020-02-10 20:22:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:18,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,016 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:22:18,016 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:22:18,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:22:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 376. [2020-02-10 20:22:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 20:22:18,025 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,026 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 20:22:18,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 20:22:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:18,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,026 INFO L415 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] [2020-02-10 20:22:18,026 INFO L427 AbstractCegarLoop]: === Iteration 1562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1762270926, now seen corresponding path program 1556 times [2020-02-10 20:22:18,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147465610] [2020-02-10 20:22:18,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:18,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147465610] [2020-02-10 20:22:18,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:18,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:18,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041533538] [2020-02-10 20:22:18,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:18,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:18,320 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,421 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-02-10 20:22:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:18,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,423 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:22:18,423 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 20:22:18,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 20:22:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 375. [2020-02-10 20:22:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1281 transitions. [2020-02-10 20:22:18,433 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1281 transitions. Word has length 22 [2020-02-10 20:22:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,433 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1281 transitions. [2020-02-10 20:22:18,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1281 transitions. [2020-02-10 20:22:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:18,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,434 INFO L415 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] [2020-02-10 20:22:18,434 INFO L427 AbstractCegarLoop]: === Iteration 1563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1164022500, now seen corresponding path program 1557 times [2020-02-10 20:22:18,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593212567] [2020-02-10 20:22:18,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:18,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593212567] [2020-02-10 20:22:18,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:18,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:18,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470046898] [2020-02-10 20:22:18,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:18,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:18,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:18,735 INFO L87 Difference]: Start difference. First operand 375 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:22:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,838 INFO L93 Difference]: Finished difference Result 542 states and 1604 transitions. [2020-02-10 20:22:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:18,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,840 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:22:18,840 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:22:18,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:22:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 376. [2020-02-10 20:22:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 20:22:18,849 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,850 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 20:22:18,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 20:22:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:18,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,850 INFO L415 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] [2020-02-10 20:22:18,850 INFO L427 AbstractCegarLoop]: === Iteration 1564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1699252302, now seen corresponding path program 1558 times [2020-02-10 20:22:18,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292946919] [2020-02-10 20:22:18,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:19,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292946919] [2020-02-10 20:22:19,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:19,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:19,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467623400] [2020-02-10 20:22:19,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:19,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:19,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:19,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:19,133 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:19,236 INFO L93 Difference]: Finished difference Result 545 states and 1609 transitions. [2020-02-10 20:22:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:19,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:19,237 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:22:19,237 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:22:19,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:22:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 375. [2020-02-10 20:22:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 20:22:19,245 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 20:22:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:19,246 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 20:22:19,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 20:22:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:19,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:19,246 INFO L415 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] [2020-02-10 20:22:19,246 INFO L427 AbstractCegarLoop]: === Iteration 1565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1174525604, now seen corresponding path program 1559 times [2020-02-10 20:22:19,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:19,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486937643] [2020-02-10 20:22:19,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:19,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486937643] [2020-02-10 20:22:19,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:19,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:19,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781312859] [2020-02-10 20:22:19,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:19,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:19,529 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:22:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:19,629 INFO L93 Difference]: Finished difference Result 545 states and 1610 transitions. [2020-02-10 20:22:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:19,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:19,631 INFO L225 Difference]: With dead ends: 545 [2020-02-10 20:22:19,631 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:22:19,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:22:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-02-10 20:22:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1283 transitions. [2020-02-10 20:22:19,640 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:19,640 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1283 transitions. [2020-02-10 20:22:19,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1283 transitions. [2020-02-10 20:22:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:19,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:19,641 INFO L415 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] [2020-02-10 20:22:19,641 INFO L427 AbstractCegarLoop]: === Iteration 1566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:19,641 INFO L82 PathProgramCache]: Analyzing trace with hash 98814448, now seen corresponding path program 1560 times [2020-02-10 20:22:19,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:19,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058154609] [2020-02-10 20:22:19,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:19,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058154609] [2020-02-10 20:22:19,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:19,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:19,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765934660] [2020-02-10 20:22:19,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:19,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:19,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:19,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:19,921 INFO L87 Difference]: Start difference. First operand 377 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:20,039 INFO L93 Difference]: Finished difference Result 547 states and 1612 transitions. [2020-02-10 20:22:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:20,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:20,041 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:22:20,041 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:22:20,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:22:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2020-02-10 20:22:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1274 transitions. [2020-02-10 20:22:20,051 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1274 transitions. Word has length 22 [2020-02-10 20:22:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:20,051 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1274 transitions. [2020-02-10 20:22:20,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1274 transitions. [2020-02-10 20:22:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:20,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:20,052 INFO L415 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] [2020-02-10 20:22:20,052 INFO L427 AbstractCegarLoop]: === Iteration 1567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -453357114, now seen corresponding path program 1561 times [2020-02-10 20:22:20,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:20,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171102751] [2020-02-10 20:22:20,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:20,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171102751] [2020-02-10 20:22:20,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:20,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:20,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152544452] [2020-02-10 20:22:20,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:20,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:20,311 INFO L87 Difference]: Start difference. First operand 371 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:22:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:20,388 INFO L93 Difference]: Finished difference Result 576 states and 1678 transitions. [2020-02-10 20:22:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:20,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:20,390 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:22:20,390 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:20,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 377. [2020-02-10 20:22:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1286 transitions. [2020-02-10 20:22:20,399 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:20,399 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1286 transitions. [2020-02-10 20:22:20,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1286 transitions. [2020-02-10 20:22:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:20,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:20,400 INFO L415 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] [2020-02-10 20:22:20,400 INFO L427 AbstractCegarLoop]: === Iteration 1568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1136908772, now seen corresponding path program 1562 times [2020-02-10 20:22:20,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:20,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224322778] [2020-02-10 20:22:20,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:20,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224322778] [2020-02-10 20:22:20,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:20,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:20,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382070206] [2020-02-10 20:22:20,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:20,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:20,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:20,657 INFO L87 Difference]: Start difference. First operand 377 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:20,764 INFO L93 Difference]: Finished difference Result 571 states and 1665 transitions. [2020-02-10 20:22:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:20,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:20,766 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:22:20,766 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:20,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 373. [2020-02-10 20:22:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-02-10 20:22:20,775 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:20,775 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-02-10 20:22:20,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-02-10 20:22:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:20,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:20,776 INFO L415 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] [2020-02-10 20:22:20,776 INFO L427 AbstractCegarLoop]: === Iteration 1569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 899193206, now seen corresponding path program 1563 times [2020-02-10 20:22:20,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:20,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176789936] [2020-02-10 20:22:20,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:21,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176789936] [2020-02-10 20:22:21,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:21,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:21,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386842538] [2020-02-10 20:22:21,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:21,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:21,039 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,121 INFO L93 Difference]: Finished difference Result 572 states and 1666 transitions. [2020-02-10 20:22:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:21,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,122 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:22:21,123 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:21,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-02-10 20:22:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 20:22:21,131 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 20:22:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:21,131 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 20:22:21,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 20:22:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:21,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:21,132 INFO L415 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] [2020-02-10 20:22:21,132 INFO L427 AbstractCegarLoop]: === Iteration 1570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1460261698, now seen corresponding path program 1564 times [2020-02-10 20:22:21,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:21,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402486746] [2020-02-10 20:22:21,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:21,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402486746] [2020-02-10 20:22:21,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:21,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:21,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777744843] [2020-02-10 20:22:21,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:21,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:21,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:21,395 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:22:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,476 INFO L93 Difference]: Finished difference Result 565 states and 1651 transitions. [2020-02-10 20:22:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:21,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,478 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:22:21,478 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:22:21,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:22:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-02-10 20:22:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-02-10 20:22:21,486 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:21,487 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-02-10 20:22:21,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-02-10 20:22:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:21,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:21,487 INFO L415 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] [2020-02-10 20:22:21,487 INFO L427 AbstractCegarLoop]: === Iteration 1571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:21,487 INFO L82 PathProgramCache]: Analyzing trace with hash -295097000, now seen corresponding path program 1565 times [2020-02-10 20:22:21,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:21,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974380166] [2020-02-10 20:22:21,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:21,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974380166] [2020-02-10 20:22:21,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:21,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:21,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889128445] [2020-02-10 20:22:21,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:21,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:21,750 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,865 INFO L93 Difference]: Finished difference Result 561 states and 1644 transitions. [2020-02-10 20:22:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:21,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,866 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:22:21,867 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:22:21,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:22:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-02-10 20:22:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1277 transitions. [2020-02-10 20:22:21,875 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1277 transitions. Word has length 22 [2020-02-10 20:22:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:21,875 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1277 transitions. [2020-02-10 20:22:21,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1277 transitions. [2020-02-10 20:22:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:21,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:21,876 INFO L415 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] [2020-02-10 20:22:21,876 INFO L427 AbstractCegarLoop]: === Iteration 1572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1740614010, now seen corresponding path program 1566 times [2020-02-10 20:22:21,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:21,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343452544] [2020-02-10 20:22:21,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:22,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343452544] [2020-02-10 20:22:22,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:22,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:22,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157546632] [2020-02-10 20:22:22,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:22,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:22,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:22,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:22,146 INFO L87 Difference]: Start difference. First operand 374 states and 1277 transitions. Second operand 9 states. [2020-02-10 20:22:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:22,226 INFO L93 Difference]: Finished difference Result 559 states and 1639 transitions. [2020-02-10 20:22:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:22,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:22,228 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:22:22,228 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:22:22,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:22:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-02-10 20:22:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1272 transitions. [2020-02-10 20:22:22,237 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,237 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1272 transitions. [2020-02-10 20:22:22,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1272 transitions. [2020-02-10 20:22:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:22,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,238 INFO L415 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] [2020-02-10 20:22:22,238 INFO L427 AbstractCegarLoop]: === Iteration 1573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,238 INFO L82 PathProgramCache]: Analyzing trace with hash -875842840, now seen corresponding path program 1567 times [2020-02-10 20:22:22,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337175906] [2020-02-10 20:22:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:22,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337175906] [2020-02-10 20:22:22,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:22,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:22,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405913] [2020-02-10 20:22:22,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:22,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:22,502 INFO L87 Difference]: Start difference. First operand 371 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:22,581 INFO L93 Difference]: Finished difference Result 580 states and 1688 transitions. [2020-02-10 20:22:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:22,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:22,583 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:22,583 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:22:22,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:22:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 378. [2020-02-10 20:22:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 20:22:22,592 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 20:22:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,592 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 20:22:22,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 20:22:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:22,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,593 INFO L415 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] [2020-02-10 20:22:22,593 INFO L427 AbstractCegarLoop]: === Iteration 1574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 714423046, now seen corresponding path program 1568 times [2020-02-10 20:22:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498229185] [2020-02-10 20:22:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:22,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498229185] [2020-02-10 20:22:22,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:22,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:22,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152096806] [2020-02-10 20:22:22,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:22,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:22,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:22,855 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:22:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:22,955 INFO L93 Difference]: Finished difference Result 575 states and 1675 transitions. [2020-02-10 20:22:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:22,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:22,956 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:22:22,957 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:22,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 374. [2020-02-10 20:22:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1279 transitions. [2020-02-10 20:22:22,965 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1279 transitions. Word has length 22 [2020-02-10 20:22:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,966 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1279 transitions. [2020-02-10 20:22:22,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1279 transitions. [2020-02-10 20:22:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:22,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,966 INFO L415 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] [2020-02-10 20:22:22,966 INFO L427 AbstractCegarLoop]: === Iteration 1575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash -774930668, now seen corresponding path program 1569 times [2020-02-10 20:22:22,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97914941] [2020-02-10 20:22:22,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:23,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97914941] [2020-02-10 20:22:23,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:23,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:23,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387841588] [2020-02-10 20:22:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:23,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:23,231 INFO L87 Difference]: Start difference. First operand 374 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:22:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:23,317 INFO L93 Difference]: Finished difference Result 578 states and 1680 transitions. [2020-02-10 20:22:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:23,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:23,319 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:23,319 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:23,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-02-10 20:22:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1283 transitions. [2020-02-10 20:22:23,328 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:23,328 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1283 transitions. [2020-02-10 20:22:23,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1283 transitions. [2020-02-10 20:22:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:23,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:23,329 INFO L415 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] [2020-02-10 20:22:23,329 INFO L427 AbstractCegarLoop]: === Iteration 1576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash -648294294, now seen corresponding path program 1570 times [2020-02-10 20:22:23,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:23,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961551593] [2020-02-10 20:22:23,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:23,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961551593] [2020-02-10 20:22:23,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:23,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:23,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471950097] [2020-02-10 20:22:23,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:23,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:23,587 INFO L87 Difference]: Start difference. First operand 377 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:23,700 INFO L93 Difference]: Finished difference Result 572 states and 1666 transitions. [2020-02-10 20:22:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:23,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:23,702 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:22:23,702 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:22:23,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:22:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-02-10 20:22:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1276 transitions. [2020-02-10 20:22:23,710 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:23,710 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1276 transitions. [2020-02-10 20:22:23,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1276 transitions. [2020-02-10 20:22:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:23,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:23,711 INFO L415 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] [2020-02-10 20:22:23,711 INFO L427 AbstractCegarLoop]: === Iteration 1577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1231654834, now seen corresponding path program 1571 times [2020-02-10 20:22:23,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:23,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288428125] [2020-02-10 20:22:23,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:23,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288428125] [2020-02-10 20:22:23,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:23,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:23,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119131023] [2020-02-10 20:22:23,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:23,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:23,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:23,977 INFO L87 Difference]: Start difference. First operand 374 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:24,083 INFO L93 Difference]: Finished difference Result 567 states and 1657 transitions. [2020-02-10 20:22:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:24,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:24,085 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:22:24,085 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:24,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 376. [2020-02-10 20:22:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 20:22:24,101 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 20:22:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:24,101 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 20:22:24,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 20:22:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:24,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:24,102 INFO L415 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] [2020-02-10 20:22:24,103 INFO L427 AbstractCegarLoop]: === Iteration 1578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:24,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1721379674, now seen corresponding path program 1572 times [2020-02-10 20:22:24,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:24,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574739559] [2020-02-10 20:22:24,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:24,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574739559] [2020-02-10 20:22:24,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:24,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:24,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309703610] [2020-02-10 20:22:24,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:24,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:24,367 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:22:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:24,471 INFO L93 Difference]: Finished difference Result 566 states and 1653 transitions. [2020-02-10 20:22:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:24,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:24,473 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:22:24,473 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:22:24,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:22:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 371. [2020-02-10 20:22:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-02-10 20:22:24,482 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:24,483 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-02-10 20:22:24,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-02-10 20:22:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:24,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:24,483 INFO L415 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] [2020-02-10 20:22:24,483 INFO L427 AbstractCegarLoop]: === Iteration 1579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:24,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash 880605302, now seen corresponding path program 1573 times [2020-02-10 20:22:24,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:24,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529558393] [2020-02-10 20:22:24,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529558393] [2020-02-10 20:22:24,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:24,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:24,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410775066] [2020-02-10 20:22:24,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:24,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:24,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:24,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:24,750 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:24,827 INFO L93 Difference]: Finished difference Result 570 states and 1659 transitions. [2020-02-10 20:22:24,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:24,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:24,829 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:22:24,829 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:22:24,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:22:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 375. [2020-02-10 20:22:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 20:22:24,837 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:24,837 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 20:22:24,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 20:22:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:24,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:24,838 INFO L415 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] [2020-02-10 20:22:24,838 INFO L427 AbstractCegarLoop]: === Iteration 1580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1441673794, now seen corresponding path program 1574 times [2020-02-10 20:22:24,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:24,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013463613] [2020-02-10 20:22:24,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:25,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013463613] [2020-02-10 20:22:25,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:25,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:25,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015891002] [2020-02-10 20:22:25,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:25,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:25,106 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,200 INFO L93 Difference]: Finished difference Result 563 states and 1644 transitions. [2020-02-10 20:22:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:25,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,202 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:22:25,202 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:22:25,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:22:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 373. [2020-02-10 20:22:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 20:22:25,211 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 20:22:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:25,212 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 20:22:25,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 20:22:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:25,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:25,212 INFO L415 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] [2020-02-10 20:22:25,212 INFO L427 AbstractCegarLoop]: === Iteration 1581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash -719832552, now seen corresponding path program 1575 times [2020-02-10 20:22:25,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:25,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941650296] [2020-02-10 20:22:25,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:25,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941650296] [2020-02-10 20:22:25,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:25,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:25,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869527357] [2020-02-10 20:22:25,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:25,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:25,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:25,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:25,474 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:22:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,550 INFO L93 Difference]: Finished difference Result 572 states and 1662 transitions. [2020-02-10 20:22:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:25,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,552 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:22:25,552 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:25,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 376. [2020-02-10 20:22:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1278 transitions. [2020-02-10 20:22:25,561 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:25,562 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1278 transitions. [2020-02-10 20:22:25,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1278 transitions. [2020-02-10 20:22:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:25,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:25,562 INFO L415 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] [2020-02-10 20:22:25,562 INFO L427 AbstractCegarLoop]: === Iteration 1582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1682036214, now seen corresponding path program 1576 times [2020-02-10 20:22:25,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:25,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372551718] [2020-02-10 20:22:25,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:25,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372551718] [2020-02-10 20:22:25,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:25,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:25,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953021145] [2020-02-10 20:22:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:25,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:25,825 INFO L87 Difference]: Start difference. First operand 376 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,939 INFO L93 Difference]: Finished difference Result 566 states and 1648 transitions. [2020-02-10 20:22:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:25,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,940 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:22:25,940 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:22:25,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:22:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 373. [2020-02-10 20:22:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:22:25,949 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:25,949 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:22:25,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:22:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:25,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:25,949 INFO L415 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] [2020-02-10 20:22:25,950 INFO L427 AbstractCegarLoop]: === Iteration 1583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -665110326, now seen corresponding path program 1577 times [2020-02-10 20:22:25,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:25,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540686979] [2020-02-10 20:22:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:26,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540686979] [2020-02-10 20:22:26,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:26,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:26,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196495427] [2020-02-10 20:22:26,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:26,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:26,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:26,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:26,225 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:26,305 INFO L93 Difference]: Finished difference Result 556 states and 1629 transitions. [2020-02-10 20:22:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:26,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:26,306 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:22:26,306 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:22:26,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:22:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2020-02-10 20:22:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-02-10 20:22:26,315 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-02-10 20:22:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:26,315 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-02-10 20:22:26,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-02-10 20:22:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:26,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:26,316 INFO L415 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] [2020-02-10 20:22:26,316 INFO L427 AbstractCegarLoop]: === Iteration 1584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash 945830632, now seen corresponding path program 1578 times [2020-02-10 20:22:26,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:26,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787547180] [2020-02-10 20:22:26,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:26,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787547180] [2020-02-10 20:22:26,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:26,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:26,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171747350] [2020-02-10 20:22:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:26,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:26,587 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:22:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:26,690 INFO L93 Difference]: Finished difference Result 557 states and 1630 transitions. [2020-02-10 20:22:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:26,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:26,692 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:22:26,692 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:22:26,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:22:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 371. [2020-02-10 20:22:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 20:22:26,701 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:26,701 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 20:22:26,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 20:22:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:26,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:26,702 INFO L415 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] [2020-02-10 20:22:26,702 INFO L427 AbstractCegarLoop]: === Iteration 1585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash -756584044, now seen corresponding path program 1579 times [2020-02-10 20:22:26,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:26,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669629613] [2020-02-10 20:22:26,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:26,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669629613] [2020-02-10 20:22:26,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:26,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:26,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375988623] [2020-02-10 20:22:26,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:26,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:26,981 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:27,078 INFO L93 Difference]: Finished difference Result 551 states and 1621 transitions. [2020-02-10 20:22:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:27,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:27,079 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:22:27,079 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:22:27,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:22:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 373. [2020-02-10 20:22:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:22:27,088 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:27,088 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:22:27,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:22:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:27,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:27,089 INFO L415 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] [2020-02-10 20:22:27,089 INFO L427 AbstractCegarLoop]: === Iteration 1586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2092866242, now seen corresponding path program 1580 times [2020-02-10 20:22:27,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:27,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781826490] [2020-02-10 20:22:27,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:27,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781826490] [2020-02-10 20:22:27,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:27,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:27,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576884237] [2020-02-10 20:22:27,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:27,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:27,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:27,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:27,370 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:27,448 INFO L93 Difference]: Finished difference Result 549 states and 1616 transitions. [2020-02-10 20:22:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:27,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:27,450 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:22:27,450 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:22:27,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:22:27,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 372. [2020-02-10 20:22:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1270 transitions. [2020-02-10 20:22:27,459 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:27,459 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1270 transitions. [2020-02-10 20:22:27,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1270 transitions. [2020-02-10 20:22:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:27,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:27,460 INFO L415 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] [2020-02-10 20:22:27,460 INFO L427 AbstractCegarLoop]: === Iteration 1587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1937945398, now seen corresponding path program 1581 times [2020-02-10 20:22:27,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:27,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015266905] [2020-02-10 20:22:27,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:27,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015266905] [2020-02-10 20:22:27,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:27,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:27,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844053906] [2020-02-10 20:22:27,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:27,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:27,732 INFO L87 Difference]: Start difference. First operand 372 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:27,848 INFO L93 Difference]: Finished difference Result 553 states and 1625 transitions. [2020-02-10 20:22:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:27,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:27,850 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:22:27,850 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:22:27,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:22:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 374. [2020-02-10 20:22:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-02-10 20:22:27,859 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-02-10 20:22:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:27,859 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-02-10 20:22:27,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-02-10 20:22:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:27,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:27,859 INFO L415 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] [2020-02-10 20:22:27,860 INFO L427 AbstractCegarLoop]: === Iteration 1588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2103929146, now seen corresponding path program 1582 times [2020-02-10 20:22:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:27,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577334207] [2020-02-10 20:22:27,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:28,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577334207] [2020-02-10 20:22:28,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:28,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:28,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084061689] [2020-02-10 20:22:28,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:28,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:28,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:28,139 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:22:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:28,257 INFO L93 Difference]: Finished difference Result 552 states and 1621 transitions. [2020-02-10 20:22:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:28,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:28,258 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:22:28,259 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:22:28,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:22:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2020-02-10 20:22:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1269 transitions. [2020-02-10 20:22:28,267 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1269 transitions. Word has length 22 [2020-02-10 20:22:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:28,267 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1269 transitions. [2020-02-10 20:22:28,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1269 transitions. [2020-02-10 20:22:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:28,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:28,268 INFO L415 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] [2020-02-10 20:22:28,268 INFO L427 AbstractCegarLoop]: === Iteration 1589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1108009466, now seen corresponding path program 1583 times [2020-02-10 20:22:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:28,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652563978] [2020-02-10 20:22:28,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:28,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652563978] [2020-02-10 20:22:28,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:28,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:28,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132797481] [2020-02-10 20:22:28,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:28,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:28,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:28,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:28,552 INFO L87 Difference]: Start difference. First operand 372 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:22:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:28,628 INFO L93 Difference]: Finished difference Result 548 states and 1613 transitions. [2020-02-10 20:22:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:28,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:28,629 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:22:28,629 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:22:28,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:22:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 373. [2020-02-10 20:22:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:22:28,638 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:28,638 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:22:28,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:22:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:28,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:28,639 INFO L415 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] [2020-02-10 20:22:28,639 INFO L427 AbstractCegarLoop]: === Iteration 1590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:28,639 INFO L82 PathProgramCache]: Analyzing trace with hash 502931492, now seen corresponding path program 1584 times [2020-02-10 20:22:28,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:28,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960650348] [2020-02-10 20:22:28,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:28,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960650348] [2020-02-10 20:22:28,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:28,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:28,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127983597] [2020-02-10 20:22:28,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:28,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:28,926 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,040 INFO L93 Difference]: Finished difference Result 549 states and 1614 transitions. [2020-02-10 20:22:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:29,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,042 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:22:29,042 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:22:29,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:22:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 369. [2020-02-10 20:22:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:22:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1264 transitions. [2020-02-10 20:22:29,051 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1264 transitions. Word has length 22 [2020-02-10 20:22:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,052 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1264 transitions. [2020-02-10 20:22:29,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1264 transitions. [2020-02-10 20:22:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:29,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,052 INFO L415 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] [2020-02-10 20:22:29,052 INFO L427 AbstractCegarLoop]: === Iteration 1591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash 607420976, now seen corresponding path program 1585 times [2020-02-10 20:22:29,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858351093] [2020-02-10 20:22:29,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:29,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858351093] [2020-02-10 20:22:29,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:29,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:29,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323431880] [2020-02-10 20:22:29,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:29,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:29,307 INFO L87 Difference]: Start difference. First operand 369 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:22:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,383 INFO L93 Difference]: Finished difference Result 582 states and 1692 transitions. [2020-02-10 20:22:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:29,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,385 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:22:29,385 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:22:29,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:22:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 377. [2020-02-10 20:22:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 20:22:29,393 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 20:22:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,394 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 20:22:29,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 20:22:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:29,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,394 INFO L415 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] [2020-02-10 20:22:29,394 INFO L427 AbstractCegarLoop]: === Iteration 1592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2097280434, now seen corresponding path program 1586 times [2020-02-10 20:22:29,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610882810] [2020-02-10 20:22:29,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:29,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610882810] [2020-02-10 20:22:29,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:29,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:29,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86508212] [2020-02-10 20:22:29,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:29,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:29,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:29,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:29,644 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:22:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,745 INFO L93 Difference]: Finished difference Result 577 states and 1679 transitions. [2020-02-10 20:22:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:29,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,747 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:22:29,747 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:29,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 373. [2020-02-10 20:22:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-02-10 20:22:29,756 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,756 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-02-10 20:22:29,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-02-10 20:22:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:29,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,757 INFO L415 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] [2020-02-10 20:22:29,757 INFO L427 AbstractCegarLoop]: === Iteration 1593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1959971296, now seen corresponding path program 1587 times [2020-02-10 20:22:29,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216838163] [2020-02-10 20:22:29,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:30,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216838163] [2020-02-10 20:22:30,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:30,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:30,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185633149] [2020-02-10 20:22:30,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:30,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:30,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:30,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:30,022 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:30,100 INFO L93 Difference]: Finished difference Result 578 states and 1680 transitions. [2020-02-10 20:22:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:30,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:30,102 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:30,102 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:30,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 375. [2020-02-10 20:22:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 20:22:30,111 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:30,111 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 20:22:30,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 20:22:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:30,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:30,111 INFO L415 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] [2020-02-10 20:22:30,112 INFO L427 AbstractCegarLoop]: === Iteration 1594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1773927508, now seen corresponding path program 1588 times [2020-02-10 20:22:30,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:30,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156092229] [2020-02-10 20:22:30,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:30,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156092229] [2020-02-10 20:22:30,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:30,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:30,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339166994] [2020-02-10 20:22:30,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:30,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:30,359 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:30,437 INFO L93 Difference]: Finished difference Result 571 states and 1665 transitions. [2020-02-10 20:22:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:30,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:30,439 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:22:30,439 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:30,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-02-10 20:22:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 20:22:30,448 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 20:22:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:30,448 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 20:22:30,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 20:22:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:30,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:30,449 INFO L415 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] [2020-02-10 20:22:30,449 INFO L427 AbstractCegarLoop]: === Iteration 1595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 765681090, now seen corresponding path program 1589 times [2020-02-10 20:22:30,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:30,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366024419] [2020-02-10 20:22:30,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:30,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366024419] [2020-02-10 20:22:30,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:30,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:30,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343297740] [2020-02-10 20:22:30,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:30,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:30,703 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:22:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:30,801 INFO L93 Difference]: Finished difference Result 567 states and 1658 transitions. [2020-02-10 20:22:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:30,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:30,802 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:22:30,802 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:30,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-02-10 20:22:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1275 transitions. [2020-02-10 20:22:30,810 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1275 transitions. Word has length 22 [2020-02-10 20:22:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:30,811 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1275 transitions. [2020-02-10 20:22:30,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1275 transitions. [2020-02-10 20:22:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:30,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:30,811 INFO L415 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] [2020-02-10 20:22:30,811 INFO L427 AbstractCegarLoop]: === Iteration 1596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash -679835920, now seen corresponding path program 1590 times [2020-02-10 20:22:30,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:30,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846640385] [2020-02-10 20:22:30,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:31,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846640385] [2020-02-10 20:22:31,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:31,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:31,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131147925] [2020-02-10 20:22:31,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:31,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:31,068 INFO L87 Difference]: Start difference. First operand 374 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:22:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:31,147 INFO L93 Difference]: Finished difference Result 565 states and 1653 transitions. [2020-02-10 20:22:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:31,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:31,149 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:22:31,149 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 20:22:31,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 20:22:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 371. [2020-02-10 20:22:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-02-10 20:22:31,158 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:31,159 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-02-10 20:22:31,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-02-10 20:22:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:31,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:31,159 INFO L415 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] [2020-02-10 20:22:31,159 INFO L427 AbstractCegarLoop]: === Iteration 1597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1997603416, now seen corresponding path program 1591 times [2020-02-10 20:22:31,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:31,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437566603] [2020-02-10 20:22:31,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:31,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437566603] [2020-02-10 20:22:31,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:31,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:31,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505687962] [2020-02-10 20:22:31,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:31,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:31,410 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:31,486 INFO L93 Difference]: Finished difference Result 590 states and 1714 transitions. [2020-02-10 20:22:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:31,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:31,487 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:22:31,488 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:22:31,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:22:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 20:22:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-02-10 20:22:31,496 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-02-10 20:22:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:31,496 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-02-10 20:22:31,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-02-10 20:22:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:31,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:31,497 INFO L415 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] [2020-02-10 20:22:31,497 INFO L427 AbstractCegarLoop]: === Iteration 1598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash -407337530, now seen corresponding path program 1592 times [2020-02-10 20:22:31,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:31,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524481879] [2020-02-10 20:22:31,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:31,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524481879] [2020-02-10 20:22:31,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:31,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:31,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686212927] [2020-02-10 20:22:31,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:31,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:31,750 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:22:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:31,853 INFO L93 Difference]: Finished difference Result 585 states and 1701 transitions. [2020-02-10 20:22:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:31,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:31,854 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:22:31,854 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:22:31,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:22:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 375. [2020-02-10 20:22:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 20:22:31,863 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 20:22:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:31,863 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 20:22:31,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 20:22:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:31,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:31,864 INFO L415 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] [2020-02-10 20:22:31,864 INFO L427 AbstractCegarLoop]: === Iteration 1599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash -665040488, now seen corresponding path program 1593 times [2020-02-10 20:22:31,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:31,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795818986] [2020-02-10 20:22:31,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795818986] [2020-02-10 20:22:32,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:32,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344580632] [2020-02-10 20:22:32,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:32,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:32,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:32,117 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:22:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:32,196 INFO L93 Difference]: Finished difference Result 586 states and 1706 transitions. [2020-02-10 20:22:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:32,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:32,198 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:22:32,198 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:22:32,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:22:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2020-02-10 20:22:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:22:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2020-02-10 20:22:32,207 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 22 [2020-02-10 20:22:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:32,208 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2020-02-10 20:22:32,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2020-02-10 20:22:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:32,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:32,208 INFO L415 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] [2020-02-10 20:22:32,208 INFO L427 AbstractCegarLoop]: === Iteration 1600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2038826780, now seen corresponding path program 1594 times [2020-02-10 20:22:32,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:32,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070693960] [2020-02-10 20:22:32,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070693960] [2020-02-10 20:22:32,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:32,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146998270] [2020-02-10 20:22:32,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:32,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:32,467 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:22:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:32,571 INFO L93 Difference]: Finished difference Result 574 states and 1687 transitions. [2020-02-10 20:22:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:32,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:32,573 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:22:32,573 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:22:32,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:22:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-02-10 20:22:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:22:32,581 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:32,581 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:22:32,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:22:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:32,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:32,582 INFO L415 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] [2020-02-10 20:22:32,582 INFO L427 AbstractCegarLoop]: === Iteration 1601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:32,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1880336902, now seen corresponding path program 1595 times [2020-02-10 20:22:32,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:32,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316217207] [2020-02-10 20:22:32,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316217207] [2020-02-10 20:22:32,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:32,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044030050] [2020-02-10 20:22:32,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:32,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:32,840 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:32,939 INFO L93 Difference]: Finished difference Result 578 states and 1685 transitions. [2020-02-10 20:22:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:32,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:32,941 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:32,941 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:22:32,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:22:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-02-10 20:22:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1281 transitions. [2020-02-10 20:22:32,949 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1281 transitions. Word has length 22 [2020-02-10 20:22:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:32,949 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1281 transitions. [2020-02-10 20:22:32,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1281 transitions. [2020-02-10 20:22:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:32,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:32,950 INFO L415 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] [2020-02-10 20:22:32,950 INFO L427 AbstractCegarLoop]: === Iteration 1602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:32,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:32,950 INFO L82 PathProgramCache]: Analyzing trace with hash -151289568, now seen corresponding path program 1596 times [2020-02-10 20:22:32,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:32,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73900552] [2020-02-10 20:22:32,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:33,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73900552] [2020-02-10 20:22:33,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:33,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:33,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726851332] [2020-02-10 20:22:33,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:33,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:33,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:33,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:33,198 INFO L87 Difference]: Start difference. First operand 378 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:22:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,300 INFO L93 Difference]: Finished difference Result 571 states and 1678 transitions. [2020-02-10 20:22:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:33,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,301 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:22:33,302 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:22:33,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:22:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 371. [2020-02-10 20:22:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 20:22:33,310 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,310 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 20:22:33,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 20:22:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:33,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,310 INFO L415 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] [2020-02-10 20:22:33,310 INFO L427 AbstractCegarLoop]: === Iteration 1603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1281391072, now seen corresponding path program 1597 times [2020-02-10 20:22:33,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977929439] [2020-02-10 20:22:33,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:33,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977929439] [2020-02-10 20:22:33,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:33,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:33,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577137321] [2020-02-10 20:22:33,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:33,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:33,557 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,651 INFO L93 Difference]: Finished difference Result 580 states and 1684 transitions. [2020-02-10 20:22:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:33,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,653 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:33,653 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:22:33,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:33,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:22:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 375. [2020-02-10 20:22:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:22:33,663 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,663 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:22:33,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:22:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:33,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,663 INFO L415 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] [2020-02-10 20:22:33,663 INFO L427 AbstractCegarLoop]: === Iteration 1604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -720322580, now seen corresponding path program 1598 times [2020-02-10 20:22:33,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482095350] [2020-02-10 20:22:33,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:33,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482095350] [2020-02-10 20:22:33,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:33,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:33,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581229223] [2020-02-10 20:22:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:33,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:33,908 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,987 INFO L93 Difference]: Finished difference Result 573 states and 1669 transitions. [2020-02-10 20:22:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:33,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,989 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:22:33,989 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:33,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 373. [2020-02-10 20:22:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:22:33,998 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,998 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:22:33,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:22:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:33,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,999 INFO L415 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] [2020-02-10 20:22:33,999 INFO L427 AbstractCegarLoop]: === Iteration 1605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 825393048, now seen corresponding path program 1599 times [2020-02-10 20:22:33,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59450500] [2020-02-10 20:22:33,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:34,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59450500] [2020-02-10 20:22:34,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:34,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:34,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276168540] [2020-02-10 20:22:34,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:34,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:34,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:34,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:34,253 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:34,337 INFO L93 Difference]: Finished difference Result 580 states and 1688 transitions. [2020-02-10 20:22:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:34,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:34,339 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:34,339 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:22:34,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:22:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 379. [2020-02-10 20:22:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1282 transitions. [2020-02-10 20:22:34,349 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:34,349 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1282 transitions. [2020-02-10 20:22:34,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1282 transitions. [2020-02-10 20:22:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:34,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:34,349 INFO L415 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] [2020-02-10 20:22:34,349 INFO L427 AbstractCegarLoop]: === Iteration 1606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1018213740, now seen corresponding path program 1600 times [2020-02-10 20:22:34,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:34,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263262083] [2020-02-10 20:22:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:34,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263262083] [2020-02-10 20:22:34,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:34,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:34,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939708752] [2020-02-10 20:22:34,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:34,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:34,604 INFO L87 Difference]: Start difference. First operand 379 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:34,703 INFO L93 Difference]: Finished difference Result 568 states and 1669 transitions. [2020-02-10 20:22:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:34,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:34,705 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:22:34,705 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:22:34,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:22:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 373. [2020-02-10 20:22:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:22:34,714 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:34,714 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:22:34,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:22:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:34,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:34,715 INFO L415 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] [2020-02-10 20:22:34,715 INFO L427 AbstractCegarLoop]: === Iteration 1607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash 880115274, now seen corresponding path program 1601 times [2020-02-10 20:22:34,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:34,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412192269] [2020-02-10 20:22:34,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:34,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412192269] [2020-02-10 20:22:34,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:34,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:34,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338076445] [2020-02-10 20:22:34,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:34,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:34,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:34,966 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:35,052 INFO L93 Difference]: Finished difference Result 568 states and 1659 transitions. [2020-02-10 20:22:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:35,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:35,054 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:22:35,054 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:22:35,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:22:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-02-10 20:22:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:22:35,062 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:22:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:35,062 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:22:35,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:22:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:35,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:35,063 INFO L415 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] [2020-02-10 20:22:35,063 INFO L427 AbstractCegarLoop]: === Iteration 1608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1268681262, now seen corresponding path program 1602 times [2020-02-10 20:22:35,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:35,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933693258] [2020-02-10 20:22:35,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:35,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933693258] [2020-02-10 20:22:35,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:35,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:35,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740056713] [2020-02-10 20:22:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:35,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:35,307 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:22:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:35,428 INFO L93 Difference]: Finished difference Result 563 states and 1658 transitions. [2020-02-10 20:22:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:35,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:35,430 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:22:35,430 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:22:35,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:22:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-02-10 20:22:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 20:22:35,438 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 20:22:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:35,438 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 20:22:35,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 20:22:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:35,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:35,439 INFO L415 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] [2020-02-10 20:22:35,439 INFO L427 AbstractCegarLoop]: === Iteration 1609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1376386878, now seen corresponding path program 1603 times [2020-02-10 20:22:35,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:35,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113772057] [2020-02-10 20:22:35,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:35,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113772057] [2020-02-10 20:22:35,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:35,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:35,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726911182] [2020-02-10 20:22:35,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:35,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:35,702 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:22:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:35,805 INFO L93 Difference]: Finished difference Result 560 states and 1642 transitions. [2020-02-10 20:22:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:35,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:35,806 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:22:35,806 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:22:35,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:22:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 373. [2020-02-10 20:22:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:22:35,816 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:35,816 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:22:35,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:22:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:35,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:35,816 INFO L415 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] [2020-02-10 20:22:35,816 INFO L427 AbstractCegarLoop]: === Iteration 1610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:35,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash -69130132, now seen corresponding path program 1604 times [2020-02-10 20:22:35,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:35,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653359326] [2020-02-10 20:22:35,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:36,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653359326] [2020-02-10 20:22:36,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:36,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837098466] [2020-02-10 20:22:36,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:36,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:36,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:36,073 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:36,154 INFO L93 Difference]: Finished difference Result 558 states and 1637 transitions. [2020-02-10 20:22:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:36,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:36,156 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:22:36,156 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:22:36,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:22:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-02-10 20:22:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1268 transitions. [2020-02-10 20:22:36,164 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:36,164 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1268 transitions. [2020-02-10 20:22:36,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1268 transitions. [2020-02-10 20:22:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:36,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:36,165 INFO L415 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] [2020-02-10 20:22:36,165 INFO L427 AbstractCegarLoop]: === Iteration 1611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -811796298, now seen corresponding path program 1605 times [2020-02-10 20:22:36,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:36,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972799921] [2020-02-10 20:22:36,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:36,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972799921] [2020-02-10 20:22:36,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:36,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895546462] [2020-02-10 20:22:36,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:36,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:36,412 INFO L87 Difference]: Start difference. First operand 372 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:36,513 INFO L93 Difference]: Finished difference Result 563 states and 1650 transitions. [2020-02-10 20:22:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:36,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:36,514 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:22:36,515 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:22:36,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:22:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 375. [2020-02-10 20:22:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-02-10 20:22:36,523 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-02-10 20:22:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:36,523 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-02-10 20:22:36,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-02-10 20:22:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:36,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:36,524 INFO L415 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] [2020-02-10 20:22:36,524 INFO L427 AbstractCegarLoop]: === Iteration 1612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1593795540, now seen corresponding path program 1606 times [2020-02-10 20:22:36,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:36,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055243615] [2020-02-10 20:22:36,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:36,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055243615] [2020-02-10 20:22:36,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:36,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075073507] [2020-02-10 20:22:36,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:36,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:36,772 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:22:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:36,873 INFO L93 Difference]: Finished difference Result 556 states and 1643 transitions. [2020-02-10 20:22:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:36,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:36,875 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:22:36,875 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 20:22:36,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 20:22:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2020-02-10 20:22:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1267 transitions. [2020-02-10 20:22:36,884 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1267 transitions. Word has length 22 [2020-02-10 20:22:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:36,884 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1267 transitions. [2020-02-10 20:22:36,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1267 transitions. [2020-02-10 20:22:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:36,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:36,885 INFO L415 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] [2020-02-10 20:22:36,885 INFO L427 AbstractCegarLoop]: === Iteration 1613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash 437216134, now seen corresponding path program 1607 times [2020-02-10 20:22:36,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:36,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307185529] [2020-02-10 20:22:36,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:37,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307185529] [2020-02-10 20:22:37,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:37,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:37,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643681072] [2020-02-10 20:22:37,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:37,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:37,135 INFO L87 Difference]: Start difference. First operand 372 states and 1267 transitions. Second operand 9 states. [2020-02-10 20:22:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:37,211 INFO L93 Difference]: Finished difference Result 559 states and 1639 transitions. [2020-02-10 20:22:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:37,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:37,212 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:22:37,213 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:22:37,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:22:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 373. [2020-02-10 20:22:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:22:37,221 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:37,221 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:22:37,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:22:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:37,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:37,222 INFO L415 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] [2020-02-10 20:22:37,222 INFO L427 AbstractCegarLoop]: === Iteration 1614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1711580402, now seen corresponding path program 1608 times [2020-02-10 20:22:37,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:37,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034064356] [2020-02-10 20:22:37,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:37,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034064356] [2020-02-10 20:22:37,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:37,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:37,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005580895] [2020-02-10 20:22:37,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:37,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:37,470 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:37,572 INFO L93 Difference]: Finished difference Result 554 states and 1638 transitions. [2020-02-10 20:22:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:37,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:37,573 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:22:37,573 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:22:37,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:22:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 369. [2020-02-10 20:22:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:22:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1262 transitions. [2020-02-10 20:22:37,582 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1262 transitions. Word has length 22 [2020-02-10 20:22:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:37,582 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1262 transitions. [2020-02-10 20:22:37,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1262 transitions. [2020-02-10 20:22:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:37,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:37,583 INFO L415 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] [2020-02-10 20:22:37,583 INFO L427 AbstractCegarLoop]: === Iteration 1615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash -27220368, now seen corresponding path program 1609 times [2020-02-10 20:22:37,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:37,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525608404] [2020-02-10 20:22:37,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:37,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525608404] [2020-02-10 20:22:37,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:37,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:37,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370919658] [2020-02-10 20:22:37,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:37,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:37,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:37,831 INFO L87 Difference]: Start difference. First operand 369 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:22:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:37,926 INFO L93 Difference]: Finished difference Result 593 states and 1726 transitions. [2020-02-10 20:22:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:37,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:37,928 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:22:37,928 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:22:37,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:22:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 20:22:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1291 transitions. [2020-02-10 20:22:37,938 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1291 transitions. Word has length 22 [2020-02-10 20:22:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:37,938 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1291 transitions. [2020-02-10 20:22:37,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1291 transitions. [2020-02-10 20:22:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:37,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:37,939 INFO L415 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] [2020-02-10 20:22:37,939 INFO L427 AbstractCegarLoop]: === Iteration 1616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1563045518, now seen corresponding path program 1610 times [2020-02-10 20:22:37,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:37,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023372334] [2020-02-10 20:22:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:38,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023372334] [2020-02-10 20:22:38,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:38,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:38,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724806761] [2020-02-10 20:22:38,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:38,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:38,183 INFO L87 Difference]: Start difference. First operand 379 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:22:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:38,287 INFO L93 Difference]: Finished difference Result 588 states and 1713 transitions. [2020-02-10 20:22:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:38,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:38,289 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:22:38,289 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:22:38,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:22:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 375. [2020-02-10 20:22:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-02-10 20:22:38,298 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:38,299 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-02-10 20:22:38,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-02-10 20:22:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:38,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:38,299 INFO L415 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] [2020-02-10 20:22:38,299 INFO L427 AbstractCegarLoop]: === Iteration 1617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash 73691804, now seen corresponding path program 1611 times [2020-02-10 20:22:38,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:38,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548050986] [2020-02-10 20:22:38,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:38,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548050986] [2020-02-10 20:22:38,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:38,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:38,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761303518] [2020-02-10 20:22:38,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:38,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:38,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:38,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:38,552 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:38,633 INFO L93 Difference]: Finished difference Result 591 states and 1718 transitions. [2020-02-10 20:22:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:38,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:38,635 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:22:38,635 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:22:38,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:22:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 378. [2020-02-10 20:22:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 20:22:38,643 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:38,644 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 20:22:38,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 20:22:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:38,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:38,644 INFO L415 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] [2020-02-10 20:22:38,644 INFO L427 AbstractCegarLoop]: === Iteration 1618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 200328178, now seen corresponding path program 1612 times [2020-02-10 20:22:38,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:38,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232104883] [2020-02-10 20:22:38,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232104883] [2020-02-10 20:22:38,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:38,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:38,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982591206] [2020-02-10 20:22:38,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:38,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:38,892 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:38,990 INFO L93 Difference]: Finished difference Result 585 states and 1704 transitions. [2020-02-10 20:22:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:38,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:38,992 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:22:38,992 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:22:38,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:22:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 20:22:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1279 transitions. [2020-02-10 20:22:39,001 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1279 transitions. Word has length 22 [2020-02-10 20:22:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:39,001 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1279 transitions. [2020-02-10 20:22:39,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1279 transitions. [2020-02-10 20:22:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:39,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:39,002 INFO L415 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] [2020-02-10 20:22:39,002 INFO L427 AbstractCegarLoop]: === Iteration 1619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2080277306, now seen corresponding path program 1613 times [2020-02-10 20:22:39,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:39,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143897588] [2020-02-10 20:22:39,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:39,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143897588] [2020-02-10 20:22:39,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:39,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:39,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855411102] [2020-02-10 20:22:39,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:39,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:39,249 INFO L87 Difference]: Start difference. First operand 375 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:22:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:39,346 INFO L93 Difference]: Finished difference Result 580 states and 1695 transitions. [2020-02-10 20:22:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:39,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:39,347 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:39,348 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:22:39,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:22:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 377. [2020-02-10 20:22:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-02-10 20:22:39,357 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:39,357 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-02-10 20:22:39,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-02-10 20:22:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:39,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:39,358 INFO L415 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] [2020-02-10 20:22:39,358 INFO L427 AbstractCegarLoop]: === Iteration 1620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash -872757202, now seen corresponding path program 1614 times [2020-02-10 20:22:39,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:39,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017054209] [2020-02-10 20:22:39,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:39,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017054209] [2020-02-10 20:22:39,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:39,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:39,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114827761] [2020-02-10 20:22:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:39,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:39,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:39,611 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:39,715 INFO L93 Difference]: Finished difference Result 579 states and 1691 transitions. [2020-02-10 20:22:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:39,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:39,717 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:22:39,717 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:22:39,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:22:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 372. [2020-02-10 20:22:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1272 transitions. [2020-02-10 20:22:39,726 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:39,726 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1272 transitions. [2020-02-10 20:22:39,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1272 transitions. [2020-02-10 20:22:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:39,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:39,727 INFO L415 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] [2020-02-10 20:22:39,727 INFO L427 AbstractCegarLoop]: === Iteration 1621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2085208262, now seen corresponding path program 1615 times [2020-02-10 20:22:39,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:39,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270707351] [2020-02-10 20:22:39,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:39,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270707351] [2020-02-10 20:22:39,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:39,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:39,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962368962] [2020-02-10 20:22:39,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:39,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:39,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:39,976 INFO L87 Difference]: Start difference. First operand 372 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,069 INFO L93 Difference]: Finished difference Result 597 states and 1735 transitions. [2020-02-10 20:22:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:40,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,070 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:22:40,070 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:22:40,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:22:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 380. [2020-02-10 20:22:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:22:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1292 transitions. [2020-02-10 20:22:40,079 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1292 transitions. Word has length 22 [2020-02-10 20:22:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:40,079 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1292 transitions. [2020-02-10 20:22:40,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1292 transitions. [2020-02-10 20:22:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:40,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:40,080 INFO L415 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] [2020-02-10 20:22:40,080 INFO L427 AbstractCegarLoop]: === Iteration 1622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -619493148, now seen corresponding path program 1616 times [2020-02-10 20:22:40,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:40,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757987659] [2020-02-10 20:22:40,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:40,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757987659] [2020-02-10 20:22:40,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:40,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:40,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761061554] [2020-02-10 20:22:40,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:40,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:40,326 INFO L87 Difference]: Start difference. First operand 380 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:22:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,429 INFO L93 Difference]: Finished difference Result 592 states and 1722 transitions. [2020-02-10 20:22:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:40,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,431 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:22:40,431 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:22:40,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:22:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 376. [2020-02-10 20:22:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 20:22:40,439 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 20:22:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:40,439 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 20:22:40,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 20:22:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:40,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:40,440 INFO L415 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] [2020-02-10 20:22:40,440 INFO L427 AbstractCegarLoop]: === Iteration 1623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -877196106, now seen corresponding path program 1617 times [2020-02-10 20:22:40,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:40,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404644804] [2020-02-10 20:22:40,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:40,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404644804] [2020-02-10 20:22:40,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:40,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:40,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131499814] [2020-02-10 20:22:40,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:40,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:40,697 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:22:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,783 INFO L93 Difference]: Finished difference Result 593 states and 1727 transitions. [2020-02-10 20:22:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:40,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,785 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:22:40,785 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:22:40,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:22:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 382. [2020-02-10 20:22:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:22:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1292 transitions. [2020-02-10 20:22:40,794 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1292 transitions. Word has length 22 [2020-02-10 20:22:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:40,794 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1292 transitions. [2020-02-10 20:22:40,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1292 transitions. [2020-02-10 20:22:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:40,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:40,795 INFO L415 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] [2020-02-10 20:22:40,795 INFO L427 AbstractCegarLoop]: === Iteration 1624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1826671162, now seen corresponding path program 1618 times [2020-02-10 20:22:40,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:40,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672426242] [2020-02-10 20:22:40,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:41,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672426242] [2020-02-10 20:22:41,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:41,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:41,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409799696] [2020-02-10 20:22:41,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:41,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:41,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:41,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:41,051 INFO L87 Difference]: Start difference. First operand 382 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:22:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:41,150 INFO L93 Difference]: Finished difference Result 581 states and 1708 transitions. [2020-02-10 20:22:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:41,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:41,152 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:22:41,152 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:41,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 376. [2020-02-10 20:22:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1278 transitions. [2020-02-10 20:22:41,162 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,162 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1278 transitions. [2020-02-10 20:22:41,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1278 transitions. [2020-02-10 20:22:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:41,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,162 INFO L415 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] [2020-02-10 20:22:41,163 INFO L427 AbstractCegarLoop]: === Iteration 1625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2092492520, now seen corresponding path program 1619 times [2020-02-10 20:22:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920387759] [2020-02-10 20:22:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:41,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920387759] [2020-02-10 20:22:41,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:41,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:41,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669949976] [2020-02-10 20:22:41,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:41,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:41,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:41,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:41,412 INFO L87 Difference]: Start difference. First operand 376 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:41,512 INFO L93 Difference]: Finished difference Result 585 states and 1706 transitions. [2020-02-10 20:22:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:41,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:41,513 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:22:41,513 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:22:41,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:22:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 20:22:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1283 transitions. [2020-02-10 20:22:41,522 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,522 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1283 transitions. [2020-02-10 20:22:41,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1283 transitions. [2020-02-10 20:22:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:41,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,523 INFO L415 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] [2020-02-10 20:22:41,523 INFO L427 AbstractCegarLoop]: === Iteration 1626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash -363445186, now seen corresponding path program 1620 times [2020-02-10 20:22:41,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299397802] [2020-02-10 20:22:41,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:41,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299397802] [2020-02-10 20:22:41,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:41,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:41,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288787291] [2020-02-10 20:22:41,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:41,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:41,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:41,784 INFO L87 Difference]: Start difference. First operand 379 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:41,881 INFO L93 Difference]: Finished difference Result 578 states and 1699 transitions. [2020-02-10 20:22:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:41,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:41,883 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:41,883 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:22:41,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:22:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-02-10 20:22:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1269 transitions. [2020-02-10 20:22:41,892 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1269 transitions. Word has length 22 [2020-02-10 20:22:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,893 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1269 transitions. [2020-02-10 20:22:41,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1269 transitions. [2020-02-10 20:22:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:41,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,893 INFO L415 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] [2020-02-10 20:22:41,893 INFO L427 AbstractCegarLoop]: === Iteration 1627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash -621679530, now seen corresponding path program 1621 times [2020-02-10 20:22:41,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752511696] [2020-02-10 20:22:41,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:42,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752511696] [2020-02-10 20:22:42,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:42,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:42,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810909179] [2020-02-10 20:22:42,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:42,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:42,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:42,141 INFO L87 Difference]: Start difference. First operand 372 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:22:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:42,218 INFO L93 Difference]: Finished difference Result 592 states and 1718 transitions. [2020-02-10 20:22:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:42,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:42,220 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:22:42,220 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:22:42,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:22:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 378. [2020-02-10 20:22:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:22:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1283 transitions. [2020-02-10 20:22:42,230 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1283 transitions. Word has length 22 [2020-02-10 20:22:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:42,230 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1283 transitions. [2020-02-10 20:22:42,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1283 transitions. [2020-02-10 20:22:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:42,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:42,230 INFO L415 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] [2020-02-10 20:22:42,230 INFO L427 AbstractCegarLoop]: === Iteration 1628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash -495043156, now seen corresponding path program 1622 times [2020-02-10 20:22:42,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:42,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062686044] [2020-02-10 20:22:42,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062686044] [2020-02-10 20:22:42,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:42,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:42,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608438525] [2020-02-10 20:22:42,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:42,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:42,485 INFO L87 Difference]: Start difference. First operand 378 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:22:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:42,584 INFO L93 Difference]: Finished difference Result 586 states and 1704 transitions. [2020-02-10 20:22:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:42,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:42,586 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:22:42,586 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:22:42,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:22:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 375. [2020-02-10 20:22:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:22:42,596 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:42,596 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:22:42,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:22:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:42,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:42,596 INFO L415 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] [2020-02-10 20:22:42,596 INFO L427 AbstractCegarLoop]: === Iteration 1629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash -86449728, now seen corresponding path program 1623 times [2020-02-10 20:22:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158081818] [2020-02-10 20:22:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:42,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158081818] [2020-02-10 20:22:42,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:42,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:42,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077452856] [2020-02-10 20:22:42,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:42,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:42,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:42,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:42,855 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:42,932 INFO L93 Difference]: Finished difference Result 590 states and 1716 transitions. [2020-02-10 20:22:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:42,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:42,934 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:22:42,934 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:22:42,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:22:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 381. [2020-02-10 20:22:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:22:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1286 transitions. [2020-02-10 20:22:42,943 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1286 transitions. Word has length 22 [2020-02-10 20:22:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:42,943 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1286 transitions. [2020-02-10 20:22:42,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1286 transitions. [2020-02-10 20:22:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:42,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:42,944 INFO L415 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] [2020-02-10 20:22:42,944 INFO L427 AbstractCegarLoop]: === Iteration 1630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash 659981198, now seen corresponding path program 1624 times [2020-02-10 20:22:42,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:42,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524675137] [2020-02-10 20:22:42,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:43,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524675137] [2020-02-10 20:22:43,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:43,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661144595] [2020-02-10 20:22:43,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:43,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:43,194 INFO L87 Difference]: Start difference. First operand 381 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:22:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:43,297 INFO L93 Difference]: Finished difference Result 578 states and 1697 transitions. [2020-02-10 20:22:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:43,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:43,298 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:22:43,298 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:22:43,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:22:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 375. [2020-02-10 20:22:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-02-10 20:22:43,307 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-02-10 20:22:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:43,307 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-02-10 20:22:43,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-02-10 20:22:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:43,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:43,308 INFO L415 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] [2020-02-10 20:22:43,308 INFO L427 AbstractCegarLoop]: === Iteration 1631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2105984114, now seen corresponding path program 1625 times [2020-02-10 20:22:43,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:43,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803367728] [2020-02-10 20:22:43,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:43,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803367728] [2020-02-10 20:22:43,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:43,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670176072] [2020-02-10 20:22:43,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:43,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:43,558 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:22:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:43,661 INFO L93 Difference]: Finished difference Result 580 states and 1691 transitions. [2020-02-10 20:22:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:43,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:43,663 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:22:43,663 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:22:43,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:22:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 377. [2020-02-10 20:22:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-02-10 20:22:43,672 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:43,672 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-02-10 20:22:43,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-02-10 20:22:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:43,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:43,673 INFO L415 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] [2020-02-10 20:22:43,673 INFO L427 AbstractCegarLoop]: === Iteration 1632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1534529308, now seen corresponding path program 1626 times [2020-02-10 20:22:43,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:43,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247460825] [2020-02-10 20:22:43,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:43,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247460825] [2020-02-10 20:22:43,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:43,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950222739] [2020-02-10 20:22:43,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:43,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:43,923 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:44,024 INFO L93 Difference]: Finished difference Result 574 states and 1687 transitions. [2020-02-10 20:22:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:44,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:44,026 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:22:44,026 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:44,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 372. [2020-02-10 20:22:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-02-10 20:22:44,035 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-02-10 20:22:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:44,035 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-02-10 20:22:44,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-02-10 20:22:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:44,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:44,036 INFO L415 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] [2020-02-10 20:22:44,036 INFO L427 AbstractCegarLoop]: === Iteration 1633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1815969736, now seen corresponding path program 1627 times [2020-02-10 20:22:44,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:44,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899999427] [2020-02-10 20:22:44,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:44,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899999427] [2020-02-10 20:22:44,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:44,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:44,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809253253] [2020-02-10 20:22:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:44,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:44,290 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:22:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:44,392 INFO L93 Difference]: Finished difference Result 572 states and 1675 transitions. [2020-02-10 20:22:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:44,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:44,394 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:22:44,394 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:22:44,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:22:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 376. [2020-02-10 20:22:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 20:22:44,404 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:44,404 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 20:22:44,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 20:22:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:44,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:44,404 INFO L415 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] [2020-02-10 20:22:44,405 INFO L427 AbstractCegarLoop]: === Iteration 1634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -474036948, now seen corresponding path program 1628 times [2020-02-10 20:22:44,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:44,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955529448] [2020-02-10 20:22:44,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:44,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955529448] [2020-02-10 20:22:44,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:44,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:44,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318950048] [2020-02-10 20:22:44,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:44,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:44,668 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:44,779 INFO L93 Difference]: Finished difference Result 571 states and 1671 transitions. [2020-02-10 20:22:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:44,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:44,781 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:22:44,781 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:22:44,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:22:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-02-10 20:22:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:22:44,790 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:22:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:44,790 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:22:44,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:22:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:44,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:44,791 INFO L415 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] [2020-02-10 20:22:44,791 INFO L427 AbstractCegarLoop]: === Iteration 1635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1280739934, now seen corresponding path program 1629 times [2020-02-10 20:22:44,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:44,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503822078] [2020-02-10 20:22:44,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:45,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503822078] [2020-02-10 20:22:45,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:45,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:45,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840310447] [2020-02-10 20:22:45,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:45,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:45,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:45,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:45,037 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:22:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,136 INFO L93 Difference]: Finished difference Result 573 states and 1677 transitions. [2020-02-10 20:22:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:45,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,138 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:22:45,138 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:45,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-02-10 20:22:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-02-10 20:22:45,146 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,146 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-02-10 20:22:45,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-02-10 20:22:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:45,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,147 INFO L415 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] [2020-02-10 20:22:45,147 INFO L427 AbstractCegarLoop]: === Iteration 1636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1509128942, now seen corresponding path program 1630 times [2020-02-10 20:22:45,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993029612] [2020-02-10 20:22:45,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:45,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993029612] [2020-02-10 20:22:45,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:45,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:45,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355105105] [2020-02-10 20:22:45,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:45,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:45,390 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,494 INFO L93 Difference]: Finished difference Result 566 states and 1670 transitions. [2020-02-10 20:22:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:45,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,495 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:22:45,496 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:22:45,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:22:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-02-10 20:22:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 20:22:45,504 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 20:22:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,504 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 20:22:45,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 20:22:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:45,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,504 INFO L415 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] [2020-02-10 20:22:45,505 INFO L427 AbstractCegarLoop]: === Iteration 1637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1011892526, now seen corresponding path program 1631 times [2020-02-10 20:22:45,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598584532] [2020-02-10 20:22:45,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:45,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598584532] [2020-02-10 20:22:45,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:45,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:45,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604377740] [2020-02-10 20:22:45,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:45,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:45,755 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:22:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,853 INFO L93 Difference]: Finished difference Result 571 states and 1670 transitions. [2020-02-10 20:22:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:45,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,854 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:22:45,855 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:22:45,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:22:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 376. [2020-02-10 20:22:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1272 transitions. [2020-02-10 20:22:45,863 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,863 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1272 transitions. [2020-02-10 20:22:45,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1272 transitions. [2020-02-10 20:22:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:45,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,864 INFO L415 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] [2020-02-10 20:22:45,864 INFO L427 AbstractCegarLoop]: === Iteration 1638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash -440437720, now seen corresponding path program 1632 times [2020-02-10 20:22:45,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317532523] [2020-02-10 20:22:45,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:46,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317532523] [2020-02-10 20:22:46,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:46,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:46,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747743572] [2020-02-10 20:22:46,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:46,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:46,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:46,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:46,111 INFO L87 Difference]: Start difference. First operand 376 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:46,232 INFO L93 Difference]: Finished difference Result 565 states and 1666 transitions. [2020-02-10 20:22:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:46,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:46,234 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:22:46,234 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:22:46,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:22:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 369. [2020-02-10 20:22:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:22:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1260 transitions. [2020-02-10 20:22:46,242 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1260 transitions. Word has length 22 [2020-02-10 20:22:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:46,243 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1260 transitions. [2020-02-10 20:22:46,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1260 transitions. [2020-02-10 20:22:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:46,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:46,243 INFO L415 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] [2020-02-10 20:22:46,243 INFO L427 AbstractCegarLoop]: === Iteration 1639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:46,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash -817380298, now seen corresponding path program 1633 times [2020-02-10 20:22:46,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:46,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042377510] [2020-02-10 20:22:46,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:46,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042377510] [2020-02-10 20:22:46,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:46,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:46,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001302782] [2020-02-10 20:22:46,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:46,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:46,512 INFO L87 Difference]: Start difference. First operand 369 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:22:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:46,592 INFO L93 Difference]: Finished difference Result 572 states and 1661 transitions. [2020-02-10 20:22:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:46,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:46,594 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:22:46,594 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:22:46,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:22:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-02-10 20:22:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:22:46,603 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:46,603 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:22:46,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:22:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:46,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:46,604 INFO L415 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] [2020-02-10 20:22:46,604 INFO L427 AbstractCegarLoop]: === Iteration 1640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash -256311806, now seen corresponding path program 1634 times [2020-02-10 20:22:46,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:46,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986633276] [2020-02-10 20:22:46,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:46,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986633276] [2020-02-10 20:22:46,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:46,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:46,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803902857] [2020-02-10 20:22:46,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:46,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:46,873 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:46,945 INFO L93 Difference]: Finished difference Result 565 states and 1646 transitions. [2020-02-10 20:22:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:46,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:46,947 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:22:46,947 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:22:46,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:22:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-02-10 20:22:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:22:46,955 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:22:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:46,955 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:22:46,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:22:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:46,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:46,956 INFO L415 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] [2020-02-10 20:22:46,956 INFO L427 AbstractCegarLoop]: === Iteration 1641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1877149144, now seen corresponding path program 1635 times [2020-02-10 20:22:46,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:46,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844218342] [2020-02-10 20:22:46,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:47,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844218342] [2020-02-10 20:22:47,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:47,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:47,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768164008] [2020-02-10 20:22:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:47,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:47,224 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:22:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:47,306 INFO L93 Difference]: Finished difference Result 574 states and 1664 transitions. [2020-02-10 20:22:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:47,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:47,308 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:22:47,308 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:22:47,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:22:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 376. [2020-02-10 20:22:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 20:22:47,316 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 20:22:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:47,316 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 20:22:47,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 20:22:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:47,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:47,317 INFO L415 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] [2020-02-10 20:22:47,317 INFO L427 AbstractCegarLoop]: === Iteration 1642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 914945482, now seen corresponding path program 1636 times [2020-02-10 20:22:47,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:47,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124985234] [2020-02-10 20:22:47,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:47,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124985234] [2020-02-10 20:22:47,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:47,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:47,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921420943] [2020-02-10 20:22:47,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:47,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:47,588 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:22:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:47,691 INFO L93 Difference]: Finished difference Result 568 states and 1650 transitions. [2020-02-10 20:22:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:47,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:47,693 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:22:47,693 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:22:47,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:22:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 373. [2020-02-10 20:22:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:22:47,702 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:47,702 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:22:47,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:22:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:47,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:47,703 INFO L415 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] [2020-02-10 20:22:47,703 INFO L427 AbstractCegarLoop]: === Iteration 1643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1931871370, now seen corresponding path program 1637 times [2020-02-10 20:22:47,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:47,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613821470] [2020-02-10 20:22:47,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613821470] [2020-02-10 20:22:47,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:47,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:47,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475782352] [2020-02-10 20:22:47,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:47,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:47,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:47,975 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,050 INFO L93 Difference]: Finished difference Result 558 states and 1631 transitions. [2020-02-10 20:22:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:48,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:48,052 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:22:48,052 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:22:48,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:22:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 374. [2020-02-10 20:22:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:22:48,060 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:22:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:48,060 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:22:48,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:22:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:48,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:48,061 INFO L415 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] [2020-02-10 20:22:48,061 INFO L427 AbstractCegarLoop]: === Iteration 1644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash -752154968, now seen corresponding path program 1638 times [2020-02-10 20:22:48,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:48,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395123459] [2020-02-10 20:22:48,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:48,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395123459] [2020-02-10 20:22:48,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:48,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:48,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089802852] [2020-02-10 20:22:48,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:48,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:48,335 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:22:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,436 INFO L93 Difference]: Finished difference Result 559 states and 1632 transitions. [2020-02-10 20:22:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:48,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:48,438 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:22:48,438 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:22:48,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:22:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2020-02-10 20:22:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 20:22:48,446 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 20:22:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:48,446 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 20:22:48,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 20:22:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:48,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:48,447 INFO L415 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] [2020-02-10 20:22:48,447 INFO L427 AbstractCegarLoop]: === Iteration 1645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1857616096, now seen corresponding path program 1639 times [2020-02-10 20:22:48,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:48,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453752889] [2020-02-10 20:22:48,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:48,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453752889] [2020-02-10 20:22:48,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:48,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:48,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272433970] [2020-02-10 20:22:48,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:48,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:48,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:48,718 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:22:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,793 INFO L93 Difference]: Finished difference Result 576 states and 1670 transitions. [2020-02-10 20:22:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:48,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:48,795 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:22:48,795 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:48,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-02-10 20:22:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:22:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:22:48,804 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:22:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:48,804 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:22:48,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:22:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:48,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:48,804 INFO L415 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] [2020-02-10 20:22:48,805 INFO L427 AbstractCegarLoop]: === Iteration 1646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1296547604, now seen corresponding path program 1640 times [2020-02-10 20:22:48,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:48,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926698758] [2020-02-10 20:22:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:49,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926698758] [2020-02-10 20:22:49,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:49,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:49,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359721701] [2020-02-10 20:22:49,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:49,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:49,074 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:22:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:49,151 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-02-10 20:22:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:49,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,152 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:22:49,153 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:22:49,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:22:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-02-10 20:22:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:22:49,162 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:22:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,162 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:22:49,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:22:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:49,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:49,163 INFO L415 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] [2020-02-10 20:22:49,163 INFO L427 AbstractCegarLoop]: === Iteration 1647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash 249168024, now seen corresponding path program 1641 times [2020-02-10 20:22:49,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210455257] [2020-02-10 20:22:49,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:49,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210455257] [2020-02-10 20:22:49,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:49,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:49,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856155316] [2020-02-10 20:22:49,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:49,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:49,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:49,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:49,438 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:22:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:49,514 INFO L93 Difference]: Finished difference Result 576 states and 1674 transitions. [2020-02-10 20:22:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:49,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,516 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:22:49,516 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:22:49,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:22:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 379. [2020-02-10 20:22:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:22:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-02-10 20:22:49,525 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-02-10 20:22:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,526 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-02-10 20:22:49,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-02-10 20:22:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:49,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:49,526 INFO L415 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] [2020-02-10 20:22:49,526 INFO L427 AbstractCegarLoop]: === Iteration 1648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 441988716, now seen corresponding path program 1642 times [2020-02-10 20:22:49,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054034551] [2020-02-10 20:22:49,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:49,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054034551] [2020-02-10 20:22:49,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:49,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:49,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001724663] [2020-02-10 20:22:49,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:49,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:49,795 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:22:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:49,896 INFO L93 Difference]: Finished difference Result 564 states and 1655 transitions. [2020-02-10 20:22:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:49,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,898 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:22:49,898 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:22:49,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:22:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 373. [2020-02-10 20:22:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:22:49,907 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,907 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:22:49,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:22:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:49,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:49,908 INFO L415 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] [2020-02-10 20:22:49,908 INFO L427 AbstractCegarLoop]: === Iteration 1649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash 303890250, now seen corresponding path program 1643 times [2020-02-10 20:22:49,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449374840] [2020-02-10 20:22:49,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:50,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449374840] [2020-02-10 20:22:50,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:50,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:50,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040094179] [2020-02-10 20:22:50,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:50,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:50,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:50,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:50,180 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:50,266 INFO L93 Difference]: Finished difference Result 564 states and 1645 transitions. [2020-02-10 20:22:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:50,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:50,267 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:22:50,267 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:22:50,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:22:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 374. [2020-02-10 20:22:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 20:22:50,275 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 20:22:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:50,276 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 20:22:50,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 20:22:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:50,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:50,276 INFO L415 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] [2020-02-10 20:22:50,276 INFO L427 AbstractCegarLoop]: === Iteration 1650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1844906286, now seen corresponding path program 1644 times [2020-02-10 20:22:50,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:50,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025847010] [2020-02-10 20:22:50,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:50,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025847010] [2020-02-10 20:22:50,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:50,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:50,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616903098] [2020-02-10 20:22:50,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:50,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:50,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:50,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:50,542 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:22:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:50,646 INFO L93 Difference]: Finished difference Result 559 states and 1644 transitions. [2020-02-10 20:22:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:50,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:50,647 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:22:50,648 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:22:50,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:22:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-02-10 20:22:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 20:22:50,657 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 20:22:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:50,657 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 20:22:50,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 20:22:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:50,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:50,658 INFO L415 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] [2020-02-10 20:22:50,658 INFO L427 AbstractCegarLoop]: === Iteration 1651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1532019872, now seen corresponding path program 1645 times [2020-02-10 20:22:50,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:50,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436407001] [2020-02-10 20:22:50,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:50,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436407001] [2020-02-10 20:22:50,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:50,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:50,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839269601] [2020-02-10 20:22:50,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:50,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:50,928 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:22:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:51,008 INFO L93 Difference]: Finished difference Result 581 states and 1682 transitions. [2020-02-10 20:22:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:51,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:51,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:51,010 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:22:51,010 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:22:51,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:22:51,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 377. [2020-02-10 20:22:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:22:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-02-10 20:22:51,019 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-02-10 20:22:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:51,020 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-02-10 20:22:51,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-02-10 20:22:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:51,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:51,020 INFO L415 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] [2020-02-10 20:22:51,020 INFO L427 AbstractCegarLoop]: === Iteration 1652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:51,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1800743762, now seen corresponding path program 1646 times [2020-02-10 20:22:51,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:51,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848490354] [2020-02-10 20:22:51,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:51,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848490354] [2020-02-10 20:22:51,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:51,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:51,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979780665] [2020-02-10 20:22:51,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:51,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:51,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:51,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:51,278 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:22:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:51,383 INFO L93 Difference]: Finished difference Result 575 states and 1668 transitions. [2020-02-10 20:22:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:51,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:51,385 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:22:51,385 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:22:51,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:22:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 374. [2020-02-10 20:22:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:22:51,394 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:22:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:51,394 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:22:51,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:22:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:51,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:51,395 INFO L415 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] [2020-02-10 20:22:51,395 INFO L427 AbstractCegarLoop]: === Iteration 1653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2119765194, now seen corresponding path program 1647 times [2020-02-10 20:22:51,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:51,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364254297] [2020-02-10 20:22:51,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:51,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364254297] [2020-02-10 20:22:51,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:51,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:51,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880649274] [2020-02-10 20:22:51,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:51,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:51,670 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:22:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:51,776 INFO L93 Difference]: Finished difference Result 579 states and 1680 transitions. [2020-02-10 20:22:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:51,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:51,777 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:22:51,777 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:22:51,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:22:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-02-10 20:22:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:22:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1281 transitions. [2020-02-10 20:22:51,786 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1281 transitions. Word has length 22 [2020-02-10 20:22:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:51,786 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1281 transitions. [2020-02-10 20:22:51,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1281 transitions. [2020-02-10 20:22:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:51,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:51,787 INFO L415 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] [2020-02-10 20:22:51,787 INFO L427 AbstractCegarLoop]: === Iteration 1654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1926944502, now seen corresponding path program 1648 times [2020-02-10 20:22:51,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:51,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665587821] [2020-02-10 20:22:51,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:52,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665587821] [2020-02-10 20:22:52,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:52,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:52,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745039283] [2020-02-10 20:22:52,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:52,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:52,051 INFO L87 Difference]: Start difference. First operand 380 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:22:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:52,158 INFO L93 Difference]: Finished difference Result 567 states and 1661 transitions. [2020-02-10 20:22:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:52,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,159 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:22:52,160 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:22:52,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:22:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 374. [2020-02-10 20:22:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 20:22:52,168 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:52,168 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 20:22:52,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 20:22:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:52,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:52,169 INFO L415 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] [2020-02-10 20:22:52,169 INFO L427 AbstractCegarLoop]: === Iteration 1655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 207754734, now seen corresponding path program 1649 times [2020-02-10 20:22:52,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:52,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199777994] [2020-02-10 20:22:52,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:52,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199777994] [2020-02-10 20:22:52,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:52,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:52,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339870165] [2020-02-10 20:22:52,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:52,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:52,425 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:52,530 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-02-10 20:22:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:52,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,532 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:22:52,532 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:22:52,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:22:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 376. [2020-02-10 20:22:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:22:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 20:22:52,541 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 20:22:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:52,542 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 20:22:52,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 20:22:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:52,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:52,542 INFO L415 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] [2020-02-10 20:22:52,543 INFO L427 AbstractCegarLoop]: === Iteration 1656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 779209540, now seen corresponding path program 1650 times [2020-02-10 20:22:52,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:52,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032134179] [2020-02-10 20:22:52,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:52,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032134179] [2020-02-10 20:22:52,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:52,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:52,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319601034] [2020-02-10 20:22:52,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:52,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:52,802 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:22:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:52,911 INFO L93 Difference]: Finished difference Result 563 states and 1651 transitions. [2020-02-10 20:22:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:52,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,912 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:22:52,912 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:22:52,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:22:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 371. [2020-02-10 20:22:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 20:22:52,921 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 20:22:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:52,921 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 20:22:52,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 20:22:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:52,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:52,922 INFO L415 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] [2020-02-10 20:22:52,922 INFO L427 AbstractCegarLoop]: === Iteration 1657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash 5837292, now seen corresponding path program 1651 times [2020-02-10 20:22:52,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:52,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503698944] [2020-02-10 20:22:52,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:53,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503698944] [2020-02-10 20:22:53,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:53,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:53,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824941296] [2020-02-10 20:22:53,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:53,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:53,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:53,205 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:22:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:53,292 INFO L93 Difference]: Finished difference Result 551 states and 1615 transitions. [2020-02-10 20:22:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:53,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:53,293 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:22:53,294 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 20:22:53,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 20:22:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 373. [2020-02-10 20:22:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:22:53,303 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:22:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:53,303 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:22:53,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:22:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:53,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:53,304 INFO L415 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] [2020-02-10 20:22:53,304 INFO L427 AbstractCegarLoop]: === Iteration 1658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:53,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:53,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1616778250, now seen corresponding path program 1652 times [2020-02-10 20:22:53,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:53,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10802517] [2020-02-10 20:22:53,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:53,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10802517] [2020-02-10 20:22:53,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:53,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:53,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701944127] [2020-02-10 20:22:53,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:53,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:53,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:53,583 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:22:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:53,693 INFO L93 Difference]: Finished difference Result 552 states and 1616 transitions. [2020-02-10 20:22:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:53,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:53,695 INFO L225 Difference]: With dead ends: 552 [2020-02-10 20:22:53,695 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:22:53,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:22:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 372. [2020-02-10 20:22:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 20:22:53,704 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 20:22:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:53,704 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 20:22:53,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 20:22:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:53,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:53,704 INFO L415 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] [2020-02-10 20:22:53,705 INFO L427 AbstractCegarLoop]: === Iteration 1659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash -581908030, now seen corresponding path program 1653 times [2020-02-10 20:22:53,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:53,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529671345] [2020-02-10 20:22:53,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:53,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529671345] [2020-02-10 20:22:53,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:53,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:53,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337298987] [2020-02-10 20:22:53,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:53,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:53,989 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:22:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:54,073 INFO L93 Difference]: Finished difference Result 553 states and 1619 transitions. [2020-02-10 20:22:54,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:54,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:54,075 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:22:54,075 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:22:54,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:22:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2020-02-10 20:22:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1265 transitions. [2020-02-10 20:22:54,083 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1265 transitions. Word has length 22 [2020-02-10 20:22:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:54,083 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1265 transitions. [2020-02-10 20:22:54,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1265 transitions. [2020-02-10 20:22:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:54,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:54,084 INFO L415 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] [2020-02-10 20:22:54,084 INFO L427 AbstractCegarLoop]: === Iteration 1660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1564262730, now seen corresponding path program 1654 times [2020-02-10 20:22:54,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395870280] [2020-02-10 20:22:54,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:54,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395870280] [2020-02-10 20:22:54,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:54,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:54,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743027961] [2020-02-10 20:22:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:54,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:54,354 INFO L87 Difference]: Start difference. First operand 373 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:22:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:54,485 INFO L93 Difference]: Finished difference Result 548 states and 1618 transitions. [2020-02-10 20:22:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:54,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:54,487 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:22:54,487 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:22:54,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:22:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 372. [2020-02-10 20:22:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:22:54,495 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:22:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:54,496 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:22:54,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:22:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:54,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:54,496 INFO L415 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] [2020-02-10 20:22:54,496 INFO L427 AbstractCegarLoop]: === Iteration 1661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash -571404926, now seen corresponding path program 1655 times [2020-02-10 20:22:54,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:54,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960400178] [2020-02-10 20:22:54,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:54,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960400178] [2020-02-10 20:22:54,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:54,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:54,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033373371] [2020-02-10 20:22:54,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:54,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:54,761 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:22:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:54,868 INFO L93 Difference]: Finished difference Result 555 states and 1623 transitions. [2020-02-10 20:22:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:54,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:54,870 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:22:54,870 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:22:54,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:22:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 374. [2020-02-10 20:22:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 20:22:54,879 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 20:22:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:54,879 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 20:22:54,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 20:22:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:54,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:54,879 INFO L415 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] [2020-02-10 20:22:54,879 INFO L427 AbstractCegarLoop]: === Iteration 1662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash -36175124, now seen corresponding path program 1656 times [2020-02-10 20:22:54,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:54,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66939951] [2020-02-10 20:22:54,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:55,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66939951] [2020-02-10 20:22:55,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:55,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:55,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201092311] [2020-02-10 20:22:55,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:55,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:55,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:55,148 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:22:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:55,258 INFO L93 Difference]: Finished difference Result 549 states and 1619 transitions. [2020-02-10 20:22:55,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:55,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:55,259 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:22:55,260 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:22:55,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:22:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 369. [2020-02-10 20:22:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:22:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-02-10 20:22:55,269 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-02-10 20:22:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:55,269 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-02-10 20:22:55,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-02-10 20:22:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:55,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:55,269 INFO L415 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] [2020-02-10 20:22:55,270 INFO L427 AbstractCegarLoop]: === Iteration 1663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:55,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash 995426200, now seen corresponding path program 1657 times [2020-02-10 20:22:55,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:55,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512288320] [2020-02-10 20:22:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:55,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512288320] [2020-02-10 20:22:55,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:55,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:55,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185713896] [2020-02-10 20:22:55,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:55,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:55,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:55,546 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-02-10 20:22:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:55,653 INFO L93 Difference]: Finished difference Result 540 states and 1592 transitions. [2020-02-10 20:22:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:55,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:55,654 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:22:55,654 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:22:55,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:22:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 372. [2020-02-10 20:22:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-02-10 20:22:55,663 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-02-10 20:22:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:55,663 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-02-10 20:22:55,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-02-10 20:22:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:55,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:55,664 INFO L415 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] [2020-02-10 20:22:55,664 INFO L427 AbstractCegarLoop]: === Iteration 1664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -450090810, now seen corresponding path program 1658 times [2020-02-10 20:22:55,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:55,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518203318] [2020-02-10 20:22:55,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:55,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518203318] [2020-02-10 20:22:55,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:55,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:55,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134200647] [2020-02-10 20:22:55,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:55,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:55,946 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:22:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,033 INFO L93 Difference]: Finished difference Result 538 states and 1587 transitions. [2020-02-10 20:22:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:56,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,035 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:22:56,035 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:22:56,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:22:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 371. [2020-02-10 20:22:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 20:22:56,044 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 20:22:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:56,044 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 20:22:56,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 20:22:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:56,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:56,045 INFO L415 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] [2020-02-10 20:22:56,045 INFO L427 AbstractCegarLoop]: === Iteration 1665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash -605011654, now seen corresponding path program 1659 times [2020-02-10 20:22:56,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:56,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532699413] [2020-02-10 20:22:56,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:56,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532699413] [2020-02-10 20:22:56,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:56,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:56,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476348820] [2020-02-10 20:22:56,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:56,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:56,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:56,321 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:22:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,426 INFO L93 Difference]: Finished difference Result 542 states and 1596 transitions. [2020-02-10 20:22:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:56,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,428 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:22:56,428 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:22:56,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:22:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 373. [2020-02-10 20:22:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:22:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1267 transitions. [2020-02-10 20:22:56,437 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1267 transitions. Word has length 22 [2020-02-10 20:22:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:56,437 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1267 transitions. [2020-02-10 20:22:56,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1267 transitions. [2020-02-10 20:22:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:56,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:56,438 INFO L415 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] [2020-02-10 20:22:56,438 INFO L427 AbstractCegarLoop]: === Iteration 1666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash -351918902, now seen corresponding path program 1660 times [2020-02-10 20:22:56,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:56,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752648442] [2020-02-10 20:22:56,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:56,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752648442] [2020-02-10 20:22:56,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:56,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:56,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347139382] [2020-02-10 20:22:56,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:56,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:56,713 INFO L87 Difference]: Start difference. First operand 373 states and 1267 transitions. Second operand 9 states. [2020-02-10 20:22:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,826 INFO L93 Difference]: Finished difference Result 541 states and 1592 transitions. [2020-02-10 20:22:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:56,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,828 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:22:56,828 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:22:56,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:22:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2020-02-10 20:22:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1263 transitions. [2020-02-10 20:22:56,837 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1263 transitions. Word has length 22 [2020-02-10 20:22:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:56,837 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1263 transitions. [2020-02-10 20:22:56,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1263 transitions. [2020-02-10 20:22:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:56,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:56,838 INFO L415 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] [2020-02-10 20:22:56,838 INFO L427 AbstractCegarLoop]: === Iteration 1667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 644000778, now seen corresponding path program 1661 times [2020-02-10 20:22:56,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:56,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424892164] [2020-02-10 20:22:56,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:57,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424892164] [2020-02-10 20:22:57,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:57,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:57,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192826926] [2020-02-10 20:22:57,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:57,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:57,131 INFO L87 Difference]: Start difference. First operand 371 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:22:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:57,216 INFO L93 Difference]: Finished difference Result 537 states and 1584 transitions. [2020-02-10 20:22:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:57,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:57,217 INFO L225 Difference]: With dead ends: 537 [2020-02-10 20:22:57,217 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:22:57,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:22:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 372. [2020-02-10 20:22:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 20:22:57,226 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 20:22:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:57,226 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 20:22:57,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 20:22:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:57,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:57,226 INFO L415 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] [2020-02-10 20:22:57,227 INFO L427 AbstractCegarLoop]: === Iteration 1668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:57,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2040025560, now seen corresponding path program 1662 times [2020-02-10 20:22:57,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:57,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121022320] [2020-02-10 20:22:57,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:57,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121022320] [2020-02-10 20:22:57,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:57,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:57,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855553940] [2020-02-10 20:22:57,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:57,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:57,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:57,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:57,512 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:22:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:57,623 INFO L93 Difference]: Finished difference Result 538 states and 1585 transitions. [2020-02-10 20:22:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:57,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:57,625 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:22:57,625 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:22:57,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:22:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 370. [2020-02-10 20:22:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:22:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1261 transitions. [2020-02-10 20:22:57,634 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1261 transitions. Word has length 22 [2020-02-10 20:22:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:57,635 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1261 transitions. [2020-02-10 20:22:57,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1261 transitions. [2020-02-10 20:22:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:57,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:57,635 INFO L415 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] [2020-02-10 20:22:57,635 INFO L427 AbstractCegarLoop]: === Iteration 1669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -44809598, now seen corresponding path program 1663 times [2020-02-10 20:22:57,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:57,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442832171] [2020-02-10 20:22:57,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:57,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442832171] [2020-02-10 20:22:57,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:57,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:57,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228087423] [2020-02-10 20:22:57,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:57,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:57,901 INFO L87 Difference]: Start difference. First operand 370 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:22:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:58,006 INFO L93 Difference]: Finished difference Result 543 states and 1598 transitions. [2020-02-10 20:22:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:58,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:58,008 INFO L225 Difference]: With dead ends: 543 [2020-02-10 20:22:58,008 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:22:58,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:22:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 372. [2020-02-10 20:22:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-02-10 20:22:58,017 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-02-10 20:22:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:58,017 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-02-10 20:22:58,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-02-10 20:22:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:58,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:58,018 INFO L415 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] [2020-02-10 20:22:58,018 INFO L427 AbstractCegarLoop]: === Iteration 1670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1490326608, now seen corresponding path program 1664 times [2020-02-10 20:22:58,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:58,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124037720] [2020-02-10 20:22:58,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:58,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124037720] [2020-02-10 20:22:58,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:58,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:58,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381296129] [2020-02-10 20:22:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:58,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:58,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:58,291 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:22:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:58,394 INFO L93 Difference]: Finished difference Result 541 states and 1593 transitions. [2020-02-10 20:22:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:58,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:58,395 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:22:58,395 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:22:58,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:22:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 371. [2020-02-10 20:22:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1263 transitions. [2020-02-10 20:22:58,405 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1263 transitions. Word has length 22 [2020-02-10 20:22:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:58,405 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1263 transitions. [2020-02-10 20:22:58,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1263 transitions. [2020-02-10 20:22:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:58,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:58,406 INFO L415 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] [2020-02-10 20:22:58,406 INFO L427 AbstractCegarLoop]: === Iteration 1671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2061974522, now seen corresponding path program 1665 times [2020-02-10 20:22:58,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:58,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445730265] [2020-02-10 20:22:58,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:58,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445730265] [2020-02-10 20:22:58,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:58,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:58,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456428507] [2020-02-10 20:22:58,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:58,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:58,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:58,669 INFO L87 Difference]: Start difference. First operand 371 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:22:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:58,775 INFO L93 Difference]: Finished difference Result 546 states and 1606 transitions. [2020-02-10 20:22:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:58,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:58,777 INFO L225 Difference]: With dead ends: 546 [2020-02-10 20:22:58,777 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:22:58,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:22:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 374. [2020-02-10 20:22:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:22:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 20:22:58,785 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 20:22:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:58,785 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 20:22:58,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 20:22:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:58,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:58,786 INFO L415 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] [2020-02-10 20:22:58,786 INFO L427 AbstractCegarLoop]: === Iteration 1672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1279975280, now seen corresponding path program 1666 times [2020-02-10 20:22:58,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:58,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736810228] [2020-02-10 20:22:58,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736810228] [2020-02-10 20:22:59,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:59,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:59,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208283121] [2020-02-10 20:22:59,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:59,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:59,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:59,045 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:22:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:59,155 INFO L93 Difference]: Finished difference Result 539 states and 1599 transitions. [2020-02-10 20:22:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:59,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:59,157 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:22:59,157 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 20:22:59,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 20:22:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 371. [2020-02-10 20:22:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:22:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 20:22:59,166 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 20:22:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:59,166 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 20:22:59,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 20:22:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:59,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:59,167 INFO L415 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] [2020-02-10 20:22:59,167 INFO L427 AbstractCegarLoop]: === Iteration 1673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash -983980342, now seen corresponding path program 1667 times [2020-02-10 20:22:59,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:59,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90606372] [2020-02-10 20:22:59,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:59,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90606372] [2020-02-10 20:22:59,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:59,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:59,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254173381] [2020-02-10 20:22:59,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:59,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:59,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:59,433 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:22:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:59,540 INFO L93 Difference]: Finished difference Result 542 states and 1595 transitions. [2020-02-10 20:22:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:59,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:59,542 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:22:59,542 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:22:59,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:22:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 372. [2020-02-10 20:22:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:22:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:22:59,551 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:22:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:59,551 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:22:59,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:22:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:59,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:59,552 INFO L415 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] [2020-02-10 20:22:59,552 INFO L427 AbstractCegarLoop]: === Iteration 1674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1162190418, now seen corresponding path program 1668 times [2020-02-10 20:22:59,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:59,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362481766] [2020-02-10 20:22:59,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:59,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362481766] [2020-02-10 20:22:59,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:59,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:22:59,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497913802] [2020-02-10 20:22:59,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:22:59,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:59,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:22:59,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:22:59,816 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:22:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:59,931 INFO L93 Difference]: Finished difference Result 537 states and 1594 transitions. [2020-02-10 20:22:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:22:59,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:22:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:59,933 INFO L225 Difference]: With dead ends: 537 [2020-02-10 20:22:59,933 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 20:22:59,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 20:22:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 370. [2020-02-10 20:22:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:22:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1260 transitions. [2020-02-10 20:22:59,942 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1260 transitions. Word has length 22 [2020-02-10 20:22:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:59,942 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1260 transitions. [2020-02-10 20:22:59,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:22:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1260 transitions. [2020-02-10 20:22:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:22:59,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:59,943 INFO L415 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] [2020-02-10 20:22:59,943 INFO L427 AbstractCegarLoop]: === Iteration 1675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 280786626, now seen corresponding path program 1669 times [2020-02-10 20:22:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024582223] [2020-02-10 20:22:59,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:00,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024582223] [2020-02-10 20:23:00,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:00,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052613587] [2020-02-10 20:23:00,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:00,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:00,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:00,212 INFO L87 Difference]: Start difference. First operand 370 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:23:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:00,330 INFO L93 Difference]: Finished difference Result 548 states and 1611 transitions. [2020-02-10 20:23:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:00,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:00,332 INFO L225 Difference]: With dead ends: 548 [2020-02-10 20:23:00,332 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:23:00,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:23:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-02-10 20:23:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1270 transitions. [2020-02-10 20:23:00,340 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:00,340 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1270 transitions. [2020-02-10 20:23:00,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1270 transitions. [2020-02-10 20:23:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:00,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:00,340 INFO L415 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] [2020-02-10 20:23:00,341 INFO L427 AbstractCegarLoop]: === Iteration 1676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash 533879378, now seen corresponding path program 1670 times [2020-02-10 20:23:00,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:00,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095473214] [2020-02-10 20:23:00,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:00,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095473214] [2020-02-10 20:23:00,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:00,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305630589] [2020-02-10 20:23:00,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:00,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:00,613 INFO L87 Difference]: Start difference. First operand 374 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:00,718 INFO L93 Difference]: Finished difference Result 547 states and 1607 transitions. [2020-02-10 20:23:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:00,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:00,720 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:23:00,720 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:23:00,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:23:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 372. [2020-02-10 20:23:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-02-10 20:23:00,728 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-02-10 20:23:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:00,728 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-02-10 20:23:00,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-02-10 20:23:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:00,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:00,729 INFO L415 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] [2020-02-10 20:23:00,729 INFO L427 AbstractCegarLoop]: === Iteration 1677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -306958696, now seen corresponding path program 1671 times [2020-02-10 20:23:00,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:00,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114401220] [2020-02-10 20:23:00,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:00,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114401220] [2020-02-10 20:23:00,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:00,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739186938] [2020-02-10 20:23:00,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:00,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:00,991 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:23:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,099 INFO L93 Difference]: Finished difference Result 549 states and 1613 transitions. [2020-02-10 20:23:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:01,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,101 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:23:01,101 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:23:01,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:23:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 375. [2020-02-10 20:23:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1270 transitions. [2020-02-10 20:23:01,110 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,110 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1270 transitions. [2020-02-10 20:23:01,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1270 transitions. [2020-02-10 20:23:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:01,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,111 INFO L415 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] [2020-02-10 20:23:01,111 INFO L427 AbstractCegarLoop]: === Iteration 1678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1088957938, now seen corresponding path program 1672 times [2020-02-10 20:23:01,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727495204] [2020-02-10 20:23:01,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:01,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727495204] [2020-02-10 20:23:01,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:01,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:01,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045086519] [2020-02-10 20:23:01,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:01,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:01,374 INFO L87 Difference]: Start difference. First operand 375 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,486 INFO L93 Difference]: Finished difference Result 542 states and 1606 transitions. [2020-02-10 20:23:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:01,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,487 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:23:01,488 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 20:23:01,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 20:23:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 372. [2020-02-10 20:23:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:23:01,497 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:23:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,497 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:23:01,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:23:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:01,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,498 INFO L415 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] [2020-02-10 20:23:01,498 INFO L427 AbstractCegarLoop]: === Iteration 1679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,498 INFO L82 PathProgramCache]: Analyzing trace with hash 13975730, now seen corresponding path program 1673 times [2020-02-10 20:23:01,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098312488] [2020-02-10 20:23:01,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:01,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098312488] [2020-02-10 20:23:01,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:01,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:01,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765889322] [2020-02-10 20:23:01,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:01,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:01,764 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:23:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,872 INFO L93 Difference]: Finished difference Result 547 states and 1606 transitions. [2020-02-10 20:23:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:01,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,873 INFO L225 Difference]: With dead ends: 547 [2020-02-10 20:23:01,874 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:23:01,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:23:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-02-10 20:23:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 20:23:01,882 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,883 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 20:23:01,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 20:23:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:01,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,883 INFO L415 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] [2020-02-10 20:23:01,883 INFO L427 AbstractCegarLoop]: === Iteration 1680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 585430536, now seen corresponding path program 1674 times [2020-02-10 20:23:01,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230142413] [2020-02-10 20:23:01,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:02,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230142413] [2020-02-10 20:23:02,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:02,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:02,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751476699] [2020-02-10 20:23:02,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:02,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:02,144 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:02,254 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-02-10 20:23:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:02,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:02,256 INFO L225 Difference]: With dead ends: 541 [2020-02-10 20:23:02,256 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 20:23:02,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 20:23:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 370. [2020-02-10 20:23:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:23:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-02-10 20:23:02,264 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-02-10 20:23:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:02,265 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-02-10 20:23:02,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-02-10 20:23:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:02,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:02,266 INFO L415 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] [2020-02-10 20:23:02,266 INFO L427 AbstractCegarLoop]: === Iteration 1681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash -839134160, now seen corresponding path program 1675 times [2020-02-10 20:23:02,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:02,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145678801] [2020-02-10 20:23:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:02,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145678801] [2020-02-10 20:23:02,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:02,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:02,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921849835] [2020-02-10 20:23:02,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:02,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:02,550 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-02-10 20:23:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:02,656 INFO L93 Difference]: Finished difference Result 538 states and 1585 transitions. [2020-02-10 20:23:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:02,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:02,658 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:23:02,658 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 20:23:02,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 20:23:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 372. [2020-02-10 20:23:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:23:02,667 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:23:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:02,667 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:23:02,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:23:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:02,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:02,668 INFO L415 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] [2020-02-10 20:23:02,668 INFO L427 AbstractCegarLoop]: === Iteration 1682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash 771806798, now seen corresponding path program 1676 times [2020-02-10 20:23:02,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:02,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321740173] [2020-02-10 20:23:02,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:02,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321740173] [2020-02-10 20:23:02,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:02,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:02,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757828991] [2020-02-10 20:23:02,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:02,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:02,949 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:23:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:03,057 INFO L93 Difference]: Finished difference Result 539 states and 1586 transitions. [2020-02-10 20:23:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:03,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:03,058 INFO L225 Difference]: With dead ends: 539 [2020-02-10 20:23:03,058 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 20:23:03,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 20:23:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 371. [2020-02-10 20:23:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-02-10 20:23:03,066 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-02-10 20:23:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:03,066 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-02-10 20:23:03,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-02-10 20:23:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:03,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:03,067 INFO L415 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] [2020-02-10 20:23:03,067 INFO L427 AbstractCegarLoop]: === Iteration 1683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1426879482, now seen corresponding path program 1677 times [2020-02-10 20:23:03,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:03,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115782530] [2020-02-10 20:23:03,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:03,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115782530] [2020-02-10 20:23:03,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:03,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:03,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564467842] [2020-02-10 20:23:03,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:03,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:03,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:03,340 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:23:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:03,426 INFO L93 Difference]: Finished difference Result 540 states and 1589 transitions. [2020-02-10 20:23:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:03,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:03,428 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:23:03,428 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:23:03,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:23:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 372. [2020-02-10 20:23:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-02-10 20:23:03,437 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-02-10 20:23:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:03,437 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-02-10 20:23:03,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-02-10 20:23:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:03,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:03,438 INFO L415 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] [2020-02-10 20:23:03,438 INFO L427 AbstractCegarLoop]: === Iteration 1684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:03,438 INFO L82 PathProgramCache]: Analyzing trace with hash 719291278, now seen corresponding path program 1678 times [2020-02-10 20:23:03,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:03,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439974360] [2020-02-10 20:23:03,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:03,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439974360] [2020-02-10 20:23:03,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:03,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:03,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589568023] [2020-02-10 20:23:03,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:03,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:03,713 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:23:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:03,816 INFO L93 Difference]: Finished difference Result 535 states and 1588 transitions. [2020-02-10 20:23:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:03,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:03,817 INFO L225 Difference]: With dead ends: 535 [2020-02-10 20:23:03,817 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 20:23:03,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 20:23:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 371. [2020-02-10 20:23:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-02-10 20:23:03,826 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-02-10 20:23:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:03,826 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-02-10 20:23:03,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-02-10 20:23:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:03,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:03,827 INFO L415 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] [2020-02-10 20:23:03,827 INFO L427 AbstractCegarLoop]: === Iteration 1685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1416376378, now seen corresponding path program 1679 times [2020-02-10 20:23:03,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:03,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428313850] [2020-02-10 20:23:03,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:04,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428313850] [2020-02-10 20:23:04,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:04,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651425228] [2020-02-10 20:23:04,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:04,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:04,096 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:23:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:04,228 INFO L93 Difference]: Finished difference Result 542 states and 1593 transitions. [2020-02-10 20:23:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:04,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:04,229 INFO L225 Difference]: With dead ends: 542 [2020-02-10 20:23:04,229 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 20:23:04,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 20:23:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 373. [2020-02-10 20:23:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 20:23:04,239 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 20:23:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:04,239 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 20:23:04,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 20:23:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:04,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:04,239 INFO L415 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] [2020-02-10 20:23:04,240 INFO L427 AbstractCegarLoop]: === Iteration 1686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -881146576, now seen corresponding path program 1680 times [2020-02-10 20:23:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:04,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862079193] [2020-02-10 20:23:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:04,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862079193] [2020-02-10 20:23:04,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:04,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843936783] [2020-02-10 20:23:04,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:04,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:04,508 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:23:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:04,620 INFO L93 Difference]: Finished difference Result 536 states and 1589 transitions. [2020-02-10 20:23:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:04,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:04,622 INFO L225 Difference]: With dead ends: 536 [2020-02-10 20:23:04,622 INFO L226 Difference]: Without dead ends: 517 [2020-02-10 20:23:04,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-02-10 20:23:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 367. [2020-02-10 20:23:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-02-10 20:23:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1254 transitions. [2020-02-10 20:23:04,631 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1254 transitions. Word has length 22 [2020-02-10 20:23:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:04,631 INFO L479 AbstractCegarLoop]: Abstraction has 367 states and 1254 transitions. [2020-02-10 20:23:04,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1254 transitions. [2020-02-10 20:23:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:04,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:04,632 INFO L415 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] [2020-02-10 20:23:04,632 INFO L427 AbstractCegarLoop]: === Iteration 1687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1625815878, now seen corresponding path program 1681 times [2020-02-10 20:23:04,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:04,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233429510] [2020-02-10 20:23:04,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:04,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233429510] [2020-02-10 20:23:04,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:04,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725950003] [2020-02-10 20:23:04,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:04,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:04,902 INFO L87 Difference]: Start difference. First operand 367 states and 1254 transitions. Second operand 9 states. [2020-02-10 20:23:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:04,986 INFO L93 Difference]: Finished difference Result 592 states and 1727 transitions. [2020-02-10 20:23:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:04,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:04,988 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:23:04,988 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 20:23:04,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 20:23:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 377. [2020-02-10 20:23:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 20:23:04,998 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 20:23:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:04,998 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 20:23:04,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 20:23:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:04,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:04,999 INFO L415 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] [2020-02-10 20:23:04,999 INFO L427 AbstractCegarLoop]: === Iteration 1688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1078885532, now seen corresponding path program 1682 times [2020-02-10 20:23:04,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:04,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033023169] [2020-02-10 20:23:04,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:05,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033023169] [2020-02-10 20:23:05,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:05,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:05,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827215046] [2020-02-10 20:23:05,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:05,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:05,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:05,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:05,264 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:23:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:05,387 INFO L93 Difference]: Finished difference Result 587 states and 1714 transitions. [2020-02-10 20:23:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:05,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:05,388 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:23:05,389 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:05,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-02-10 20:23:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-02-10 20:23:05,397 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-02-10 20:23:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:05,397 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-02-10 20:23:05,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-02-10 20:23:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:05,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:05,398 INFO L415 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] [2020-02-10 20:23:05,398 INFO L427 AbstractCegarLoop]: === Iteration 1689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1316601098, now seen corresponding path program 1683 times [2020-02-10 20:23:05,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:05,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580365559] [2020-02-10 20:23:05,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:05,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580365559] [2020-02-10 20:23:05,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:05,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:05,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165313458] [2020-02-10 20:23:05,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:05,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:05,665 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:23:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:05,767 INFO L93 Difference]: Finished difference Result 588 states and 1715 transitions. [2020-02-10 20:23:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:05,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:05,769 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:23:05,769 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:05,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 20:23:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 20:23:05,778 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:05,778 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 20:23:05,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 20:23:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:05,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:05,778 INFO L415 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] [2020-02-10 20:23:05,779 INFO L427 AbstractCegarLoop]: === Iteration 1690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -755532606, now seen corresponding path program 1684 times [2020-02-10 20:23:05,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:05,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043953671] [2020-02-10 20:23:05,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:06,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043953671] [2020-02-10 20:23:06,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:06,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:06,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951111234] [2020-02-10 20:23:06,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:06,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:06,048 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:06,134 INFO L93 Difference]: Finished difference Result 581 states and 1700 transitions. [2020-02-10 20:23:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:06,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:06,136 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:23:06,136 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:23:06,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:23:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 20:23:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 20:23:06,144 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,144 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 20:23:06,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 20:23:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:06,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,145 INFO L415 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] [2020-02-10 20:23:06,145 INFO L427 AbstractCegarLoop]: === Iteration 1691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1784075992, now seen corresponding path program 1685 times [2020-02-10 20:23:06,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91397424] [2020-02-10 20:23:06,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:06,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91397424] [2020-02-10 20:23:06,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:06,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:06,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132772483] [2020-02-10 20:23:06,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:06,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:06,418 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:06,544 INFO L93 Difference]: Finished difference Result 577 states and 1693 transitions. [2020-02-10 20:23:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:06,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:06,546 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:23:06,546 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:23:06,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:23:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 374. [2020-02-10 20:23:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1275 transitions. [2020-02-10 20:23:06,555 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1275 transitions. Word has length 22 [2020-02-10 20:23:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,555 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1275 transitions. [2020-02-10 20:23:06,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1275 transitions. [2020-02-10 20:23:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:06,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,556 INFO L415 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] [2020-02-10 20:23:06,556 INFO L427 AbstractCegarLoop]: === Iteration 1692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash 338558982, now seen corresponding path program 1686 times [2020-02-10 20:23:06,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470010906] [2020-02-10 20:23:06,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:06,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470010906] [2020-02-10 20:23:06,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:06,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:06,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314156924] [2020-02-10 20:23:06,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:06,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:06,845 INFO L87 Difference]: Start difference. First operand 374 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:23:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:06,927 INFO L93 Difference]: Finished difference Result 575 states and 1688 transitions. [2020-02-10 20:23:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:06,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:06,928 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:23:06,929 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:23:06,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:23:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 371. [2020-02-10 20:23:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-02-10 20:23:06,937 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,938 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-02-10 20:23:06,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-02-10 20:23:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:06,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,938 INFO L415 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] [2020-02-10 20:23:06,938 INFO L427 AbstractCegarLoop]: === Iteration 1693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash -556722788, now seen corresponding path program 1687 times [2020-02-10 20:23:06,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549281424] [2020-02-10 20:23:06,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:07,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549281424] [2020-02-10 20:23:07,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:07,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:07,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815005128] [2020-02-10 20:23:07,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:07,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:07,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:07,216 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:07,298 INFO L93 Difference]: Finished difference Result 602 states and 1754 transitions. [2020-02-10 20:23:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:07,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:07,300 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:23:07,300 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:23:07,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:23:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 379. [2020-02-10 20:23:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-02-10 20:23:07,309 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-02-10 20:23:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:07,309 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-02-10 20:23:07,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-02-10 20:23:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:07,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:07,310 INFO L415 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] [2020-02-10 20:23:07,310 INFO L427 AbstractCegarLoop]: === Iteration 1694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1033543098, now seen corresponding path program 1688 times [2020-02-10 20:23:07,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:07,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042345724] [2020-02-10 20:23:07,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:07,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042345724] [2020-02-10 20:23:07,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:07,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:07,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336842117] [2020-02-10 20:23:07,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:07,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:07,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:07,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:07,586 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:23:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:07,691 INFO L93 Difference]: Finished difference Result 597 states and 1741 transitions. [2020-02-10 20:23:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:07,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:07,692 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:23:07,693 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:23:07,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:23:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 375. [2020-02-10 20:23:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 20:23:07,702 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 20:23:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:07,702 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 20:23:07,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 20:23:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:07,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:07,702 INFO L415 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] [2020-02-10 20:23:07,703 INFO L427 AbstractCegarLoop]: === Iteration 1695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1905399540, now seen corresponding path program 1689 times [2020-02-10 20:23:07,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:07,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305420243] [2020-02-10 20:23:07,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:07,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305420243] [2020-02-10 20:23:07,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:07,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:07,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014394672] [2020-02-10 20:23:07,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:07,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:07,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:07,982 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:23:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:08,086 INFO L93 Difference]: Finished difference Result 604 states and 1755 transitions. [2020-02-10 20:23:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:08,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:08,088 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:23:08,088 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:23:08,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:23:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 380. [2020-02-10 20:23:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1288 transitions. [2020-02-10 20:23:08,097 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:08,097 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1288 transitions. [2020-02-10 20:23:08,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1288 transitions. [2020-02-10 20:23:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:08,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:08,098 INFO L415 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] [2020-02-10 20:23:08,098 INFO L427 AbstractCegarLoop]: === Iteration 1696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 688239854, now seen corresponding path program 1690 times [2020-02-10 20:23:08,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:08,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870370538] [2020-02-10 20:23:08,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:08,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870370538] [2020-02-10 20:23:08,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:08,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:08,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742956621] [2020-02-10 20:23:08,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:08,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:08,379 INFO L87 Difference]: Start difference. First operand 380 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:08,510 INFO L93 Difference]: Finished difference Result 600 states and 1743 transitions. [2020-02-10 20:23:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:08,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:08,512 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:23:08,512 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:23:08,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:23:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 375. [2020-02-10 20:23:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:23:08,521 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:23:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:08,521 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:23:08,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:23:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:08,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:08,522 INFO L415 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] [2020-02-10 20:23:08,522 INFO L427 AbstractCegarLoop]: === Iteration 1697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1174271342, now seen corresponding path program 1691 times [2020-02-10 20:23:08,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:08,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113481776] [2020-02-10 20:23:08,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:08,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113481776] [2020-02-10 20:23:08,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:08,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:08,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642968256] [2020-02-10 20:23:08,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:08,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:08,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:08,791 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:23:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:08,916 INFO L93 Difference]: Finished difference Result 592 states and 1728 transitions. [2020-02-10 20:23:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:08,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:08,918 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:23:08,918 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:23:08,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:23:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 378. [2020-02-10 20:23:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1281 transitions. [2020-02-10 20:23:08,927 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1281 transitions. Word has length 22 [2020-02-10 20:23:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:08,927 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1281 transitions. [2020-02-10 20:23:08,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1281 transitions. [2020-02-10 20:23:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:08,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:08,928 INFO L415 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] [2020-02-10 20:23:08,928 INFO L427 AbstractCegarLoop]: === Iteration 1698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2048012022, now seen corresponding path program 1692 times [2020-02-10 20:23:08,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:08,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702212693] [2020-02-10 20:23:08,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:09,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702212693] [2020-02-10 20:23:09,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:09,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:09,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113948285] [2020-02-10 20:23:09,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:09,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:09,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:09,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:09,203 INFO L87 Difference]: Start difference. First operand 378 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:23:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:09,308 INFO L93 Difference]: Finished difference Result 593 states and 1727 transitions. [2020-02-10 20:23:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:09,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:09,310 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:23:09,310 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:23:09,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:23:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 371. [2020-02-10 20:23:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 20:23:09,319 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:09,319 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 20:23:09,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 20:23:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:09,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:09,320 INFO L415 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] [2020-02-10 20:23:09,320 INFO L427 AbstractCegarLoop]: === Iteration 1699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1766544522, now seen corresponding path program 1693 times [2020-02-10 20:23:09,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:09,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324107035] [2020-02-10 20:23:09,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:09,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324107035] [2020-02-10 20:23:09,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:09,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:09,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350593973] [2020-02-10 20:23:09,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:09,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:09,589 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:09,675 INFO L93 Difference]: Finished difference Result 590 states and 1718 transitions. [2020-02-10 20:23:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:09,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:09,677 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:23:09,677 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:23:09,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:23:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 375. [2020-02-10 20:23:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:23:09,687 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:23:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:09,687 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:23:09,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:23:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:09,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:09,687 INFO L415 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] [2020-02-10 20:23:09,688 INFO L427 AbstractCegarLoop]: === Iteration 1700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1205476030, now seen corresponding path program 1694 times [2020-02-10 20:23:09,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:09,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910979251] [2020-02-10 20:23:09,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:09,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910979251] [2020-02-10 20:23:09,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:09,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:09,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948290651] [2020-02-10 20:23:09,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:09,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:09,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:09,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:09,953 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:23:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:10,027 INFO L93 Difference]: Finished difference Result 583 states and 1703 transitions. [2020-02-10 20:23:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:10,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:10,029 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:23:10,029 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:10,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-02-10 20:23:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:23:10,037 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:23:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:10,037 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:23:10,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:23:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:10,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:10,038 INFO L415 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] [2020-02-10 20:23:10,038 INFO L427 AbstractCegarLoop]: === Iteration 1701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1940677452, now seen corresponding path program 1695 times [2020-02-10 20:23:10,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:10,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358072623] [2020-02-10 20:23:10,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:10,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358072623] [2020-02-10 20:23:10,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:10,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:10,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048800450] [2020-02-10 20:23:10,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:10,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:10,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:10,322 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:23:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:10,396 INFO L93 Difference]: Finished difference Result 596 states and 1731 transitions. [2020-02-10 20:23:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:10,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:10,398 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:23:10,398 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:23:10,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:23:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 378. [2020-02-10 20:23:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1280 transitions. [2020-02-10 20:23:10,407 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1280 transitions. Word has length 22 [2020-02-10 20:23:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:10,407 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1280 transitions. [2020-02-10 20:23:10,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1280 transitions. [2020-02-10 20:23:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:10,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:10,408 INFO L415 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] [2020-02-10 20:23:10,408 INFO L427 AbstractCegarLoop]: === Iteration 1702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:10,408 INFO L82 PathProgramCache]: Analyzing trace with hash -332373186, now seen corresponding path program 1696 times [2020-02-10 20:23:10,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:10,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41260111] [2020-02-10 20:23:10,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:10,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41260111] [2020-02-10 20:23:10,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:10,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:10,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790289483] [2020-02-10 20:23:10,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:10,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:10,670 INFO L87 Difference]: Start difference. First operand 378 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:23:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:10,764 INFO L93 Difference]: Finished difference Result 592 states and 1719 transitions. [2020-02-10 20:23:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:10,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:10,765 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:23:10,765 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:23:10,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:23:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-02-10 20:23:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:23:10,775 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:10,775 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:23:10,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:23:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:10,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:10,776 INFO L415 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] [2020-02-10 20:23:10,776 INFO L427 AbstractCegarLoop]: === Iteration 1703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1995399678, now seen corresponding path program 1697 times [2020-02-10 20:23:10,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:10,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778359889] [2020-02-10 20:23:10,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:11,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778359889] [2020-02-10 20:23:11,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:11,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:11,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552634904] [2020-02-10 20:23:11,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:11,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:11,049 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:11,127 INFO L93 Difference]: Finished difference Result 578 states and 1692 transitions. [2020-02-10 20:23:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:11,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:11,129 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:23:11,129 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:23:11,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:23:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 374. [2020-02-10 20:23:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:23:11,138 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:23:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:11,138 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:23:11,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:23:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:11,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:11,138 INFO L415 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] [2020-02-10 20:23:11,138 INFO L427 AbstractCegarLoop]: === Iteration 1704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1764337816, now seen corresponding path program 1698 times [2020-02-10 20:23:11,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:11,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151161411] [2020-02-10 20:23:11,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:11,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151161411] [2020-02-10 20:23:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:11,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:11,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107152254] [2020-02-10 20:23:11,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:11,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:11,401 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:23:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:11,500 INFO L93 Difference]: Finished difference Result 581 states and 1697 transitions. [2020-02-10 20:23:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:11,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:11,501 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:23:11,501 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:23:11,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:23:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2020-02-10 20:23:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 20:23:11,510 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:11,510 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 20:23:11,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 20:23:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:11,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:11,511 INFO L415 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] [2020-02-10 20:23:11,511 INFO L427 AbstractCegarLoop]: === Iteration 1705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash 891233428, now seen corresponding path program 1699 times [2020-02-10 20:23:11,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:11,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642543485] [2020-02-10 20:23:11,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:11,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642543485] [2020-02-10 20:23:11,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:11,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:11,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420662976] [2020-02-10 20:23:11,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:11,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:11,786 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:11,888 INFO L93 Difference]: Finished difference Result 570 states and 1677 transitions. [2020-02-10 20:23:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:11,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:11,889 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:23:11,890 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:23:11,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:23:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-02-10 20:23:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:23:11,899 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:11,899 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:23:11,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:23:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:11,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:11,900 INFO L415 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] [2020-02-10 20:23:11,900 INFO L427 AbstractCegarLoop]: === Iteration 1706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -554283582, now seen corresponding path program 1700 times [2020-02-10 20:23:11,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:11,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91955084] [2020-02-10 20:23:11,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91955084] [2020-02-10 20:23:12,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:12,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860843731] [2020-02-10 20:23:12,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:12,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:12,180 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:12,264 INFO L93 Difference]: Finished difference Result 568 states and 1672 transitions. [2020-02-10 20:23:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:12,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:12,265 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:23:12,266 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:23:12,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:23:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-02-10 20:23:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1268 transitions. [2020-02-10 20:23:12,275 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:12,275 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1268 transitions. [2020-02-10 20:23:12,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1268 transitions. [2020-02-10 20:23:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:12,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:12,275 INFO L415 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] [2020-02-10 20:23:12,276 INFO L427 AbstractCegarLoop]: === Iteration 1707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 303488106, now seen corresponding path program 1701 times [2020-02-10 20:23:12,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:12,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927863091] [2020-02-10 20:23:12,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927863091] [2020-02-10 20:23:12,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:12,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380700842] [2020-02-10 20:23:12,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:12,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:12,545 INFO L87 Difference]: Start difference. First operand 372 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:12,639 INFO L93 Difference]: Finished difference Result 575 states and 1688 transitions. [2020-02-10 20:23:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:12,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:12,641 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:23:12,641 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:23:12,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:23:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 375. [2020-02-10 20:23:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-02-10 20:23:12,649 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-02-10 20:23:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:12,649 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-02-10 20:23:12,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-02-10 20:23:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:12,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:12,650 INFO L415 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] [2020-02-10 20:23:12,650 INFO L427 AbstractCegarLoop]: === Iteration 1708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash 605506050, now seen corresponding path program 1702 times [2020-02-10 20:23:12,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:12,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727179880] [2020-02-10 20:23:12,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727179880] [2020-02-10 20:23:12,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:12,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623053062] [2020-02-10 20:23:12,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:12,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:12,923 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:23:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,033 INFO L93 Difference]: Finished difference Result 576 states and 1687 transitions. [2020-02-10 20:23:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:13,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,035 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:13,035 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:23:13,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:23:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 372. [2020-02-10 20:23:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1267 transitions. [2020-02-10 20:23:13,044 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1267 transitions. Word has length 22 [2020-02-10 20:23:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:13,044 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1267 transitions. [2020-02-10 20:23:13,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1267 transitions. [2020-02-10 20:23:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:13,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:13,045 INFO L415 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] [2020-02-10 20:23:13,045 INFO L427 AbstractCegarLoop]: === Iteration 1709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1552500538, now seen corresponding path program 1703 times [2020-02-10 20:23:13,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:13,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349867912] [2020-02-10 20:23:13,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:13,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349867912] [2020-02-10 20:23:13,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:13,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:13,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78478892] [2020-02-10 20:23:13,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:13,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:13,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:13,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:13,326 INFO L87 Difference]: Start difference. First operand 372 states and 1267 transitions. Second operand 9 states. [2020-02-10 20:23:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,401 INFO L93 Difference]: Finished difference Result 569 states and 1673 transitions. [2020-02-10 20:23:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:13,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,403 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:23:13,403 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:23:13,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:23:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-02-10 20:23:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:23:13,413 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:13,413 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:23:13,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:23:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:13,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:13,414 INFO L415 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] [2020-02-10 20:23:13,414 INFO L427 AbstractCegarLoop]: === Iteration 1710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2087730340, now seen corresponding path program 1704 times [2020-02-10 20:23:13,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992609836] [2020-02-10 20:23:13,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:13,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992609836] [2020-02-10 20:23:13,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:13,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:13,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422896402] [2020-02-10 20:23:13,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:13,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:13,692 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,800 INFO L93 Difference]: Finished difference Result 572 states and 1678 transitions. [2020-02-10 20:23:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:13,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,802 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:23:13,802 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:23:13,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:23:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 369. [2020-02-10 20:23:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:23:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1262 transitions. [2020-02-10 20:23:13,811 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1262 transitions. Word has length 22 [2020-02-10 20:23:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:13,811 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1262 transitions. [2020-02-10 20:23:13,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1262 transitions. [2020-02-10 20:23:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:13,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:13,812 INFO L415 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] [2020-02-10 20:23:13,812 INFO L427 AbstractCegarLoop]: === Iteration 1711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:13,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1413660260, now seen corresponding path program 1705 times [2020-02-10 20:23:13,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:13,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787604510] [2020-02-10 20:23:13,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:14,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787604510] [2020-02-10 20:23:14,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:14,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:14,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450980968] [2020-02-10 20:23:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:14,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:14,064 INFO L87 Difference]: Start difference. First operand 369 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:23:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:14,137 INFO L93 Difference]: Finished difference Result 590 states and 1716 transitions. [2020-02-10 20:23:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:14,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:14,138 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:23:14,138 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:23:14,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:23:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 377. [2020-02-10 20:23:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-02-10 20:23:14,148 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-02-10 20:23:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:14,148 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-02-10 20:23:14,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-02-10 20:23:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:14,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:14,148 INFO L415 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] [2020-02-10 20:23:14,149 INFO L427 AbstractCegarLoop]: === Iteration 1712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1291041150, now seen corresponding path program 1706 times [2020-02-10 20:23:14,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:14,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726915624] [2020-02-10 20:23:14,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:14,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726915624] [2020-02-10 20:23:14,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:14,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:14,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634409135] [2020-02-10 20:23:14,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:14,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:14,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:14,402 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:23:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:14,506 INFO L93 Difference]: Finished difference Result 585 states and 1703 transitions. [2020-02-10 20:23:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:14,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:14,508 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:23:14,508 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:23:14,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:23:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 20:23:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 20:23:14,518 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:14,518 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 20:23:14,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 20:23:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:14,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:14,519 INFO L415 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] [2020-02-10 20:23:14,519 INFO L427 AbstractCegarLoop]: === Iteration 1713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1528756716, now seen corresponding path program 1707 times [2020-02-10 20:23:14,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:14,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134765232] [2020-02-10 20:23:14,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:14,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134765232] [2020-02-10 20:23:14,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:14,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:14,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749715918] [2020-02-10 20:23:14,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:14,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:14,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:14,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:14,767 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:14,841 INFO L93 Difference]: Finished difference Result 586 states and 1704 transitions. [2020-02-10 20:23:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:14,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:14,842 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:23:14,843 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:23:14,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:23:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 375. [2020-02-10 20:23:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:23:14,851 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:23:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:14,852 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:23:14,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:23:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:14,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:14,852 INFO L415 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] [2020-02-10 20:23:14,852 INFO L427 AbstractCegarLoop]: === Iteration 1714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash -967688224, now seen corresponding path program 1708 times [2020-02-10 20:23:14,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:14,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761345955] [2020-02-10 20:23:14,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:15,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761345955] [2020-02-10 20:23:15,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:15,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:15,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649462095] [2020-02-10 20:23:15,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:15,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:15,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:15,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:15,102 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:23:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:15,184 INFO L93 Difference]: Finished difference Result 579 states and 1689 transitions. [2020-02-10 20:23:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:15,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:15,185 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:23:15,186 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:23:15,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:23:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 373. [2020-02-10 20:23:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:23:15,194 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:23:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:15,194 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:23:15,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:23:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:15,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:15,195 INFO L415 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] [2020-02-10 20:23:15,195 INFO L427 AbstractCegarLoop]: === Iteration 1715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1571920374, now seen corresponding path program 1709 times [2020-02-10 20:23:15,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293376862] [2020-02-10 20:23:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:15,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293376862] [2020-02-10 20:23:15,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:15,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:15,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77790930] [2020-02-10 20:23:15,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:15,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:15,451 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:23:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:15,552 INFO L93 Difference]: Finished difference Result 575 states and 1682 transitions. [2020-02-10 20:23:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:15,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:15,554 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:23:15,554 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:23:15,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:23:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 374. [2020-02-10 20:23:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-02-10 20:23:15,563 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-02-10 20:23:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:15,563 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-02-10 20:23:15,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-02-10 20:23:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:15,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:15,564 INFO L415 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] [2020-02-10 20:23:15,564 INFO L427 AbstractCegarLoop]: === Iteration 1716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 126403364, now seen corresponding path program 1710 times [2020-02-10 20:23:15,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:15,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853646501] [2020-02-10 20:23:15,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:15,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853646501] [2020-02-10 20:23:15,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:15,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:15,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715974758] [2020-02-10 20:23:15,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:15,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:15,822 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:23:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:15,913 INFO L93 Difference]: Finished difference Result 573 states and 1677 transitions. [2020-02-10 20:23:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:15,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:15,914 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:23:15,914 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 20:23:15,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 20:23:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 371. [2020-02-10 20:23:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 20:23:15,923 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:15,923 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 20:23:15,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 20:23:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:15,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:15,924 INFO L415 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] [2020-02-10 20:23:15,924 INFO L427 AbstractCegarLoop]: === Iteration 1717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1191364132, now seen corresponding path program 1711 times [2020-02-10 20:23:15,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:15,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750186990] [2020-02-10 20:23:15,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750186990] [2020-02-10 20:23:16,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:16,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170660720] [2020-02-10 20:23:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:16,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:16,177 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:16,257 INFO L93 Difference]: Finished difference Result 598 states and 1738 transitions. [2020-02-10 20:23:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:16,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:16,259 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:23:16,259 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:23:16,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:23:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 379. [2020-02-10 20:23:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1288 transitions. [2020-02-10 20:23:16,268 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:16,268 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1288 transitions. [2020-02-10 20:23:16,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1288 transitions. [2020-02-10 20:23:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:16,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:16,269 INFO L415 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] [2020-02-10 20:23:16,269 INFO L427 AbstractCegarLoop]: === Iteration 1718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 398901754, now seen corresponding path program 1712 times [2020-02-10 20:23:16,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:16,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888382251] [2020-02-10 20:23:16,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888382251] [2020-02-10 20:23:16,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:16,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522193426] [2020-02-10 20:23:16,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:16,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:16,516 INFO L87 Difference]: Start difference. First operand 379 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:16,612 INFO L93 Difference]: Finished difference Result 593 states and 1725 transitions. [2020-02-10 20:23:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:16,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:16,614 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:23:16,614 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:23:16,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:23:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 375. [2020-02-10 20:23:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 20:23:16,623 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:16,623 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 20:23:16,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 20:23:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:16,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:16,623 INFO L415 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] [2020-02-10 20:23:16,624 INFO L427 AbstractCegarLoop]: === Iteration 1719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash 141198796, now seen corresponding path program 1713 times [2020-02-10 20:23:16,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:16,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062788432] [2020-02-10 20:23:16,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062788432] [2020-02-10 20:23:16,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:16,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944883613] [2020-02-10 20:23:16,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:16,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:16,889 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:16,967 INFO L93 Difference]: Finished difference Result 594 states and 1730 transitions. [2020-02-10 20:23:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:16,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:16,969 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:23:16,969 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:23:16,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:23:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 381. [2020-02-10 20:23:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:23:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1288 transitions. [2020-02-10 20:23:16,979 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:16,979 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1288 transitions. [2020-02-10 20:23:16,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1288 transitions. [2020-02-10 20:23:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:16,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:16,979 INFO L415 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] [2020-02-10 20:23:16,979 INFO L427 AbstractCegarLoop]: === Iteration 1720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1449901232, now seen corresponding path program 1714 times [2020-02-10 20:23:16,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:16,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149721415] [2020-02-10 20:23:16,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:17,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149721415] [2020-02-10 20:23:17,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:17,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:17,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760151639] [2020-02-10 20:23:17,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:17,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:17,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:17,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:17,230 INFO L87 Difference]: Start difference. First operand 381 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:17,327 INFO L93 Difference]: Finished difference Result 582 states and 1711 transitions. [2020-02-10 20:23:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:17,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:17,329 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:23:17,329 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:23:17,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:23:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 375. [2020-02-10 20:23:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:23:17,337 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:17,338 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:23:17,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:23:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:17,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:17,338 INFO L415 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] [2020-02-10 20:23:17,338 INFO L427 AbstractCegarLoop]: === Iteration 1721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1074097618, now seen corresponding path program 1715 times [2020-02-10 20:23:17,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:17,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493974011] [2020-02-10 20:23:17,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:17,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493974011] [2020-02-10 20:23:17,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:17,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:17,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599279984] [2020-02-10 20:23:17,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:17,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:17,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:17,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:17,590 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:17,684 INFO L93 Difference]: Finished difference Result 586 states and 1709 transitions. [2020-02-10 20:23:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:17,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:17,686 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:23:17,686 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:23:17,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:23:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 378. [2020-02-10 20:23:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 20:23:17,694 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 20:23:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:17,695 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 20:23:17,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 20:23:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:17,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:17,695 INFO L415 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] [2020-02-10 20:23:17,695 INFO L427 AbstractCegarLoop]: === Iteration 1722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash 654949716, now seen corresponding path program 1716 times [2020-02-10 20:23:17,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:17,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920577599] [2020-02-10 20:23:17,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:17,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920577599] [2020-02-10 20:23:17,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:17,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:17,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936362334] [2020-02-10 20:23:17,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:17,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:17,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:17,942 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:23:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,040 INFO L93 Difference]: Finished difference Result 579 states and 1702 transitions. [2020-02-10 20:23:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:18,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,042 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:23:18,042 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:23:18,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:23:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 371. [2020-02-10 20:23:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 20:23:18,050 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,051 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 20:23:18,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 20:23:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:18,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,051 INFO L415 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] [2020-02-10 20:23:18,051 INFO L427 AbstractCegarLoop]: === Iteration 1723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash -475151788, now seen corresponding path program 1717 times [2020-02-10 20:23:18,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799758499] [2020-02-10 20:23:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:18,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799758499] [2020-02-10 20:23:18,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:18,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:18,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998927515] [2020-02-10 20:23:18,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:18,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:18,304 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,382 INFO L93 Difference]: Finished difference Result 588 states and 1708 transitions. [2020-02-10 20:23:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:18,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,384 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:23:18,384 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:18,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 20:23:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:23:18,393 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,393 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:23:18,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:23:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:18,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,393 INFO L415 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] [2020-02-10 20:23:18,394 INFO L427 AbstractCegarLoop]: === Iteration 1724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash 85916704, now seen corresponding path program 1718 times [2020-02-10 20:23:18,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143856117] [2020-02-10 20:23:18,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:18,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143856117] [2020-02-10 20:23:18,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:18,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:18,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337223544] [2020-02-10 20:23:18,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:18,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:18,643 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,716 INFO L93 Difference]: Finished difference Result 581 states and 1693 transitions. [2020-02-10 20:23:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:18,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,718 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:23:18,718 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:23:18,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:23:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 20:23:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:23:18,727 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,727 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:23:18,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:23:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:18,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,728 INFO L415 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] [2020-02-10 20:23:18,728 INFO L427 AbstractCegarLoop]: === Iteration 1725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1631632332, now seen corresponding path program 1719 times [2020-02-10 20:23:18,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457097121] [2020-02-10 20:23:18,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:18,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457097121] [2020-02-10 20:23:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:18,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:18,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068829776] [2020-02-10 20:23:18,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:18,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:18,986 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:19,068 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-02-10 20:23:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:19,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:19,070 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:23:19,070 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:19,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 20:23:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-02-10 20:23:19,078 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-02-10 20:23:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:19,078 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-02-10 20:23:19,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-02-10 20:23:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:19,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:19,079 INFO L415 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] [2020-02-10 20:23:19,079 INFO L427 AbstractCegarLoop]: === Iteration 1726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1824453024, now seen corresponding path program 1720 times [2020-02-10 20:23:19,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:19,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687220653] [2020-02-10 20:23:19,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:19,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687220653] [2020-02-10 20:23:19,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:19,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:19,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149008798] [2020-02-10 20:23:19,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:19,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:19,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:19,328 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:23:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:19,430 INFO L93 Difference]: Finished difference Result 576 states and 1693 transitions. [2020-02-10 20:23:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:19,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:19,431 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:19,432 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:23:19,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:23:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 20:23:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:23:19,440 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:19,440 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:23:19,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:23:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:19,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:19,441 INFO L415 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] [2020-02-10 20:23:19,441 INFO L427 AbstractCegarLoop]: === Iteration 1727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1686354558, now seen corresponding path program 1721 times [2020-02-10 20:23:19,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:19,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588142799] [2020-02-10 20:23:19,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:19,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588142799] [2020-02-10 20:23:19,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:19,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:19,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832331981] [2020-02-10 20:23:19,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:19,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:19,696 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:19,772 INFO L93 Difference]: Finished difference Result 576 states and 1683 transitions. [2020-02-10 20:23:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:19,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:19,774 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:19,774 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:23:19,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:23:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-02-10 20:23:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 20:23:19,783 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 20:23:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:19,783 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 20:23:19,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 20:23:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:19,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:19,784 INFO L415 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] [2020-02-10 20:23:19,784 INFO L427 AbstractCegarLoop]: === Iteration 1728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash -462441978, now seen corresponding path program 1722 times [2020-02-10 20:23:19,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:19,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512039461] [2020-02-10 20:23:19,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:20,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512039461] [2020-02-10 20:23:20,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:20,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:20,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514299021] [2020-02-10 20:23:20,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:20,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:20,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:20,032 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:23:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:20,145 INFO L93 Difference]: Finished difference Result 571 states and 1682 transitions. [2020-02-10 20:23:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:20,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:20,147 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:23:20,147 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:23:20,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:23:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 371. [2020-02-10 20:23:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 20:23:20,156 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 20:23:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:20,156 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 20:23:20,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 20:23:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:20,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:20,157 INFO L415 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] [2020-02-10 20:23:20,157 INFO L427 AbstractCegarLoop]: === Iteration 1729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2112341134, now seen corresponding path program 1723 times [2020-02-10 20:23:20,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:20,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550743406] [2020-02-10 20:23:20,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:20,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550743406] [2020-02-10 20:23:20,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:20,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:20,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130309051] [2020-02-10 20:23:20,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:20,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:20,412 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:23:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:20,506 INFO L93 Difference]: Finished difference Result 568 states and 1666 transitions. [2020-02-10 20:23:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:20,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:20,507 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:23:20,507 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:23:20,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:23:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 20:23:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:23:20,516 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:20,516 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:23:20,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:23:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:20,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:20,517 INFO L415 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] [2020-02-10 20:23:20,517 INFO L427 AbstractCegarLoop]: === Iteration 1730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash 737109152, now seen corresponding path program 1724 times [2020-02-10 20:23:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:20,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052423183] [2020-02-10 20:23:20,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:20,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052423183] [2020-02-10 20:23:20,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:20,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:20,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720425007] [2020-02-10 20:23:20,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:20,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:20,771 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:20,851 INFO L93 Difference]: Finished difference Result 566 states and 1661 transitions. [2020-02-10 20:23:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:20,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:20,852 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:23:20,853 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:23:20,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:23:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 372. [2020-02-10 20:23:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-02-10 20:23:20,861 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:20,862 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-02-10 20:23:20,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-02-10 20:23:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:20,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:20,862 INFO L415 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] [2020-02-10 20:23:20,862 INFO L427 AbstractCegarLoop]: === Iteration 1731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:20,863 INFO L82 PathProgramCache]: Analyzing trace with hash -5557014, now seen corresponding path program 1725 times [2020-02-10 20:23:20,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:20,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846948291] [2020-02-10 20:23:20,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846948291] [2020-02-10 20:23:21,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:21,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611025963] [2020-02-10 20:23:21,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:21,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:21,109 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:21,219 INFO L93 Difference]: Finished difference Result 571 states and 1674 transitions. [2020-02-10 20:23:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:21,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:21,220 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:23:21,221 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:23:21,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:23:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-02-10 20:23:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1271 transitions. [2020-02-10 20:23:21,229 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1271 transitions. Word has length 22 [2020-02-10 20:23:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:21,229 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1271 transitions. [2020-02-10 20:23:21,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1271 transitions. [2020-02-10 20:23:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:21,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:21,230 INFO L415 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] [2020-02-10 20:23:21,230 INFO L427 AbstractCegarLoop]: === Iteration 1732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash -787556256, now seen corresponding path program 1726 times [2020-02-10 20:23:21,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:21,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681616568] [2020-02-10 20:23:21,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681616568] [2020-02-10 20:23:21,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:21,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105235650] [2020-02-10 20:23:21,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:21,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:21,478 INFO L87 Difference]: Start difference. First operand 375 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:23:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:21,589 INFO L93 Difference]: Finished difference Result 564 states and 1667 transitions. [2020-02-10 20:23:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:21,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:21,591 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:23:21,591 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:23:21,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:23:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-02-10 20:23:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-02-10 20:23:21,600 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-02-10 20:23:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:21,601 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-02-10 20:23:21,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-02-10 20:23:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:21,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:21,601 INFO L415 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] [2020-02-10 20:23:21,601 INFO L427 AbstractCegarLoop]: === Iteration 1733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1243455418, now seen corresponding path program 1727 times [2020-02-10 20:23:21,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:21,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700410550] [2020-02-10 20:23:21,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700410550] [2020-02-10 20:23:21,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:21,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15743768] [2020-02-10 20:23:21,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:21,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:21,858 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:23:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:21,928 INFO L93 Difference]: Finished difference Result 567 states and 1663 transitions. [2020-02-10 20:23:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:21,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:21,929 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:23:21,929 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:23:21,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:23:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-02-10 20:23:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:23:21,938 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:21,938 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:23:21,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:23:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:21,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:21,939 INFO L415 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] [2020-02-10 20:23:21,939 INFO L427 AbstractCegarLoop]: === Iteration 1734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -905341118, now seen corresponding path program 1728 times [2020-02-10 20:23:21,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:21,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192508375] [2020-02-10 20:23:21,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:22,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192508375] [2020-02-10 20:23:22,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:22,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:22,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540015982] [2020-02-10 20:23:22,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:22,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:22,188 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:22,289 INFO L93 Difference]: Finished difference Result 562 states and 1662 transitions. [2020-02-10 20:23:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:22,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:22,291 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:23:22,291 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:23:22,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:23:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 369. [2020-02-10 20:23:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:23:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1260 transitions. [2020-02-10 20:23:22,299 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1260 transitions. Word has length 22 [2020-02-10 20:23:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:22,299 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1260 transitions. [2020-02-10 20:23:22,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1260 transitions. [2020-02-10 20:23:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:22,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:22,300 INFO L415 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] [2020-02-10 20:23:22,300 INFO L427 AbstractCegarLoop]: === Iteration 1735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 291899684, now seen corresponding path program 1729 times [2020-02-10 20:23:22,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:22,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116689327] [2020-02-10 20:23:22,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:22,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116689327] [2020-02-10 20:23:22,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:22,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:22,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915472186] [2020-02-10 20:23:22,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:22,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:22,574 INFO L87 Difference]: Start difference. First operand 369 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:23:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:22,654 INFO L93 Difference]: Finished difference Result 614 states and 1793 transitions. [2020-02-10 20:23:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:22,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:22,656 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:23:22,656 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:23:22,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:23:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 381. [2020-02-10 20:23:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:23:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-02-10 20:23:22,665 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-02-10 20:23:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:22,665 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-02-10 20:23:22,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-02-10 20:23:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:22,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:22,666 INFO L415 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] [2020-02-10 20:23:22,666 INFO L427 AbstractCegarLoop]: === Iteration 1736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1882165570, now seen corresponding path program 1730 times [2020-02-10 20:23:22,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:22,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352386736] [2020-02-10 20:23:22,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:22,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352386736] [2020-02-10 20:23:22,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:22,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:22,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994828948] [2020-02-10 20:23:22,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:22,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:22,938 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:23:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,045 INFO L93 Difference]: Finished difference Result 609 states and 1780 transitions. [2020-02-10 20:23:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:23,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,047 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:23:23,047 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:23:23,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:23:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 377. [2020-02-10 20:23:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 20:23:23,056 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,056 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 20:23:23,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 20:23:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:23,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,057 INFO L415 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] [2020-02-10 20:23:23,057 INFO L427 AbstractCegarLoop]: === Iteration 1737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1056777068, now seen corresponding path program 1731 times [2020-02-10 20:23:23,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671928341] [2020-02-10 20:23:23,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:23,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671928341] [2020-02-10 20:23:23,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:23,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:23,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371806388] [2020-02-10 20:23:23,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:23,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:23,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:23,341 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,416 INFO L93 Difference]: Finished difference Result 616 states and 1794 transitions. [2020-02-10 20:23:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:23,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,417 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:23:23,417 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:23:23,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:23:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 382. [2020-02-10 20:23:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:23:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-02-10 20:23:23,426 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-02-10 20:23:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,427 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-02-10 20:23:23,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-02-10 20:23:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:23,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,427 INFO L415 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] [2020-02-10 20:23:23,427 INFO L427 AbstractCegarLoop]: === Iteration 1738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1536862326, now seen corresponding path program 1732 times [2020-02-10 20:23:23,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655653629] [2020-02-10 20:23:23,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:23,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655653629] [2020-02-10 20:23:23,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:23,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:23,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365894417] [2020-02-10 20:23:23,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:23,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:23,711 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:23:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,813 INFO L93 Difference]: Finished difference Result 612 states and 1782 transitions. [2020-02-10 20:23:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:23,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,815 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:23:23,815 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:23:23,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:23:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 377. [2020-02-10 20:23:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 20:23:23,823 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 20:23:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,823 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 20:23:23,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 20:23:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:23,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,824 INFO L415 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] [2020-02-10 20:23:23,824 INFO L427 AbstractCegarLoop]: === Iteration 1739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2022893814, now seen corresponding path program 1733 times [2020-02-10 20:23:23,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406137721] [2020-02-10 20:23:23,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:24,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406137721] [2020-02-10 20:23:24,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:24,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:24,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786561050] [2020-02-10 20:23:24,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:24,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:24,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:24,095 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:23:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:24,195 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-02-10 20:23:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:24,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:24,197 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:23:24,197 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:23:24,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:23:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 380. [2020-02-10 20:23:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1289 transitions. [2020-02-10 20:23:24,206 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1289 transitions. Word has length 22 [2020-02-10 20:23:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:24,206 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1289 transitions. [2020-02-10 20:23:24,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1289 transitions. [2020-02-10 20:23:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:24,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:24,207 INFO L415 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] [2020-02-10 20:23:24,207 INFO L427 AbstractCegarLoop]: === Iteration 1740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1398332802, now seen corresponding path program 1734 times [2020-02-10 20:23:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:24,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670257501] [2020-02-10 20:23:24,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:24,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670257501] [2020-02-10 20:23:24,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:24,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:24,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835612018] [2020-02-10 20:23:24,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:24,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:24,474 INFO L87 Difference]: Start difference. First operand 380 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:23:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:24,580 INFO L93 Difference]: Finished difference Result 605 states and 1766 transitions. [2020-02-10 20:23:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:24,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:24,582 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:23:24,582 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:23:24,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:23:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 373. [2020-02-10 20:23:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 20:23:24,591 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:24,591 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 20:23:24,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 20:23:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:24,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:24,592 INFO L415 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] [2020-02-10 20:23:24,592 INFO L427 AbstractCegarLoop]: === Iteration 1741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:24,592 INFO L82 PathProgramCache]: Analyzing trace with hash -130586042, now seen corresponding path program 1735 times [2020-02-10 20:23:24,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:24,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406857817] [2020-02-10 20:23:24,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:24,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406857817] [2020-02-10 20:23:24,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:24,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:24,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987434240] [2020-02-10 20:23:24,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:24,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:24,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:24,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:24,858 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:24,945 INFO L93 Difference]: Finished difference Result 608 states and 1770 transitions. [2020-02-10 20:23:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:24,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:24,947 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:23:24,947 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:23:24,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:23:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 381. [2020-02-10 20:23:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:23:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1294 transitions. [2020-02-10 20:23:24,956 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1294 transitions. Word has length 22 [2020-02-10 20:23:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:24,956 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1294 transitions. [2020-02-10 20:23:24,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1294 transitions. [2020-02-10 20:23:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:24,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:24,957 INFO L415 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] [2020-02-10 20:23:24,957 INFO L427 AbstractCegarLoop]: === Iteration 1742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1459679844, now seen corresponding path program 1736 times [2020-02-10 20:23:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:24,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006611170] [2020-02-10 20:23:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006611170] [2020-02-10 20:23:25,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:25,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194282354] [2020-02-10 20:23:25,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:25,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:25,216 INFO L87 Difference]: Start difference. First operand 381 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:23:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:25,322 INFO L93 Difference]: Finished difference Result 603 states and 1757 transitions. [2020-02-10 20:23:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:25,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:25,324 INFO L225 Difference]: With dead ends: 603 [2020-02-10 20:23:25,324 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:23:25,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:23:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 377. [2020-02-10 20:23:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 20:23:25,333 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 20:23:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:25,333 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 20:23:25,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 20:23:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:25,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:25,333 INFO L415 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] [2020-02-10 20:23:25,334 INFO L427 AbstractCegarLoop]: === Iteration 1743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1201976886, now seen corresponding path program 1737 times [2020-02-10 20:23:25,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:25,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175579723] [2020-02-10 20:23:25,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175579723] [2020-02-10 20:23:25,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:25,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30918865] [2020-02-10 20:23:25,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:25,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:25,608 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:23:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:25,689 INFO L93 Difference]: Finished difference Result 604 states and 1762 transitions. [2020-02-10 20:23:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:25,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:25,691 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:23:25,691 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:23:25,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:23:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 20:23:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:23:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1294 transitions. [2020-02-10 20:23:25,700 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1294 transitions. Word has length 22 [2020-02-10 20:23:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:25,700 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1294 transitions. [2020-02-10 20:23:25,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1294 transitions. [2020-02-10 20:23:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:25,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:25,701 INFO L415 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] [2020-02-10 20:23:25,701 INFO L427 AbstractCegarLoop]: === Iteration 1744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -389123142, now seen corresponding path program 1738 times [2020-02-10 20:23:25,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:25,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269692239] [2020-02-10 20:23:25,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269692239] [2020-02-10 20:23:25,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:25,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126924622] [2020-02-10 20:23:25,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:25,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:25,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:25,966 INFO L87 Difference]: Start difference. First operand 383 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:23:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,071 INFO L93 Difference]: Finished difference Result 592 states and 1743 transitions. [2020-02-10 20:23:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:26,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,072 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:23:26,072 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:23:26,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:23:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-02-10 20:23:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1280 transitions. [2020-02-10 20:23:26,081 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1280 transitions. Word has length 22 [2020-02-10 20:23:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,081 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1280 transitions. [2020-02-10 20:23:26,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1280 transitions. [2020-02-10 20:23:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:26,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,082 INFO L415 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] [2020-02-10 20:23:26,082 INFO L427 AbstractCegarLoop]: === Iteration 1745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash -13319528, now seen corresponding path program 1739 times [2020-02-10 20:23:26,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810663317] [2020-02-10 20:23:26,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:26,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810663317] [2020-02-10 20:23:26,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:26,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:26,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084964804] [2020-02-10 20:23:26,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:26,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:26,343 INFO L87 Difference]: Start difference. First operand 377 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:23:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,441 INFO L93 Difference]: Finished difference Result 596 states and 1741 transitions. [2020-02-10 20:23:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:26,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,443 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:23:26,443 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:23:26,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:23:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 380. [2020-02-10 20:23:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1285 transitions. [2020-02-10 20:23:26,452 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1285 transitions. Word has length 22 [2020-02-10 20:23:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,452 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1285 transitions. [2020-02-10 20:23:26,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1285 transitions. [2020-02-10 20:23:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:26,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,452 INFO L415 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] [2020-02-10 20:23:26,453 INFO L427 AbstractCegarLoop]: === Iteration 1746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1715727806, now seen corresponding path program 1740 times [2020-02-10 20:23:26,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575362356] [2020-02-10 20:23:26,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:26,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575362356] [2020-02-10 20:23:26,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:26,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:26,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919715289] [2020-02-10 20:23:26,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:26,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:26,716 INFO L87 Difference]: Start difference. First operand 380 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:23:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,815 INFO L93 Difference]: Finished difference Result 589 states and 1734 transitions. [2020-02-10 20:23:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:26,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,817 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:23:26,817 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:23:26,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:23:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 373. [2020-02-10 20:23:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:23:26,826 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,826 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:23:26,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:23:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:26,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,827 INFO L415 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] [2020-02-10 20:23:26,827 INFO L427 AbstractCegarLoop]: === Iteration 1747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1597968036, now seen corresponding path program 1741 times [2020-02-10 20:23:26,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040712100] [2020-02-10 20:23:26,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:27,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040712100] [2020-02-10 20:23:27,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:27,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:27,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974358008] [2020-02-10 20:23:27,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:27,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:27,110 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:27,190 INFO L93 Difference]: Finished difference Result 605 states and 1766 transitions. [2020-02-10 20:23:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:27,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:27,192 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:23:27,192 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:23:27,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:23:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2020-02-10 20:23:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:23:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1296 transitions. [2020-02-10 20:23:27,202 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1296 transitions. Word has length 22 [2020-02-10 20:23:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:27,202 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1296 transitions. [2020-02-10 20:23:27,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1296 transitions. [2020-02-10 20:23:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:27,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:27,203 INFO L415 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] [2020-02-10 20:23:27,203 INFO L427 AbstractCegarLoop]: === Iteration 1748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash -103359866, now seen corresponding path program 1742 times [2020-02-10 20:23:27,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:27,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563679829] [2020-02-10 20:23:27,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:27,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563679829] [2020-02-10 20:23:27,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:27,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:27,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946395970] [2020-02-10 20:23:27,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:27,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:27,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:27,474 INFO L87 Difference]: Start difference. First operand 383 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:23:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:27,587 INFO L93 Difference]: Finished difference Result 601 states and 1754 transitions. [2020-02-10 20:23:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:27,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:27,589 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:23:27,589 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 20:23:27,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 20:23:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 378. [2020-02-10 20:23:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1283 transitions. [2020-02-10 20:23:27,597 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1283 transitions. Word has length 22 [2020-02-10 20:23:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:27,597 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1283 transitions. [2020-02-10 20:23:27,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1283 transitions. [2020-02-10 20:23:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:27,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:27,598 INFO L415 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] [2020-02-10 20:23:27,598 INFO L427 AbstractCegarLoop]: === Iteration 1749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1952296762, now seen corresponding path program 1743 times [2020-02-10 20:23:27,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:27,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914737514] [2020-02-10 20:23:27,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:27,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914737514] [2020-02-10 20:23:27,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:27,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:27,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928799913] [2020-02-10 20:23:27,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:27,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:27,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:27,877 INFO L87 Difference]: Start difference. First operand 378 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:23:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:27,968 INFO L93 Difference]: Finished difference Result 593 states and 1736 transitions. [2020-02-10 20:23:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:27,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:27,970 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:23:27,970 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:23:27,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:23:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 20:23:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:23:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1293 transitions. [2020-02-10 20:23:27,979 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1293 transitions. Word has length 22 [2020-02-10 20:23:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:27,979 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1293 transitions. [2020-02-10 20:23:27,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1293 transitions. [2020-02-10 20:23:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:27,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:27,980 INFO L415 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] [2020-02-10 20:23:27,980 INFO L427 AbstractCegarLoop]: === Iteration 1750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash 751570506, now seen corresponding path program 1744 times [2020-02-10 20:23:27,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:27,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971307121] [2020-02-10 20:23:27,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:28,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971307121] [2020-02-10 20:23:28,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:28,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:28,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637094996] [2020-02-10 20:23:28,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:28,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:28,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:28,254 INFO L87 Difference]: Start difference. First operand 384 states and 1293 transitions. Second operand 9 states. [2020-02-10 20:23:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:28,375 INFO L93 Difference]: Finished difference Result 581 states and 1717 transitions. [2020-02-10 20:23:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:28,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:28,377 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:23:28,377 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:23:28,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:23:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 378. [2020-02-10 20:23:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-02-10 20:23:28,385 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:28,386 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-02-10 20:23:28,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-02-10 20:23:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:28,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:28,386 INFO L415 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] [2020-02-10 20:23:28,386 INFO L427 AbstractCegarLoop]: === Iteration 1751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1253450174, now seen corresponding path program 1745 times [2020-02-10 20:23:28,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:28,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271350214] [2020-02-10 20:23:28,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:28,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271350214] [2020-02-10 20:23:28,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:28,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:28,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226131646] [2020-02-10 20:23:28,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:28,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:28,662 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:28,774 INFO L93 Difference]: Finished difference Result 578 states and 1711 transitions. [2020-02-10 20:23:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:28,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:28,776 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:23:28,776 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:23:28,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:23:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 20:23:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:23:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1285 transitions. [2020-02-10 20:23:28,784 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1285 transitions. Word has length 22 [2020-02-10 20:23:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:28,784 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1285 transitions. [2020-02-10 20:23:28,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1285 transitions. [2020-02-10 20:23:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:28,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:28,785 INFO L415 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] [2020-02-10 20:23:28,785 INFO L427 AbstractCegarLoop]: === Iteration 1752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash -394575644, now seen corresponding path program 1746 times [2020-02-10 20:23:28,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:28,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960684074] [2020-02-10 20:23:28,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:29,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960684074] [2020-02-10 20:23:29,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:29,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:29,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706865950] [2020-02-10 20:23:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:29,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:29,058 INFO L87 Difference]: Start difference. First operand 382 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:23:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:29,165 INFO L93 Difference]: Finished difference Result 565 states and 1692 transitions. [2020-02-10 20:23:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:29,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:29,167 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:23:29,167 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:23:29,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:23:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 373. [2020-02-10 20:23:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:23:29,176 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:29,177 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:23:29,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:23:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:29,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:29,177 INFO L415 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] [2020-02-10 20:23:29,177 INFO L427 AbstractCegarLoop]: === Iteration 1753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash -690413758, now seen corresponding path program 1747 times [2020-02-10 20:23:29,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:29,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41429052] [2020-02-10 20:23:29,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:29,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41429052] [2020-02-10 20:23:29,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:29,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:29,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933745992] [2020-02-10 20:23:29,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:29,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:29,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:29,445 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:29,548 INFO L93 Difference]: Finished difference Result 588 states and 1724 transitions. [2020-02-10 20:23:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:29,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:29,550 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:23:29,550 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:23:29,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:23:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 20:23:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1282 transitions. [2020-02-10 20:23:29,559 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1282 transitions. Word has length 22 [2020-02-10 20:23:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:29,559 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1282 transitions. [2020-02-10 20:23:29,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1282 transitions. [2020-02-10 20:23:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:29,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:29,560 INFO L415 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] [2020-02-10 20:23:29,560 INFO L427 AbstractCegarLoop]: === Iteration 1754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash 183326922, now seen corresponding path program 1748 times [2020-02-10 20:23:29,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:29,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215684725] [2020-02-10 20:23:29,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:29,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215684725] [2020-02-10 20:23:29,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:29,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:29,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905380730] [2020-02-10 20:23:29,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:29,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:29,836 INFO L87 Difference]: Start difference. First operand 379 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:23:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:29,951 INFO L93 Difference]: Finished difference Result 589 states and 1723 transitions. [2020-02-10 20:23:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:29,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:29,953 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:23:29,953 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:23:29,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:23:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-02-10 20:23:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-02-10 20:23:29,962 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:29,962 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-02-10 20:23:29,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-02-10 20:23:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:29,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:29,963 INFO L415 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] [2020-02-10 20:23:29,963 INFO L427 AbstractCegarLoop]: === Iteration 1755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash 54288740, now seen corresponding path program 1749 times [2020-02-10 20:23:29,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:29,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885290865] [2020-02-10 20:23:29,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:30,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885290865] [2020-02-10 20:23:30,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:30,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:30,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574903849] [2020-02-10 20:23:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:30,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:30,230 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:30,344 INFO L93 Difference]: Finished difference Result 583 states and 1710 transitions. [2020-02-10 20:23:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:30,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:30,345 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:23:30,346 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:30,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 20:23:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1279 transitions. [2020-02-10 20:23:30,355 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1279 transitions. Word has length 22 [2020-02-10 20:23:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:30,355 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1279 transitions. [2020-02-10 20:23:30,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1279 transitions. [2020-02-10 20:23:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:30,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:30,356 INFO L415 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] [2020-02-10 20:23:30,356 INFO L427 AbstractCegarLoop]: === Iteration 1756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1783336074, now seen corresponding path program 1750 times [2020-02-10 20:23:30,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:30,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564450669] [2020-02-10 20:23:30,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564450669] [2020-02-10 20:23:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:30,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:30,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313862297] [2020-02-10 20:23:30,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:30,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:30,634 INFO L87 Difference]: Start difference. First operand 379 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:23:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:30,748 INFO L93 Difference]: Finished difference Result 576 states and 1703 transitions. [2020-02-10 20:23:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:30,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:30,750 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:30,750 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:23:30,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:23:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 376. [2020-02-10 20:23:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 20:23:30,759 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 20:23:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:30,759 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 20:23:30,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 20:23:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:30,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:30,760 INFO L415 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] [2020-02-10 20:23:30,760 INFO L427 AbstractCegarLoop]: === Iteration 1757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2050780572, now seen corresponding path program 1751 times [2020-02-10 20:23:30,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:30,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740162273] [2020-02-10 20:23:30,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:31,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740162273] [2020-02-10 20:23:31,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:31,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:31,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365713471] [2020-02-10 20:23:31,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:31,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:31,027 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:23:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:31,149 INFO L93 Difference]: Finished difference Result 576 states and 1704 transitions. [2020-02-10 20:23:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:31,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:31,151 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:31,151 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 20:23:31,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 20:23:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 380. [2020-02-10 20:23:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1278 transitions. [2020-02-10 20:23:31,160 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:31,160 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1278 transitions. [2020-02-10 20:23:31,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1278 transitions. [2020-02-10 20:23:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:31,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:31,161 INFO L415 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] [2020-02-10 20:23:31,161 INFO L427 AbstractCegarLoop]: === Iteration 1758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1195473918, now seen corresponding path program 1752 times [2020-02-10 20:23:31,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:31,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567614467] [2020-02-10 20:23:31,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:31,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567614467] [2020-02-10 20:23:31,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:31,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:31,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065967775] [2020-02-10 20:23:31,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:31,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:31,433 INFO L87 Difference]: Start difference. First operand 380 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:31,546 INFO L93 Difference]: Finished difference Result 563 states and 1685 transitions. [2020-02-10 20:23:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:31,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:31,548 INFO L225 Difference]: With dead ends: 563 [2020-02-10 20:23:31,548 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:23:31,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:23:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 369. [2020-02-10 20:23:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:23:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-02-10 20:23:31,556 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-02-10 20:23:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:31,556 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-02-10 20:23:31,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-02-10 20:23:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:31,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:31,557 INFO L415 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] [2020-02-10 20:23:31,557 INFO L427 AbstractCegarLoop]: === Iteration 1759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash 830437174, now seen corresponding path program 1753 times [2020-02-10 20:23:31,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:31,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465803478] [2020-02-10 20:23:31,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:31,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465803478] [2020-02-10 20:23:31,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:31,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:31,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150108643] [2020-02-10 20:23:31,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:31,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:31,820 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-02-10 20:23:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:31,912 INFO L93 Difference]: Finished difference Result 590 states and 1715 transitions. [2020-02-10 20:23:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:31,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:31,914 INFO L225 Difference]: With dead ends: 590 [2020-02-10 20:23:31,914 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:23:31,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:23:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 375. [2020-02-10 20:23:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:23:31,923 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:31,923 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:23:31,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:23:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:31,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:31,924 INFO L415 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] [2020-02-10 20:23:31,924 INFO L427 AbstractCegarLoop]: === Iteration 1760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1391505666, now seen corresponding path program 1754 times [2020-02-10 20:23:31,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:31,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053734209] [2020-02-10 20:23:31,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:32,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053734209] [2020-02-10 20:23:32,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:32,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:32,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129772663] [2020-02-10 20:23:32,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:32,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:32,185 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:32,265 INFO L93 Difference]: Finished difference Result 583 states and 1700 transitions. [2020-02-10 20:23:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:32,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:32,266 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:23:32,266 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:32,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-02-10 20:23:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:23:32,274 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:32,274 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:23:32,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:23:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:32,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:32,275 INFO L415 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] [2020-02-10 20:23:32,275 INFO L427 AbstractCegarLoop]: === Iteration 1761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash 242691852, now seen corresponding path program 1755 times [2020-02-10 20:23:32,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:32,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076739301] [2020-02-10 20:23:32,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:32,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076739301] [2020-02-10 20:23:32,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:32,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:32,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598042919] [2020-02-10 20:23:32,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:32,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:32,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:32,545 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:32,630 INFO L93 Difference]: Finished difference Result 596 states and 1728 transitions. [2020-02-10 20:23:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:32,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:32,632 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:23:32,632 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:23:32,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:23:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 378. [2020-02-10 20:23:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-02-10 20:23:32,641 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:32,642 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-02-10 20:23:32,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-02-10 20:23:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:32,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:32,642 INFO L415 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] [2020-02-10 20:23:32,642 INFO L427 AbstractCegarLoop]: === Iteration 1762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2030358786, now seen corresponding path program 1756 times [2020-02-10 20:23:32,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:32,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791194258] [2020-02-10 20:23:32,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:32,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791194258] [2020-02-10 20:23:32,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:32,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:32,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357661327] [2020-02-10 20:23:32,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:32,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:32,909 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:33,011 INFO L93 Difference]: Finished difference Result 592 states and 1716 transitions. [2020-02-10 20:23:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:33,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:33,012 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:23:33,013 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:23:33,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:23:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-02-10 20:23:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:23:33,021 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:33,022 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:23:33,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:23:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:33,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:33,022 INFO L415 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] [2020-02-10 20:23:33,022 INFO L427 AbstractCegarLoop]: === Iteration 1763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 297414078, now seen corresponding path program 1757 times [2020-02-10 20:23:33,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:33,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686511455] [2020-02-10 20:23:33,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:33,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686511455] [2020-02-10 20:23:33,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:33,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:33,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806554913] [2020-02-10 20:23:33,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:33,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:33,286 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:33,368 INFO L93 Difference]: Finished difference Result 578 states and 1689 transitions. [2020-02-10 20:23:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:33,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:33,369 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:23:33,369 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:23:33,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:23:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 374. [2020-02-10 20:23:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 20:23:33,378 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 20:23:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:33,378 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 20:23:33,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 20:23:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:33,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:33,379 INFO L415 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] [2020-02-10 20:23:33,379 INFO L427 AbstractCegarLoop]: === Iteration 1764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash 832643880, now seen corresponding path program 1758 times [2020-02-10 20:23:33,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:33,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031525984] [2020-02-10 20:23:33,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:33,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031525984] [2020-02-10 20:23:33,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:33,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:33,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957769168] [2020-02-10 20:23:33,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:33,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:33,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:33,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:33,645 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:23:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:33,748 INFO L93 Difference]: Finished difference Result 581 states and 1694 transitions. [2020-02-10 20:23:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:33,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:33,750 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:23:33,750 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:23:33,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:23:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2020-02-10 20:23:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 20:23:33,759 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 20:23:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:33,759 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 20:23:33,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 20:23:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:33,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:33,760 INFO L415 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] [2020-02-10 20:23:33,760 INFO L427 AbstractCegarLoop]: === Iteration 1765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:33,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1538496044, now seen corresponding path program 1759 times [2020-02-10 20:23:33,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:33,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797672740] [2020-02-10 20:23:33,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:34,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797672740] [2020-02-10 20:23:34,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:34,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:34,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501880071] [2020-02-10 20:23:34,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:34,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:34,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:34,022 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:23:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:34,111 INFO L93 Difference]: Finished difference Result 588 states and 1708 transitions. [2020-02-10 20:23:34,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:34,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:34,112 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:23:34,112 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:34,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 20:23:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-02-10 20:23:34,121 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-02-10 20:23:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:34,121 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-02-10 20:23:34,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-02-10 20:23:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:34,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:34,122 INFO L415 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] [2020-02-10 20:23:34,122 INFO L427 AbstractCegarLoop]: === Iteration 1766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash -977427552, now seen corresponding path program 1760 times [2020-02-10 20:23:34,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:34,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752778071] [2020-02-10 20:23:34,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:34,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752778071] [2020-02-10 20:23:34,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:34,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:34,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953309769] [2020-02-10 20:23:34,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:34,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:34,370 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:23:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:34,453 INFO L93 Difference]: Finished difference Result 581 states and 1693 transitions. [2020-02-10 20:23:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:34,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:34,455 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:23:34,455 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:23:34,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:23:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 20:23:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:23:34,464 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:34,465 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:23:34,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:23:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:34,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:34,465 INFO L415 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] [2020-02-10 20:23:34,465 INFO L427 AbstractCegarLoop]: === Iteration 1767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash 568288076, now seen corresponding path program 1761 times [2020-02-10 20:23:34,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:34,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960812262] [2020-02-10 20:23:34,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:34,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960812262] [2020-02-10 20:23:34,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:34,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:34,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686619033] [2020-02-10 20:23:34,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:34,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:34,725 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:34,823 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-02-10 20:23:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:34,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:34,825 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:23:34,825 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:23:34,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:23:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 20:23:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1278 transitions. [2020-02-10 20:23:34,834 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:34,834 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1278 transitions. [2020-02-10 20:23:34,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1278 transitions. [2020-02-10 20:23:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:34,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:34,835 INFO L415 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] [2020-02-10 20:23:34,835 INFO L427 AbstractCegarLoop]: === Iteration 1768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash 761108768, now seen corresponding path program 1762 times [2020-02-10 20:23:34,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:34,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203091019] [2020-02-10 20:23:34,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:35,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203091019] [2020-02-10 20:23:35,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:35,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:35,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637250479] [2020-02-10 20:23:35,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:35,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:35,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:35,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:35,090 INFO L87 Difference]: Start difference. First operand 379 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:35,185 INFO L93 Difference]: Finished difference Result 576 states and 1693 transitions. [2020-02-10 20:23:35,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:35,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:35,186 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:35,187 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:23:35,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:23:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 20:23:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:23:35,195 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:35,195 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:23:35,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:23:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:35,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:35,196 INFO L415 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] [2020-02-10 20:23:35,196 INFO L427 AbstractCegarLoop]: === Iteration 1769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash 623010302, now seen corresponding path program 1763 times [2020-02-10 20:23:35,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:35,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864479410] [2020-02-10 20:23:35,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:35,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864479410] [2020-02-10 20:23:35,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:35,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019777800] [2020-02-10 20:23:35,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:35,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:35,451 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:35,533 INFO L93 Difference]: Finished difference Result 576 states and 1683 transitions. [2020-02-10 20:23:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:35,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:35,535 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:23:35,535 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:23:35,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:23:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-02-10 20:23:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-02-10 20:23:35,544 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-02-10 20:23:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:35,544 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-02-10 20:23:35,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-02-10 20:23:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:35,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:35,545 INFO L415 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] [2020-02-10 20:23:35,545 INFO L427 AbstractCegarLoop]: === Iteration 1770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1525786234, now seen corresponding path program 1764 times [2020-02-10 20:23:35,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:35,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730527615] [2020-02-10 20:23:35,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:35,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730527615] [2020-02-10 20:23:35,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:35,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:35,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018528675] [2020-02-10 20:23:35,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:35,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:35,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:35,791 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-02-10 20:23:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:35,901 INFO L93 Difference]: Finished difference Result 571 states and 1682 transitions. [2020-02-10 20:23:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:35,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:35,903 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:23:35,903 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:23:35,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:23:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 371. [2020-02-10 20:23:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 20:23:35,912 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 20:23:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:35,912 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 20:23:35,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 20:23:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:35,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:35,913 INFO L415 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] [2020-02-10 20:23:35,913 INFO L427 AbstractCegarLoop]: === Iteration 1771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1128490132, now seen corresponding path program 1765 times [2020-02-10 20:23:35,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:35,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815714276] [2020-02-10 20:23:35,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:36,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815714276] [2020-02-10 20:23:36,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:36,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:36,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28415044] [2020-02-10 20:23:36,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:36,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:36,190 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:23:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:36,281 INFO L93 Difference]: Finished difference Result 595 states and 1734 transitions. [2020-02-10 20:23:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:36,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:36,282 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:23:36,283 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:23:36,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:23:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 381. [2020-02-10 20:23:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:23:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1288 transitions. [2020-02-10 20:23:36,290 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:36,291 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1288 transitions. [2020-02-10 20:23:36,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1288 transitions. [2020-02-10 20:23:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:36,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:36,291 INFO L415 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] [2020-02-10 20:23:36,291 INFO L427 AbstractCegarLoop]: === Iteration 1772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1144560506, now seen corresponding path program 1766 times [2020-02-10 20:23:36,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:36,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890236077] [2020-02-10 20:23:36,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:36,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890236077] [2020-02-10 20:23:36,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:36,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:36,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419092487] [2020-02-10 20:23:36,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:36,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:36,560 INFO L87 Difference]: Start difference. First operand 381 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:36,659 INFO L93 Difference]: Finished difference Result 591 states and 1722 transitions. [2020-02-10 20:23:36,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:36,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:36,661 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:23:36,661 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:23:36,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:23:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-02-10 20:23:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1275 transitions. [2020-02-10 20:23:36,671 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1275 transitions. Word has length 22 [2020-02-10 20:23:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:36,671 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1275 transitions. [2020-02-10 20:23:36,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1275 transitions. [2020-02-10 20:23:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:36,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:36,671 INFO L415 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] [2020-02-10 20:23:36,672 INFO L427 AbstractCegarLoop]: === Iteration 1773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash -471947722, now seen corresponding path program 1767 times [2020-02-10 20:23:36,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:36,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840625848] [2020-02-10 20:23:36,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:36,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840625848] [2020-02-10 20:23:36,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:36,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:36,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976034647] [2020-02-10 20:23:36,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:36,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:36,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:36,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:36,940 INFO L87 Difference]: Start difference. First operand 376 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:23:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:37,034 INFO L93 Difference]: Finished difference Result 583 states and 1704 transitions. [2020-02-10 20:23:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:37,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:37,036 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:23:37,036 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:23:37,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:23:37,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 382. [2020-02-10 20:23:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:23:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1285 transitions. [2020-02-10 20:23:37,045 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1285 transitions. Word has length 22 [2020-02-10 20:23:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:37,046 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1285 transitions. [2020-02-10 20:23:37,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1285 transitions. [2020-02-10 20:23:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:37,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:37,046 INFO L415 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] [2020-02-10 20:23:37,046 INFO L427 AbstractCegarLoop]: === Iteration 1774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:37,047 INFO L82 PathProgramCache]: Analyzing trace with hash -279127030, now seen corresponding path program 1768 times [2020-02-10 20:23:37,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:37,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310132618] [2020-02-10 20:23:37,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:37,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310132618] [2020-02-10 20:23:37,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:37,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:37,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778605254] [2020-02-10 20:23:37,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:37,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:37,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:37,310 INFO L87 Difference]: Start difference. First operand 382 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:23:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:37,424 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-02-10 20:23:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:37,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:37,426 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:23:37,426 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:23:37,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:23:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2020-02-10 20:23:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1270 transitions. [2020-02-10 20:23:37,441 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:37,441 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1270 transitions. [2020-02-10 20:23:37,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1270 transitions. [2020-02-10 20:23:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:37,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:37,442 INFO L415 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] [2020-02-10 20:23:37,442 INFO L427 AbstractCegarLoop]: === Iteration 1775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1467283954, now seen corresponding path program 1769 times [2020-02-10 20:23:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422337102] [2020-02-10 20:23:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:37,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422337102] [2020-02-10 20:23:37,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:37,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:37,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787719192] [2020-02-10 20:23:37,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:37,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:37,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:37,709 INFO L87 Difference]: Start difference. First operand 376 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:37,806 INFO L93 Difference]: Finished difference Result 568 states and 1679 transitions. [2020-02-10 20:23:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:37,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:37,808 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:23:37,808 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:23:37,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:23:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 380. [2020-02-10 20:23:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1277 transitions. [2020-02-10 20:23:37,817 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1277 transitions. Word has length 22 [2020-02-10 20:23:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:37,817 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1277 transitions. [2020-02-10 20:23:37,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1277 transitions. [2020-02-10 20:23:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:37,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:37,818 INFO L415 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] [2020-02-10 20:23:37,818 INFO L427 AbstractCegarLoop]: === Iteration 1776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1968808812, now seen corresponding path program 1770 times [2020-02-10 20:23:37,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:37,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219069404] [2020-02-10 20:23:37,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:38,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219069404] [2020-02-10 20:23:38,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:38,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:38,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028519147] [2020-02-10 20:23:38,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:38,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:38,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:38,080 INFO L87 Difference]: Start difference. First operand 380 states and 1277 transitions. Second operand 9 states. [2020-02-10 20:23:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,185 INFO L93 Difference]: Finished difference Result 555 states and 1660 transitions. [2020-02-10 20:23:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:38,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,187 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:23:38,187 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:23:38,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:23:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 371. [2020-02-10 20:23:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-02-10 20:23:38,197 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-02-10 20:23:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,197 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-02-10 20:23:38,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-02-10 20:23:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:38,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,197 INFO L415 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] [2020-02-10 20:23:38,198 INFO L427 AbstractCegarLoop]: === Iteration 1777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1628620000, now seen corresponding path program 1771 times [2020-02-10 20:23:38,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807475857] [2020-02-10 20:23:38,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:38,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807475857] [2020-02-10 20:23:38,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:38,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:38,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445599959] [2020-02-10 20:23:38,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:38,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:38,465 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:23:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,552 INFO L93 Difference]: Finished difference Result 568 states and 1666 transitions. [2020-02-10 20:23:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:38,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,554 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:23:38,554 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:23:38,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:23:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-02-10 20:23:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1264 transitions. [2020-02-10 20:23:38,563 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1264 transitions. Word has length 22 [2020-02-10 20:23:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,563 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1264 transitions. [2020-02-10 20:23:38,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1264 transitions. [2020-02-10 20:23:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:38,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,564 INFO L415 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] [2020-02-10 20:23:38,564 INFO L427 AbstractCegarLoop]: === Iteration 1778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1093390198, now seen corresponding path program 1772 times [2020-02-10 20:23:38,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236791311] [2020-02-10 20:23:38,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:38,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236791311] [2020-02-10 20:23:38,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:38,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:38,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346429946] [2020-02-10 20:23:38,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:38,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:38,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:38,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:38,828 INFO L87 Difference]: Start difference. First operand 373 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:23:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,943 INFO L93 Difference]: Finished difference Result 571 states and 1671 transitions. [2020-02-10 20:23:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:38,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,944 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:23:38,944 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:23:38,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:23:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-02-10 20:23:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-02-10 20:23:38,953 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-02-10 20:23:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,953 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-02-10 20:23:38,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-02-10 20:23:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:38,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,954 INFO L415 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] [2020-02-10 20:23:38,954 INFO L427 AbstractCegarLoop]: === Iteration 1779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1065909442, now seen corresponding path program 1773 times [2020-02-10 20:23:38,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367229186] [2020-02-10 20:23:38,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:39,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367229186] [2020-02-10 20:23:39,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:39,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:39,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233089357] [2020-02-10 20:23:39,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:39,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:39,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:39,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:39,211 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:23:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:39,288 INFO L93 Difference]: Finished difference Result 567 states and 1664 transitions. [2020-02-10 20:23:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:39,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:39,290 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:23:39,290 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:23:39,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:23:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-02-10 20:23:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 20:23:39,299 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 20:23:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:39,299 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 20:23:39,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 20:23:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:39,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:39,300 INFO L415 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] [2020-02-10 20:23:39,300 INFO L427 AbstractCegarLoop]: === Iteration 1780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1082887094, now seen corresponding path program 1774 times [2020-02-10 20:23:39,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:39,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296037268] [2020-02-10 20:23:39,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:39,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296037268] [2020-02-10 20:23:39,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:39,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:39,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269322990] [2020-02-10 20:23:39,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:39,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:39,550 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:23:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:39,665 INFO L93 Difference]: Finished difference Result 562 states and 1663 transitions. [2020-02-10 20:23:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:39,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:39,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:39,666 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:23:39,667 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:23:39,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:23:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-02-10 20:23:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 20:23:39,676 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 20:23:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:39,676 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 20:23:39,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 20:23:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:39,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:39,677 INFO L415 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] [2020-02-10 20:23:39,677 INFO L427 AbstractCegarLoop]: === Iteration 1781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1013393922, now seen corresponding path program 1775 times [2020-02-10 20:23:39,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:39,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415884801] [2020-02-10 20:23:39,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:39,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415884801] [2020-02-10 20:23:39,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:39,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:39,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574394564] [2020-02-10 20:23:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:39,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:39,941 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:23:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:40,039 INFO L93 Difference]: Finished difference Result 564 states and 1670 transitions. [2020-02-10 20:23:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:40,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:40,041 INFO L225 Difference]: With dead ends: 564 [2020-02-10 20:23:40,041 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:23:40,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:23:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2020-02-10 20:23:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1268 transitions. [2020-02-10 20:23:40,050 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1268 transitions. Word has length 22 [2020-02-10 20:23:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:40,051 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1268 transitions. [2020-02-10 20:23:40,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1268 transitions. [2020-02-10 20:23:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:40,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:40,051 INFO L415 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] [2020-02-10 20:23:40,051 INFO L427 AbstractCegarLoop]: === Iteration 1782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1670632416, now seen corresponding path program 1776 times [2020-02-10 20:23:40,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:40,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165468236] [2020-02-10 20:23:40,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:40,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165468236] [2020-02-10 20:23:40,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:40,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:40,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887021264] [2020-02-10 20:23:40,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:40,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:40,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:40,312 INFO L87 Difference]: Start difference. First operand 376 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:23:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:40,411 INFO L93 Difference]: Finished difference Result 551 states and 1651 transitions. [2020-02-10 20:23:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:40,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:40,413 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:23:40,413 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 20:23:40,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 20:23:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 369. [2020-02-10 20:23:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:23:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1256 transitions. [2020-02-10 20:23:40,421 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1256 transitions. Word has length 22 [2020-02-10 20:23:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:40,421 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1256 transitions. [2020-02-10 20:23:40,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1256 transitions. [2020-02-10 20:23:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:40,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:40,422 INFO L415 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] [2020-02-10 20:23:40,422 INFO L427 AbstractCegarLoop]: === Iteration 1783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:40,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1651723624, now seen corresponding path program 1777 times [2020-02-10 20:23:40,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:40,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162406536] [2020-02-10 20:23:40,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:40,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162406536] [2020-02-10 20:23:40,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:40,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:40,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130250461] [2020-02-10 20:23:40,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:40,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:40,696 INFO L87 Difference]: Start difference. First operand 369 states and 1256 transitions. Second operand 9 states. [2020-02-10 20:23:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:40,810 INFO L93 Difference]: Finished difference Result 556 states and 1638 transitions. [2020-02-10 20:23:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:40,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:40,812 INFO L225 Difference]: With dead ends: 556 [2020-02-10 20:23:40,812 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:23:40,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:23:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 20:23:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 20:23:40,821 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 20:23:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:40,821 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 20:23:40,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 20:23:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:40,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:40,822 INFO L415 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] [2020-02-10 20:23:40,822 INFO L427 AbstractCegarLoop]: === Iteration 1784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:40,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1197726662, now seen corresponding path program 1778 times [2020-02-10 20:23:40,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:40,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648243686] [2020-02-10 20:23:40,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:41,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648243686] [2020-02-10 20:23:41,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:41,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671380032] [2020-02-10 20:23:41,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:41,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:41,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:41,113 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:23:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:41,217 INFO L93 Difference]: Finished difference Result 554 states and 1633 transitions. [2020-02-10 20:23:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:41,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:41,219 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:23:41,219 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:23:41,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:23:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 371. [2020-02-10 20:23:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 20:23:41,228 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 20:23:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:41,228 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 20:23:41,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 20:23:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:41,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:41,229 INFO L415 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] [2020-02-10 20:23:41,229 INFO L427 AbstractCegarLoop]: === Iteration 1785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2055498350, now seen corresponding path program 1779 times [2020-02-10 20:23:41,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:41,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347512077] [2020-02-10 20:23:41,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:41,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347512077] [2020-02-10 20:23:41,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:41,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3293382] [2020-02-10 20:23:41,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:41,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:41,502 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:23:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:41,603 INFO L93 Difference]: Finished difference Result 561 states and 1649 transitions. [2020-02-10 20:23:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:41,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:41,605 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:23:41,605 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 20:23:41,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 20:23:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-02-10 20:23:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-02-10 20:23:41,614 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-02-10 20:23:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:41,614 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-02-10 20:23:41,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-02-10 20:23:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:41,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:41,615 INFO L415 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] [2020-02-10 20:23:41,615 INFO L427 AbstractCegarLoop]: === Iteration 1786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1937451002, now seen corresponding path program 1780 times [2020-02-10 20:23:41,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:41,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809222618] [2020-02-10 20:23:41,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:41,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809222618] [2020-02-10 20:23:41,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:41,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811510944] [2020-02-10 20:23:41,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:41,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:41,888 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-02-10 20:23:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:42,009 INFO L93 Difference]: Finished difference Result 562 states and 1648 transitions. [2020-02-10 20:23:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:42,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:42,010 INFO L225 Difference]: With dead ends: 562 [2020-02-10 20:23:42,010 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:23:42,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:23:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-02-10 20:23:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-02-10 20:23:42,019 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-02-10 20:23:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,019 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-02-10 20:23:42,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-02-10 20:23:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:42,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,020 INFO L415 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] [2020-02-10 20:23:42,020 INFO L427 AbstractCegarLoop]: === Iteration 1787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,020 INFO L82 PathProgramCache]: Analyzing trace with hash -990456514, now seen corresponding path program 1781 times [2020-02-10 20:23:42,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870988364] [2020-02-10 20:23:42,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:42,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870988364] [2020-02-10 20:23:42,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:42,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:42,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432580244] [2020-02-10 20:23:42,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:42,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:42,299 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:23:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:42,384 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 20:23:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:42,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:42,386 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:23:42,386 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:23:42,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:23:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2020-02-10 20:23:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-02-10 20:23:42,395 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-02-10 20:23:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,396 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-02-10 20:23:42,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-02-10 20:23:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:42,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,396 INFO L415 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] [2020-02-10 20:23:42,396 INFO L427 AbstractCegarLoop]: === Iteration 1788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -455226712, now seen corresponding path program 1782 times [2020-02-10 20:23:42,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918290490] [2020-02-10 20:23:42,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:42,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918290490] [2020-02-10 20:23:42,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:42,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:42,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630370730] [2020-02-10 20:23:42,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:42,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:42,668 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:23:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:42,795 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-02-10 20:23:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:42,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:42,797 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:23:42,797 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:23:42,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:23:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370. [2020-02-10 20:23:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:23:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-02-10 20:23:42,805 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-02-10 20:23:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,805 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-02-10 20:23:42,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-02-10 20:23:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:42,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,806 INFO L415 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] [2020-02-10 20:23:42,806 INFO L427 AbstractCegarLoop]: === Iteration 1789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 274310454, now seen corresponding path program 1783 times [2020-02-10 20:23:42,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864435212] [2020-02-10 20:23:42,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:43,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864435212] [2020-02-10 20:23:43,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:43,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:43,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210147431] [2020-02-10 20:23:43,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:43,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:43,074 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-02-10 20:23:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:43,200 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 20:23:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:43,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:43,202 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:23:43,203 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:23:43,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:23:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 372. [2020-02-10 20:23:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:23:43,212 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:23:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:43,212 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:23:43,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:23:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:43,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:43,213 INFO L415 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] [2020-02-10 20:23:43,213 INFO L427 AbstractCegarLoop]: === Iteration 1790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1171206556, now seen corresponding path program 1784 times [2020-02-10 20:23:43,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:43,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812177446] [2020-02-10 20:23:43,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:43,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812177446] [2020-02-10 20:23:43,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:43,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:43,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697837046] [2020-02-10 20:23:43,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:43,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:43,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:43,484 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:23:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:43,570 INFO L93 Difference]: Finished difference Result 553 states and 1629 transitions. [2020-02-10 20:23:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:43,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:43,572 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:23:43,572 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:23:43,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:23:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-02-10 20:23:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-02-10 20:23:43,582 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-02-10 20:23:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:43,582 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-02-10 20:23:43,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-02-10 20:23:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:43,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:43,582 INFO L415 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] [2020-02-10 20:23:43,582 INFO L427 AbstractCegarLoop]: === Iteration 1791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1913872722, now seen corresponding path program 1785 times [2020-02-10 20:23:43,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:43,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570312795] [2020-02-10 20:23:43,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:43,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570312795] [2020-02-10 20:23:43,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:43,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:43,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985367574] [2020-02-10 20:23:43,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:43,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:43,846 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:23:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:43,960 INFO L93 Difference]: Finished difference Result 558 states and 1642 transitions. [2020-02-10 20:23:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:43,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:43,962 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:23:43,962 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 20:23:43,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 20:23:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2020-02-10 20:23:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:23:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 20:23:43,971 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:43,971 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 20:23:43,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 20:23:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:43,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:43,972 INFO L415 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] [2020-02-10 20:23:43,972 INFO L427 AbstractCegarLoop]: === Iteration 1792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1599095332, now seen corresponding path program 1786 times [2020-02-10 20:23:43,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:43,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377270562] [2020-02-10 20:23:43,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:44,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377270562] [2020-02-10 20:23:44,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:44,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:44,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307886395] [2020-02-10 20:23:44,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:44,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:44,237 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:44,343 INFO L93 Difference]: Finished difference Result 551 states and 1635 transitions. [2020-02-10 20:23:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:44,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:44,344 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:23:44,344 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:23:44,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:23:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2020-02-10 20:23:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-02-10 20:23:44,353 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-02-10 20:23:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:44,354 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-02-10 20:23:44,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-02-10 20:23:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:44,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:44,355 INFO L415 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] [2020-02-10 20:23:44,355 INFO L427 AbstractCegarLoop]: === Iteration 1793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:44,355 INFO L82 PathProgramCache]: Analyzing trace with hash -664860290, now seen corresponding path program 1787 times [2020-02-10 20:23:44,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:44,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367830392] [2020-02-10 20:23:44,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:44,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367830392] [2020-02-10 20:23:44,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:44,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:44,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066441232] [2020-02-10 20:23:44,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:44,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:44,637 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:23:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:44,726 INFO L93 Difference]: Finished difference Result 554 states and 1631 transitions. [2020-02-10 20:23:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:44,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:44,727 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:23:44,727 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:23:44,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:23:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 20:23:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 20:23:44,736 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 20:23:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:44,737 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 20:23:44,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 20:23:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:44,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:44,737 INFO L415 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] [2020-02-10 20:23:44,737 INFO L427 AbstractCegarLoop]: === Iteration 1794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1481310470, now seen corresponding path program 1788 times [2020-02-10 20:23:44,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:44,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056988256] [2020-02-10 20:23:44,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:44,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056988256] [2020-02-10 20:23:44,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:44,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:44,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763720385] [2020-02-10 20:23:44,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:44,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:44,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:44,992 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:23:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,110 INFO L93 Difference]: Finished difference Result 549 states and 1630 transitions. [2020-02-10 20:23:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:45,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,111 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:23:45,111 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 20:23:45,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 20:23:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 370. [2020-02-10 20:23:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:23:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1258 transitions. [2020-02-10 20:23:45,120 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1258 transitions. Word has length 22 [2020-02-10 20:23:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,120 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1258 transitions. [2020-02-10 20:23:45,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1258 transitions. [2020-02-10 20:23:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:45,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,121 INFO L415 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] [2020-02-10 20:23:45,121 INFO L427 AbstractCegarLoop]: === Iteration 1795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1353670666, now seen corresponding path program 1789 times [2020-02-10 20:23:45,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199197263] [2020-02-10 20:23:45,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:45,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199197263] [2020-02-10 20:23:45,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:45,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:45,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966512756] [2020-02-10 20:23:45,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:45,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:45,391 INFO L87 Difference]: Start difference. First operand 370 states and 1258 transitions. Second operand 9 states. [2020-02-10 20:23:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,506 INFO L93 Difference]: Finished difference Result 565 states and 1663 transitions. [2020-02-10 20:23:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:45,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,508 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:23:45,508 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:23:45,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:23:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 376. [2020-02-10 20:23:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-02-10 20:23:45,517 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-02-10 20:23:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,517 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-02-10 20:23:45,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-02-10 20:23:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:45,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,518 INFO L415 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] [2020-02-10 20:23:45,518 INFO L427 AbstractCegarLoop]: === Iteration 1796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1051652722, now seen corresponding path program 1790 times [2020-02-10 20:23:45,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268834845] [2020-02-10 20:23:45,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:45,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268834845] [2020-02-10 20:23:45,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:45,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:45,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357131814] [2020-02-10 20:23:45,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:45,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:45,790 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:23:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,906 INFO L93 Difference]: Finished difference Result 566 states and 1662 transitions. [2020-02-10 20:23:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:45,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,908 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:23:45,908 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:23:45,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:23:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 373. [2020-02-10 20:23:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:23:45,917 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:23:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,917 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:23:45,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:23:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:45,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,918 INFO L415 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] [2020-02-10 20:23:45,918 INFO L427 AbstractCegarLoop]: === Iteration 1797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1340858776, now seen corresponding path program 1791 times [2020-02-10 20:23:45,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684792605] [2020-02-10 20:23:45,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:46,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684792605] [2020-02-10 20:23:46,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:46,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:46,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413724772] [2020-02-10 20:23:46,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:46,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:46,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:46,185 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:23:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:46,294 INFO L93 Difference]: Finished difference Result 560 states and 1649 transitions. [2020-02-10 20:23:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:46,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:46,295 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:23:46,296 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:23:46,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:23:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 376. [2020-02-10 20:23:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 20:23:46,304 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 20:23:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:46,305 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 20:23:46,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 20:23:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:46,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:46,305 INFO L415 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] [2020-02-10 20:23:46,305 INFO L427 AbstractCegarLoop]: === Iteration 1798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 558859534, now seen corresponding path program 1792 times [2020-02-10 20:23:46,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:46,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391113650] [2020-02-10 20:23:46,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:46,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391113650] [2020-02-10 20:23:46,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:46,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:46,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793349691] [2020-02-10 20:23:46,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:46,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:46,574 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:23:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:46,675 INFO L93 Difference]: Finished difference Result 553 states and 1642 transitions. [2020-02-10 20:23:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:46,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:46,676 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:23:46,677 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 20:23:46,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 20:23:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 373. [2020-02-10 20:23:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 20:23:46,685 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 20:23:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:46,685 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 20:23:46,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 20:23:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:46,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:46,686 INFO L415 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] [2020-02-10 20:23:46,686 INFO L427 AbstractCegarLoop]: === Iteration 1799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 476174552, now seen corresponding path program 1793 times [2020-02-10 20:23:46,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:46,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847182972] [2020-02-10 20:23:46,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:46,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847182972] [2020-02-10 20:23:46,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:46,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:46,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53987929] [2020-02-10 20:23:46,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:46,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:46,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:46,958 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:23:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:47,062 INFO L93 Difference]: Finished difference Result 553 states and 1643 transitions. [2020-02-10 20:23:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:47,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:47,064 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:23:47,064 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 20:23:47,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 20:23:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 377. [2020-02-10 20:23:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1270 transitions. [2020-02-10 20:23:47,073 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1270 transitions. Word has length 22 [2020-02-10 20:23:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:47,073 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1270 transitions. [2020-02-10 20:23:47,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1270 transitions. [2020-02-10 20:23:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:47,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:47,073 INFO L415 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] [2020-02-10 20:23:47,074 INFO L427 AbstractCegarLoop]: === Iteration 1800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1331481206, now seen corresponding path program 1794 times [2020-02-10 20:23:47,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:47,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726621902] [2020-02-10 20:23:47,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:47,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726621902] [2020-02-10 20:23:47,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:47,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:47,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139306691] [2020-02-10 20:23:47,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:47,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:47,347 INFO L87 Difference]: Start difference. First operand 377 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:23:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:47,464 INFO L93 Difference]: Finished difference Result 540 states and 1624 transitions. [2020-02-10 20:23:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:47,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:47,466 INFO L225 Difference]: With dead ends: 540 [2020-02-10 20:23:47,466 INFO L226 Difference]: Without dead ends: 520 [2020-02-10 20:23:47,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-02-10 20:23:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 370. [2020-02-10 20:23:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:23:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1257 transitions. [2020-02-10 20:23:47,475 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1257 transitions. Word has length 22 [2020-02-10 20:23:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:47,475 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1257 transitions. [2020-02-10 20:23:47,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1257 transitions. [2020-02-10 20:23:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:47,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:47,475 INFO L415 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] [2020-02-10 20:23:47,476 INFO L427 AbstractCegarLoop]: === Iteration 1801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1821375844, now seen corresponding path program 1795 times [2020-02-10 20:23:47,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:47,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690200145] [2020-02-10 20:23:47,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:47,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690200145] [2020-02-10 20:23:47,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:47,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261350082] [2020-02-10 20:23:47,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:47,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:47,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:47,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:47,745 INFO L87 Difference]: Start difference. First operand 370 states and 1257 transitions. Second operand 9 states. [2020-02-10 20:23:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:47,823 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 20:23:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:47,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:47,825 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:23:47,825 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:23:47,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:23:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2020-02-10 20:23:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 20:23:47,834 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 20:23:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:47,834 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 20:23:47,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 20:23:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:47,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:47,835 INFO L415 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] [2020-02-10 20:23:47,835 INFO L427 AbstractCegarLoop]: === Iteration 1802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1938361650, now seen corresponding path program 1796 times [2020-02-10 20:23:47,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:47,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105489901] [2020-02-10 20:23:47,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:48,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105489901] [2020-02-10 20:23:48,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:48,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771475960] [2020-02-10 20:23:48,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:48,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:48,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:48,104 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:23:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:48,214 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-02-10 20:23:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:48,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:48,216 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:23:48,216 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:23:48,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:23:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 371. [2020-02-10 20:23:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1259 transitions. [2020-02-10 20:23:48,224 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1259 transitions. Word has length 22 [2020-02-10 20:23:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:48,224 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1259 transitions. [2020-02-10 20:23:48,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1259 transitions. [2020-02-10 20:23:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:48,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:48,225 INFO L415 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] [2020-02-10 20:23:48,225 INFO L427 AbstractCegarLoop]: === Iteration 1803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 220937990, now seen corresponding path program 1797 times [2020-02-10 20:23:48,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:48,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785530221] [2020-02-10 20:23:48,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:48,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785530221] [2020-02-10 20:23:48,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:48,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92967942] [2020-02-10 20:23:48,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:48,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:48,502 INFO L87 Difference]: Start difference. First operand 371 states and 1259 transitions. Second operand 9 states. [2020-02-10 20:23:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:48,597 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-02-10 20:23:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:48,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:48,599 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:23:48,599 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:23:48,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:23:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 20:23:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:23:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1260 transitions. [2020-02-10 20:23:48,608 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1260 transitions. Word has length 22 [2020-02-10 20:23:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:48,608 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1260 transitions. [2020-02-10 20:23:48,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1260 transitions. [2020-02-10 20:23:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:48,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:48,608 INFO L415 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] [2020-02-10 20:23:48,608 INFO L427 AbstractCegarLoop]: === Iteration 1804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1927858546, now seen corresponding path program 1798 times [2020-02-10 20:23:48,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:48,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307135740] [2020-02-10 20:23:48,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:48,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307135740] [2020-02-10 20:23:48,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:48,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353528735] [2020-02-10 20:23:48,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:48,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:48,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:48,867 INFO L87 Difference]: Start difference. First operand 372 states and 1260 transitions. Second operand 9 states. [2020-02-10 20:23:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:48,975 INFO L93 Difference]: Finished difference Result 549 states and 1631 transitions. [2020-02-10 20:23:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:48,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:48,977 INFO L225 Difference]: With dead ends: 549 [2020-02-10 20:23:48,977 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 20:23:48,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 20:23:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2020-02-10 20:23:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:23:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1258 transitions. [2020-02-10 20:23:48,986 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1258 transitions. Word has length 22 [2020-02-10 20:23:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:48,986 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1258 transitions. [2020-02-10 20:23:48,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1258 transitions. [2020-02-10 20:23:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:48,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:48,987 INFO L415 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] [2020-02-10 20:23:48,987 INFO L427 AbstractCegarLoop]: === Iteration 1805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:48,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash 168422470, now seen corresponding path program 1799 times [2020-02-10 20:23:48,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:48,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66018179] [2020-02-10 20:23:48,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:49,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66018179] [2020-02-10 20:23:49,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:49,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:49,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458119282] [2020-02-10 20:23:49,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:49,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:49,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:49,259 INFO L87 Difference]: Start difference. First operand 371 states and 1258 transitions. Second operand 9 states. [2020-02-10 20:23:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:49,354 INFO L93 Difference]: Finished difference Result 551 states and 1638 transitions. [2020-02-10 20:23:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:49,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:49,356 INFO L225 Difference]: With dead ends: 551 [2020-02-10 20:23:49,356 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 20:23:49,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 20:23:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 375. [2020-02-10 20:23:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1265 transitions. [2020-02-10 20:23:49,364 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1265 transitions. Word has length 22 [2020-02-10 20:23:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:49,364 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1265 transitions. [2020-02-10 20:23:49,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1265 transitions. [2020-02-10 20:23:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:49,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:49,365 INFO L415 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] [2020-02-10 20:23:49,365 INFO L427 AbstractCegarLoop]: === Iteration 1806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:49,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1779363428, now seen corresponding path program 1800 times [2020-02-10 20:23:49,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:49,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138702578] [2020-02-10 20:23:49,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:49,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138702578] [2020-02-10 20:23:49,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:49,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:49,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540778474] [2020-02-10 20:23:49,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:49,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:49,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:49,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:49,639 INFO L87 Difference]: Start difference. First operand 375 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:23:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:49,734 INFO L93 Difference]: Finished difference Result 538 states and 1619 transitions. [2020-02-10 20:23:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:49,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:49,735 INFO L225 Difference]: With dead ends: 538 [2020-02-10 20:23:49,735 INFO L226 Difference]: Without dead ends: 517 [2020-02-10 20:23:49,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-02-10 20:23:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 367. [2020-02-10 20:23:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-02-10 20:23:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1252 transitions. [2020-02-10 20:23:49,744 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1252 transitions. Word has length 22 [2020-02-10 20:23:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:49,744 INFO L479 AbstractCegarLoop]: Abstraction has 367 states and 1252 transitions. [2020-02-10 20:23:49,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1252 transitions. [2020-02-10 20:23:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:49,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:49,744 INFO L415 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] [2020-02-10 20:23:49,745 INFO L427 AbstractCegarLoop]: === Iteration 1807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:49,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:49,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1290682328, now seen corresponding path program 1801 times [2020-02-10 20:23:49,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:49,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991400440] [2020-02-10 20:23:49,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:50,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991400440] [2020-02-10 20:23:50,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:50,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:50,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916280198] [2020-02-10 20:23:50,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:50,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:50,018 INFO L87 Difference]: Start difference. First operand 367 states and 1252 transitions. Second operand 9 states. [2020-02-10 20:23:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:50,102 INFO L93 Difference]: Finished difference Result 618 states and 1820 transitions. [2020-02-10 20:23:50,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:50,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:50,104 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:23:50,104 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:23:50,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:23:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 380. [2020-02-10 20:23:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1297 transitions. [2020-02-10 20:23:50,114 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1297 transitions. Word has length 22 [2020-02-10 20:23:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:50,114 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1297 transitions. [2020-02-10 20:23:50,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1297 transitions. [2020-02-10 20:23:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:50,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:50,115 INFO L415 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] [2020-02-10 20:23:50,115 INFO L427 AbstractCegarLoop]: === Iteration 1808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 299583558, now seen corresponding path program 1802 times [2020-02-10 20:23:50,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:50,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704013437] [2020-02-10 20:23:50,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:50,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704013437] [2020-02-10 20:23:50,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:50,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:50,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924701611] [2020-02-10 20:23:50,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:50,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:50,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:50,385 INFO L87 Difference]: Start difference. First operand 380 states and 1297 transitions. Second operand 9 states. [2020-02-10 20:23:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:50,486 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-02-10 20:23:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:50,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:50,487 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:23:50,488 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:23:50,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:23:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 376. [2020-02-10 20:23:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1288 transitions. [2020-02-10 20:23:50,497 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:50,497 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1288 transitions. [2020-02-10 20:23:50,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1288 transitions. [2020-02-10 20:23:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:50,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:50,498 INFO L415 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] [2020-02-10 20:23:50,498 INFO L427 AbstractCegarLoop]: === Iteration 1809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1189770156, now seen corresponding path program 1803 times [2020-02-10 20:23:50,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:50,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041618853] [2020-02-10 20:23:50,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041618853] [2020-02-10 20:23:50,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:50,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:50,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215443014] [2020-02-10 20:23:50,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:50,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:50,772 INFO L87 Difference]: Start difference. First operand 376 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:50,848 INFO L93 Difference]: Finished difference Result 616 states and 1812 transitions. [2020-02-10 20:23:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:50,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:50,850 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:23:50,850 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 20:23:50,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 20:23:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 379. [2020-02-10 20:23:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1292 transitions. [2020-02-10 20:23:50,859 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1292 transitions. Word has length 22 [2020-02-10 20:23:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:50,860 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1292 transitions. [2020-02-10 20:23:50,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1292 transitions. [2020-02-10 20:23:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:50,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:50,860 INFO L415 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] [2020-02-10 20:23:50,860 INFO L427 AbstractCegarLoop]: === Iteration 1810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1063133782, now seen corresponding path program 1804 times [2020-02-10 20:23:50,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:50,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232787160] [2020-02-10 20:23:50,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:51,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232787160] [2020-02-10 20:23:51,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:51,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:51,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237197261] [2020-02-10 20:23:51,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:51,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:51,126 INFO L87 Difference]: Start difference. First operand 379 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:23:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:51,243 INFO L93 Difference]: Finished difference Result 610 states and 1798 transitions. [2020-02-10 20:23:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:51,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:51,245 INFO L225 Difference]: With dead ends: 610 [2020-02-10 20:23:51,245 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:23:51,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:23:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 376. [2020-02-10 20:23:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 20:23:51,254 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 20:23:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:51,254 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 20:23:51,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 20:23:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:51,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:51,255 INFO L415 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] [2020-02-10 20:23:51,255 INFO L427 AbstractCegarLoop]: === Iteration 1811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:51,255 INFO L82 PathProgramCache]: Analyzing trace with hash 816815346, now seen corresponding path program 1805 times [2020-02-10 20:23:51,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:51,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410127561] [2020-02-10 20:23:51,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:51,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410127561] [2020-02-10 20:23:51,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:51,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:51,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679233889] [2020-02-10 20:23:51,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:51,527 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:23:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:51,635 INFO L93 Difference]: Finished difference Result 605 states and 1789 transitions. [2020-02-10 20:23:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:51,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:51,637 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:23:51,637 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:23:51,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:23:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 378. [2020-02-10 20:23:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 20:23:51,647 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:51,647 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 20:23:51,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 20:23:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:51,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:51,647 INFO L415 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] [2020-02-10 20:23:51,648 INFO L427 AbstractCegarLoop]: === Iteration 1812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2136219162, now seen corresponding path program 1806 times [2020-02-10 20:23:51,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:51,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982354683] [2020-02-10 20:23:51,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:51,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982354683] [2020-02-10 20:23:51,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:51,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:51,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231177529] [2020-02-10 20:23:51,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:51,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:51,917 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:52,026 INFO L93 Difference]: Finished difference Result 604 states and 1785 transitions. [2020-02-10 20:23:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:52,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:52,028 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:23:52,028 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:23:52,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:23:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 373. [2020-02-10 20:23:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-02-10 20:23:52,038 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:52,038 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-02-10 20:23:52,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-02-10 20:23:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:52,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:52,039 INFO L415 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] [2020-02-10 20:23:52,039 INFO L427 AbstractCegarLoop]: === Iteration 1813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1244232028, now seen corresponding path program 1807 times [2020-02-10 20:23:52,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:52,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286343869] [2020-02-10 20:23:52,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:52,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286343869] [2020-02-10 20:23:52,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:52,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:52,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734095377] [2020-02-10 20:23:52,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:52,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:52,315 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:52,399 INFO L93 Difference]: Finished difference Result 624 states and 1834 transitions. [2020-02-10 20:23:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:52,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:52,401 INFO L225 Difference]: With dead ends: 624 [2020-02-10 20:23:52,401 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:23:52,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:23:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 381. [2020-02-10 20:23:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:23:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-02-10 20:23:52,409 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-02-10 20:23:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:52,410 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-02-10 20:23:52,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-02-10 20:23:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:52,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:52,410 INFO L415 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] [2020-02-10 20:23:52,410 INFO L427 AbstractCegarLoop]: === Iteration 1814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1460469382, now seen corresponding path program 1808 times [2020-02-10 20:23:52,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:52,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510790728] [2020-02-10 20:23:52,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:52,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510790728] [2020-02-10 20:23:52,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:52,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:52,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401441286] [2020-02-10 20:23:52,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:52,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:52,681 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:23:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:52,787 INFO L93 Difference]: Finished difference Result 619 states and 1821 transitions. [2020-02-10 20:23:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:52,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:52,789 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:23:52,789 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:23:52,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:23:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 377. [2020-02-10 20:23:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 20:23:52,798 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 20:23:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:52,798 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 20:23:52,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 20:23:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:52,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:52,799 INFO L415 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] [2020-02-10 20:23:52,799 INFO L427 AbstractCegarLoop]: === Iteration 1815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash -104444724, now seen corresponding path program 1809 times [2020-02-10 20:23:52,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:52,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005639103] [2020-02-10 20:23:52,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:53,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005639103] [2020-02-10 20:23:53,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:53,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:53,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177057412] [2020-02-10 20:23:53,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:53,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:53,075 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 20:23:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,151 INFO L93 Difference]: Finished difference Result 626 states and 1835 transitions. [2020-02-10 20:23:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:53,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,153 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:23:53,153 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 20:23:53,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 20:23:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 382. [2020-02-10 20:23:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:23:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-02-10 20:23:53,162 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-02-10 20:23:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,162 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-02-10 20:23:53,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-02-10 20:23:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:53,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,163 INFO L415 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] [2020-02-10 20:23:53,163 INFO L427 AbstractCegarLoop]: === Iteration 1816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1805772626, now seen corresponding path program 1810 times [2020-02-10 20:23:53,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541795777] [2020-02-10 20:23:53,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:53,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541795777] [2020-02-10 20:23:53,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:53,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:53,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28675079] [2020-02-10 20:23:53,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:53,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:53,435 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:23:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,552 INFO L93 Difference]: Finished difference Result 622 states and 1823 transitions. [2020-02-10 20:23:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:53,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,554 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:23:53,554 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:23:53,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:23:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 377. [2020-02-10 20:23:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 20:23:53,564 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 20:23:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,564 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 20:23:53,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 20:23:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:53,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,565 INFO L415 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] [2020-02-10 20:23:53,565 INFO L427 AbstractCegarLoop]: === Iteration 1817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1319741138, now seen corresponding path program 1811 times [2020-02-10 20:23:53,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495387981] [2020-02-10 20:23:53,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:53,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495387981] [2020-02-10 20:23:53,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:53,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:53,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100854696] [2020-02-10 20:23:53,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:53,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:53,839 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:23:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,947 INFO L93 Difference]: Finished difference Result 614 states and 1808 transitions. [2020-02-10 20:23:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:53,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,949 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:23:53,949 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:23:53,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:23:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 380. [2020-02-10 20:23:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1289 transitions. [2020-02-10 20:23:53,958 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1289 transitions. Word has length 22 [2020-02-10 20:23:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,958 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1289 transitions. [2020-02-10 20:23:53,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1289 transitions. [2020-02-10 20:23:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:53,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,959 INFO L415 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] [2020-02-10 20:23:53,959 INFO L427 AbstractCegarLoop]: === Iteration 1818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,959 INFO L82 PathProgramCache]: Analyzing trace with hash -446000458, now seen corresponding path program 1812 times [2020-02-10 20:23:53,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367077087] [2020-02-10 20:23:53,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:54,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367077087] [2020-02-10 20:23:54,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:54,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:54,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99531872] [2020-02-10 20:23:54,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:54,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:54,235 INFO L87 Difference]: Start difference. First operand 380 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:23:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:54,350 INFO L93 Difference]: Finished difference Result 615 states and 1807 transitions. [2020-02-10 20:23:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:54,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:54,351 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:23:54,351 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:23:54,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:23:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 373. [2020-02-10 20:23:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1275 transitions. [2020-02-10 20:23:54,359 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1275 transitions. Word has length 22 [2020-02-10 20:23:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:54,360 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1275 transitions. [2020-02-10 20:23:54,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1275 transitions. [2020-02-10 20:23:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:54,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:54,360 INFO L415 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] [2020-02-10 20:23:54,360 INFO L427 AbstractCegarLoop]: === Iteration 1819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1788251988, now seen corresponding path program 1813 times [2020-02-10 20:23:54,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:54,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794668244] [2020-02-10 20:23:54,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:54,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794668244] [2020-02-10 20:23:54,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:54,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:54,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928940659] [2020-02-10 20:23:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:54,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:54,627 INFO L87 Difference]: Start difference. First operand 373 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:23:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:54,713 INFO L93 Difference]: Finished difference Result 618 states and 1814 transitions. [2020-02-10 20:23:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:54,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:54,715 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:23:54,715 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:23:54,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:23:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 379. [2020-02-10 20:23:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:23:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1289 transitions. [2020-02-10 20:23:54,724 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1289 transitions. Word has length 22 [2020-02-10 20:23:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:54,724 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1289 transitions. [2020-02-10 20:23:54,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1289 transitions. [2020-02-10 20:23:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:54,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:54,725 INFO L415 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] [2020-02-10 20:23:54,725 INFO L427 AbstractCegarLoop]: === Iteration 1820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1661615614, now seen corresponding path program 1814 times [2020-02-10 20:23:54,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:54,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896073020] [2020-02-10 20:23:54,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:54,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896073020] [2020-02-10 20:23:54,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:54,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:54,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934105235] [2020-02-10 20:23:54,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:54,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:54,983 INFO L87 Difference]: Start difference. First operand 379 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:23:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:55,090 INFO L93 Difference]: Finished difference Result 612 states and 1800 transitions. [2020-02-10 20:23:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:55,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:55,092 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:23:55,092 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:23:55,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:23:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 376. [2020-02-10 20:23:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 20:23:55,102 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 20:23:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:55,102 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 20:23:55,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 20:23:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:55,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:55,103 INFO L415 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] [2020-02-10 20:23:55,103 INFO L427 AbstractCegarLoop]: === Iteration 1821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1431004152, now seen corresponding path program 1815 times [2020-02-10 20:23:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:55,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229836477] [2020-02-10 20:23:55,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:55,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229836477] [2020-02-10 20:23:55,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:55,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:55,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975883269] [2020-02-10 20:23:55,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:55,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:55,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:55,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:55,373 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:23:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:55,455 INFO L93 Difference]: Finished difference Result 622 states and 1821 transitions. [2020-02-10 20:23:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:55,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:55,457 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:23:55,457 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:23:55,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:23:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 381. [2020-02-10 20:23:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:23:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2020-02-10 20:23:55,465 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 22 [2020-02-10 20:23:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:55,466 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2020-02-10 20:23:55,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2020-02-10 20:23:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:55,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:55,466 INFO L415 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] [2020-02-10 20:23:55,466 INFO L427 AbstractCegarLoop]: === Iteration 1822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1322504706, now seen corresponding path program 1816 times [2020-02-10 20:23:55,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:55,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033341989] [2020-02-10 20:23:55,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:55,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033341989] [2020-02-10 20:23:55,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:55,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:55,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888120277] [2020-02-10 20:23:55,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:55,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:55,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:55,749 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:23:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:55,858 INFO L93 Difference]: Finished difference Result 618 states and 1809 transitions. [2020-02-10 20:23:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:55,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:55,860 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:23:55,860 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:23:55,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:23:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 376. [2020-02-10 20:23:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 20:23:55,869 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 20:23:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:55,869 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 20:23:55,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 20:23:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:55,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:55,870 INFO L415 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] [2020-02-10 20:23:55,870 INFO L427 AbstractCegarLoop]: === Iteration 1823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -588530234, now seen corresponding path program 1817 times [2020-02-10 20:23:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:55,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622314684] [2020-02-10 20:23:55,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:56,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622314684] [2020-02-10 20:23:56,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:56,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:56,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312033412] [2020-02-10 20:23:56,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:56,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:56,132 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:23:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:56,250 INFO L93 Difference]: Finished difference Result 607 states and 1788 transitions. [2020-02-10 20:23:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:56,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:56,252 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:23:56,252 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:23:56,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:23:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 378. [2020-02-10 20:23:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-02-10 20:23:56,262 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-02-10 20:23:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:56,262 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-02-10 20:23:56,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-02-10 20:23:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:56,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:56,263 INFO L415 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] [2020-02-10 20:23:56,263 INFO L427 AbstractCegarLoop]: === Iteration 1824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash -761777926, now seen corresponding path program 1818 times [2020-02-10 20:23:56,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:56,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440952157] [2020-02-10 20:23:56,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:56,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440952157] [2020-02-10 20:23:56,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:56,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:56,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129905406] [2020-02-10 20:23:56,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:56,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:56,524 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:23:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:56,645 INFO L93 Difference]: Finished difference Result 609 states and 1790 transitions. [2020-02-10 20:23:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:56,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:56,646 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:23:56,646 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:23:56,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:23:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 373. [2020-02-10 20:23:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:23:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:23:56,655 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:23:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:56,655 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:23:56,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:23:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:56,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:56,656 INFO L415 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] [2020-02-10 20:23:56,656 INFO L427 AbstractCegarLoop]: === Iteration 1825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1312425102, now seen corresponding path program 1819 times [2020-02-10 20:23:56,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:56,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225632776] [2020-02-10 20:23:56,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:56,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225632776] [2020-02-10 20:23:56,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:56,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:56,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821431701] [2020-02-10 20:23:56,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:56,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:56,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:56,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:56,927 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:23:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,029 INFO L93 Difference]: Finished difference Result 598 states and 1772 transitions. [2020-02-10 20:23:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:57,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,030 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:23:57,031 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:23:57,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:23:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2020-02-10 20:23:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-02-10 20:23:57,039 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-02-10 20:23:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,039 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-02-10 20:23:57,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-02-10 20:23:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:57,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,040 INFO L415 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] [2020-02-10 20:23:57,040 INFO L427 AbstractCegarLoop]: === Iteration 1826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1640609406, now seen corresponding path program 1820 times [2020-02-10 20:23:57,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550572667] [2020-02-10 20:23:57,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:57,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550572667] [2020-02-10 20:23:57,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:57,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:57,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876114061] [2020-02-10 20:23:57,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:57,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:57,314 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:23:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,415 INFO L93 Difference]: Finished difference Result 597 states and 1768 transitions. [2020-02-10 20:23:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:57,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,417 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:23:57,417 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:23:57,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:23:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 375. [2020-02-10 20:23:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1277 transitions. [2020-02-10 20:23:57,426 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1277 transitions. Word has length 22 [2020-02-10 20:23:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,426 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1277 transitions. [2020-02-10 20:23:57,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1277 transitions. [2020-02-10 20:23:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:57,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,427 INFO L415 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] [2020-02-10 20:23:57,427 INFO L427 AbstractCegarLoop]: === Iteration 1827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 236713946, now seen corresponding path program 1821 times [2020-02-10 20:23:57,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285524008] [2020-02-10 20:23:57,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:57,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285524008] [2020-02-10 20:23:57,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:57,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:57,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687799920] [2020-02-10 20:23:57,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:57,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:57,703 INFO L87 Difference]: Start difference. First operand 375 states and 1277 transitions. Second operand 9 states. [2020-02-10 20:23:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,799 INFO L93 Difference]: Finished difference Result 601 states and 1777 transitions. [2020-02-10 20:23:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:57,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,800 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:23:57,800 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:23:57,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:23:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 378. [2020-02-10 20:23:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:23:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-02-10 20:23:57,809 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-02-10 20:23:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,809 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-02-10 20:23:57,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-02-10 20:23:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:57,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,810 INFO L415 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] [2020-02-10 20:23:57,810 INFO L427 AbstractCegarLoop]: === Iteration 1828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1591684214, now seen corresponding path program 1822 times [2020-02-10 20:23:57,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839713760] [2020-02-10 20:23:57,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:58,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839713760] [2020-02-10 20:23:58,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:58,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:58,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211266441] [2020-02-10 20:23:58,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:58,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:58,083 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:23:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:58,193 INFO L93 Difference]: Finished difference Result 602 states and 1776 transitions. [2020-02-10 20:23:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:58,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:58,195 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:23:58,195 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:23:58,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:23:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 375. [2020-02-10 20:23:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:23:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1275 transitions. [2020-02-10 20:23:58,204 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1275 transitions. Word has length 22 [2020-02-10 20:23:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:58,205 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1275 transitions. [2020-02-10 20:23:58,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1275 transitions. [2020-02-10 20:23:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:58,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:58,205 INFO L415 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] [2020-02-10 20:23:58,205 INFO L427 AbstractCegarLoop]: === Iteration 1829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 505561354, now seen corresponding path program 1823 times [2020-02-10 20:23:58,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:58,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111562606] [2020-02-10 20:23:58,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:58,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111562606] [2020-02-10 20:23:58,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:58,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:58,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332516678] [2020-02-10 20:23:58,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:58,482 INFO L87 Difference]: Start difference. First operand 375 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:23:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:58,595 INFO L93 Difference]: Finished difference Result 598 states and 1768 transitions. [2020-02-10 20:23:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:58,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:58,597 INFO L225 Difference]: With dead ends: 598 [2020-02-10 20:23:58,597 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:23:58,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:23:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 377. [2020-02-10 20:23:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:23:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-02-10 20:23:58,606 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-02-10 20:23:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:58,606 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-02-10 20:23:58,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-02-10 20:23:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:58,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:58,606 INFO L415 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] [2020-02-10 20:23:58,606 INFO L427 AbstractCegarLoop]: === Iteration 1830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash 332313662, now seen corresponding path program 1824 times [2020-02-10 20:23:58,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:58,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360723284] [2020-02-10 20:23:58,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:58,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360723284] [2020-02-10 20:23:58,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:58,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:58,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580066794] [2020-02-10 20:23:58,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:58,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:58,881 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:23:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:58,991 INFO L93 Difference]: Finished difference Result 600 states and 1770 transitions. [2020-02-10 20:23:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:58,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:58,993 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:23:58,993 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:23:58,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:23:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 370. [2020-02-10 20:23:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:23:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1265 transitions. [2020-02-10 20:23:59,002 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1265 transitions. Word has length 22 [2020-02-10 20:23:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:59,003 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1265 transitions. [2020-02-10 20:23:59,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1265 transitions. [2020-02-10 20:23:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:59,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:59,003 INFO L415 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] [2020-02-10 20:23:59,003 INFO L427 AbstractCegarLoop]: === Iteration 1831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1502837946, now seen corresponding path program 1825 times [2020-02-10 20:23:59,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:59,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597947297] [2020-02-10 20:23:59,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:59,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597947297] [2020-02-10 20:23:59,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:59,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:59,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319987924] [2020-02-10 20:23:59,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:59,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:59,260 INFO L87 Difference]: Start difference. First operand 370 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:23:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:59,354 INFO L93 Difference]: Finished difference Result 614 states and 1799 transitions. [2020-02-10 20:23:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:59,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:59,356 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:23:59,356 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:23:59,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:23:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 380. [2020-02-10 20:23:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:23:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1294 transitions. [2020-02-10 20:23:59,365 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1294 transitions. Word has length 22 [2020-02-10 20:23:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:59,365 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1294 transitions. [2020-02-10 20:23:59,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1294 transitions. [2020-02-10 20:23:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:59,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:59,366 INFO L415 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] [2020-02-10 20:23:59,366 INFO L427 AbstractCegarLoop]: === Iteration 1832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 87427940, now seen corresponding path program 1826 times [2020-02-10 20:23:59,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:59,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003755692] [2020-02-10 20:23:59,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:59,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003755692] [2020-02-10 20:23:59,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:59,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:59,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771508180] [2020-02-10 20:23:59,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:59,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:59,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:59,617 INFO L87 Difference]: Start difference. First operand 380 states and 1294 transitions. Second operand 9 states. [2020-02-10 20:23:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:59,725 INFO L93 Difference]: Finished difference Result 609 states and 1786 transitions. [2020-02-10 20:23:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:23:59,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:23:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:59,727 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:23:59,727 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:23:59,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:23:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 376. [2020-02-10 20:23:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:23:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 20:23:59,736 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 20:23:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:59,736 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 20:23:59,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:23:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 20:23:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:23:59,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:59,737 INFO L415 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] [2020-02-10 20:23:59,737 INFO L427 AbstractCegarLoop]: === Iteration 1833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1401925774, now seen corresponding path program 1827 times [2020-02-10 20:23:59,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:59,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436356389] [2020-02-10 20:23:59,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:59,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436356389] [2020-02-10 20:23:59,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:59,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:23:59,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829874843] [2020-02-10 20:23:59,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:23:59,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:23:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:23:59,990 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:24:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:00,069 INFO L93 Difference]: Finished difference Result 612 states and 1791 transitions. [2020-02-10 20:24:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:00,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:00,070 INFO L225 Difference]: With dead ends: 612 [2020-02-10 20:24:00,071 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:24:00,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:24:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 379. [2020-02-10 20:24:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1289 transitions. [2020-02-10 20:24:00,080 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1289 transitions. Word has length 22 [2020-02-10 20:24:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:00,080 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1289 transitions. [2020-02-10 20:24:00,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1289 transitions. [2020-02-10 20:24:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:00,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:00,081 INFO L415 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] [2020-02-10 20:24:00,081 INFO L427 AbstractCegarLoop]: === Iteration 1834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1275289400, now seen corresponding path program 1828 times [2020-02-10 20:24:00,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:00,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273849971] [2020-02-10 20:24:00,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:00,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273849971] [2020-02-10 20:24:00,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:00,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:00,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593226077] [2020-02-10 20:24:00,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:00,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:00,327 INFO L87 Difference]: Start difference. First operand 379 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:24:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:00,430 INFO L93 Difference]: Finished difference Result 606 states and 1777 transitions. [2020-02-10 20:24:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:00,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:00,431 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:24:00,432 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:24:00,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:24:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 376. [2020-02-10 20:24:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 20:24:00,441 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 20:24:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:00,441 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 20:24:00,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 20:24:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:00,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:00,442 INFO L415 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] [2020-02-10 20:24:00,442 INFO L427 AbstractCegarLoop]: === Iteration 1835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:00,442 INFO L82 PathProgramCache]: Analyzing trace with hash 604659728, now seen corresponding path program 1829 times [2020-02-10 20:24:00,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:00,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803692546] [2020-02-10 20:24:00,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:00,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803692546] [2020-02-10 20:24:00,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:00,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:00,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399132790] [2020-02-10 20:24:00,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:00,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:00,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:00,697 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:24:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:00,803 INFO L93 Difference]: Finished difference Result 601 states and 1768 transitions. [2020-02-10 20:24:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:00,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:00,805 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:24:00,805 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:24:00,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:24:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 378. [2020-02-10 20:24:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1285 transitions. [2020-02-10 20:24:00,814 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1285 transitions. Word has length 22 [2020-02-10 20:24:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:00,814 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1285 transitions. [2020-02-10 20:24:00,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1285 transitions. [2020-02-10 20:24:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:00,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:00,815 INFO L415 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] [2020-02-10 20:24:00,815 INFO L427 AbstractCegarLoop]: === Iteration 1836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1946592516, now seen corresponding path program 1830 times [2020-02-10 20:24:00,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:00,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301694709] [2020-02-10 20:24:00,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:01,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301694709] [2020-02-10 20:24:01,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:01,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:01,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478448461] [2020-02-10 20:24:01,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:01,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:01,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:01,068 INFO L87 Difference]: Start difference. First operand 378 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:24:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,169 INFO L93 Difference]: Finished difference Result 600 states and 1764 transitions. [2020-02-10 20:24:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:01,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,171 INFO L225 Difference]: With dead ends: 600 [2020-02-10 20:24:01,171 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:24:01,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:24:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 373. [2020-02-10 20:24:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1275 transitions. [2020-02-10 20:24:01,180 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1275 transitions. Word has length 22 [2020-02-10 20:24:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,180 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1275 transitions. [2020-02-10 20:24:01,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1275 transitions. [2020-02-10 20:24:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:01,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,181 INFO L415 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] [2020-02-10 20:24:01,181 INFO L427 AbstractCegarLoop]: === Iteration 1837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash 609590684, now seen corresponding path program 1831 times [2020-02-10 20:24:01,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056079094] [2020-02-10 20:24:01,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:01,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056079094] [2020-02-10 20:24:01,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:01,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:01,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877470795] [2020-02-10 20:24:01,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:01,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:01,434 INFO L87 Difference]: Start difference. First operand 373 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:24:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,524 INFO L93 Difference]: Finished difference Result 618 states and 1808 transitions. [2020-02-10 20:24:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:01,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,526 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:24:01,526 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:24:01,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:24:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 381. [2020-02-10 20:24:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:24:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1295 transitions. [2020-02-10 20:24:01,535 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1295 transitions. Word has length 22 [2020-02-10 20:24:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,535 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1295 transitions. [2020-02-10 20:24:01,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1295 transitions. [2020-02-10 20:24:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:01,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,536 INFO L415 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] [2020-02-10 20:24:01,536 INFO L427 AbstractCegarLoop]: === Iteration 1838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2095110726, now seen corresponding path program 1832 times [2020-02-10 20:24:01,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150964865] [2020-02-10 20:24:01,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:01,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150964865] [2020-02-10 20:24:01,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:01,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:01,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183701599] [2020-02-10 20:24:01,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:01,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:01,809 INFO L87 Difference]: Start difference. First operand 381 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:24:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,931 INFO L93 Difference]: Finished difference Result 613 states and 1795 transitions. [2020-02-10 20:24:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:01,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,933 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:24:01,933 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:24:01,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:01,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:24:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 377. [2020-02-10 20:24:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1285 transitions. [2020-02-10 20:24:01,943 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1285 transitions. Word has length 22 [2020-02-10 20:24:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,943 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1285 transitions. [2020-02-10 20:24:01,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1285 transitions. [2020-02-10 20:24:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:01,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,944 INFO L415 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] [2020-02-10 20:24:01,944 INFO L427 AbstractCegarLoop]: === Iteration 1839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1942153612, now seen corresponding path program 1833 times [2020-02-10 20:24:01,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044584105] [2020-02-10 20:24:01,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:02,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044584105] [2020-02-10 20:24:02,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:02,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:02,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569315161] [2020-02-10 20:24:02,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:02,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:02,200 INFO L87 Difference]: Start difference. First operand 377 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:24:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:02,284 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-02-10 20:24:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:02,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:02,286 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:24:02,286 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:24:02,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:24:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 383. [2020-02-10 20:24:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:24:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1295 transitions. [2020-02-10 20:24:02,295 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1295 transitions. Word has length 22 [2020-02-10 20:24:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:02,295 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1295 transitions. [2020-02-10 20:24:02,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1295 transitions. [2020-02-10 20:24:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:02,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:02,295 INFO L415 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] [2020-02-10 20:24:02,295 INFO L427 AbstractCegarLoop]: === Iteration 1840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 351053584, now seen corresponding path program 1834 times [2020-02-10 20:24:02,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:02,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749565551] [2020-02-10 20:24:02,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:02,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749565551] [2020-02-10 20:24:02,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:02,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:02,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166249440] [2020-02-10 20:24:02,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:02,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:02,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:02,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:02,545 INFO L87 Difference]: Start difference. First operand 383 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:24:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:02,660 INFO L93 Difference]: Finished difference Result 602 states and 1781 transitions. [2020-02-10 20:24:02,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:02,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:02,661 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:24:02,661 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:24:02,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:24:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 377. [2020-02-10 20:24:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1281 transitions. [2020-02-10 20:24:02,670 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1281 transitions. Word has length 22 [2020-02-10 20:24:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:02,670 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1281 transitions. [2020-02-10 20:24:02,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1281 transitions. [2020-02-10 20:24:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:02,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:02,671 INFO L415 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] [2020-02-10 20:24:02,671 INFO L427 AbstractCegarLoop]: === Iteration 1841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash 726857198, now seen corresponding path program 1835 times [2020-02-10 20:24:02,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:02,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125911651] [2020-02-10 20:24:02,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:02,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125911651] [2020-02-10 20:24:02,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:02,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:02,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030668060] [2020-02-10 20:24:02,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:02,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:02,920 INFO L87 Difference]: Start difference. First operand 377 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:24:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:03,027 INFO L93 Difference]: Finished difference Result 606 states and 1779 transitions. [2020-02-10 20:24:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:03,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:03,029 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:24:03,029 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:24:03,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:24:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 380. [2020-02-10 20:24:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:24:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1286 transitions. [2020-02-10 20:24:03,038 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1286 transitions. Word has length 22 [2020-02-10 20:24:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:03,039 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1286 transitions. [2020-02-10 20:24:03,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1286 transitions. [2020-02-10 20:24:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:03,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:03,039 INFO L415 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] [2020-02-10 20:24:03,039 INFO L427 AbstractCegarLoop]: === Iteration 1842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:03,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1839062764, now seen corresponding path program 1836 times [2020-02-10 20:24:03,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:03,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995299636] [2020-02-10 20:24:03,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995299636] [2020-02-10 20:24:03,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:03,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52616853] [2020-02-10 20:24:03,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:03,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:03,298 INFO L87 Difference]: Start difference. First operand 380 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:24:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:03,408 INFO L93 Difference]: Finished difference Result 599 states and 1772 transitions. [2020-02-10 20:24:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:03,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:03,410 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:24:03,410 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:24:03,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:24:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 373. [2020-02-10 20:24:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:24:03,419 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:24:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:03,419 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:24:03,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:24:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:03,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:03,420 INFO L415 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] [2020-02-10 20:24:03,420 INFO L427 AbstractCegarLoop]: === Iteration 1843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2097297108, now seen corresponding path program 1837 times [2020-02-10 20:24:03,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:03,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502004080] [2020-02-10 20:24:03,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502004080] [2020-02-10 20:24:03,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:03,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796418745] [2020-02-10 20:24:03,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:03,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:03,668 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:24:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:03,742 INFO L93 Difference]: Finished difference Result 613 states and 1791 transitions. [2020-02-10 20:24:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:03,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:03,744 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:24:03,744 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:24:03,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:24:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 379. [2020-02-10 20:24:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1286 transitions. [2020-02-10 20:24:03,752 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1286 transitions. Word has length 22 [2020-02-10 20:24:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:03,752 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1286 transitions. [2020-02-10 20:24:03,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1286 transitions. [2020-02-10 20:24:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:03,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:03,753 INFO L415 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] [2020-02-10 20:24:03,753 INFO L427 AbstractCegarLoop]: === Iteration 1844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1970660734, now seen corresponding path program 1838 times [2020-02-10 20:24:03,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:03,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445738055] [2020-02-10 20:24:03,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445738055] [2020-02-10 20:24:03,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:03,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906997783] [2020-02-10 20:24:03,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:03,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:03,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:03,997 INFO L87 Difference]: Start difference. First operand 379 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:24:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:04,120 INFO L93 Difference]: Finished difference Result 607 states and 1777 transitions. [2020-02-10 20:24:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:04,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:04,121 INFO L225 Difference]: With dead ends: 607 [2020-02-10 20:24:04,122 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:24:04,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:24:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 376. [2020-02-10 20:24:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 20:24:04,130 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,130 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 20:24:04,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 20:24:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:04,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:04,131 INFO L415 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] [2020-02-10 20:24:04,131 INFO L427 AbstractCegarLoop]: === Iteration 1845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1562067306, now seen corresponding path program 1839 times [2020-02-10 20:24:04,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077185308] [2020-02-10 20:24:04,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:04,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077185308] [2020-02-10 20:24:04,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:04,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:04,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479356785] [2020-02-10 20:24:04,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:04,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:04,390 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:04,470 INFO L93 Difference]: Finished difference Result 611 states and 1789 transitions. [2020-02-10 20:24:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:04,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:04,472 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:24:04,472 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:24:04,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:24:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 382. [2020-02-10 20:24:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:24:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1289 transitions. [2020-02-10 20:24:04,482 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1289 transitions. Word has length 22 [2020-02-10 20:24:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,482 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1289 transitions. [2020-02-10 20:24:04,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1289 transitions. [2020-02-10 20:24:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:04,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:04,483 INFO L415 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] [2020-02-10 20:24:04,483 INFO L427 AbstractCegarLoop]: === Iteration 1846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash -815636380, now seen corresponding path program 1840 times [2020-02-10 20:24:04,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607091750] [2020-02-10 20:24:04,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:04,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607091750] [2020-02-10 20:24:04,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:04,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:04,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340898832] [2020-02-10 20:24:04,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:04,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:04,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:04,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:04,738 INFO L87 Difference]: Start difference. First operand 382 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:24:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:04,862 INFO L93 Difference]: Finished difference Result 599 states and 1770 transitions. [2020-02-10 20:24:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:04,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:04,863 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:24:04,863 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:24:04,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:24:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 376. [2020-02-10 20:24:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 20:24:04,872 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,872 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 20:24:04,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 20:24:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:04,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:04,873 INFO L415 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] [2020-02-10 20:24:04,873 INFO L427 AbstractCegarLoop]: === Iteration 1847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 713365604, now seen corresponding path program 1841 times [2020-02-10 20:24:04,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474714491] [2020-02-10 20:24:04,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:05,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474714491] [2020-02-10 20:24:05,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:05,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:05,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789524739] [2020-02-10 20:24:05,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:05,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:05,120 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:05,246 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-02-10 20:24:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:05,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:05,248 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:24:05,248 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:24:05,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:24:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 378. [2020-02-10 20:24:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 20:24:05,257 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:05,257 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 20:24:05,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 20:24:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:05,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:05,257 INFO L415 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] [2020-02-10 20:24:05,257 INFO L427 AbstractCegarLoop]: === Iteration 1848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1284820410, now seen corresponding path program 1842 times [2020-02-10 20:24:05,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:05,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21712726] [2020-02-10 20:24:05,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:05,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21712726] [2020-02-10 20:24:05,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:05,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:05,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511050305] [2020-02-10 20:24:05,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:05,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:05,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:05,511 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:05,640 INFO L93 Difference]: Finished difference Result 595 states and 1760 transitions. [2020-02-10 20:24:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:05,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:05,642 INFO L225 Difference]: With dead ends: 595 [2020-02-10 20:24:05,642 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:24:05,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:24:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 373. [2020-02-10 20:24:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1269 transitions. [2020-02-10 20:24:05,651 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:05,651 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1269 transitions. [2020-02-10 20:24:05,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1269 transitions. [2020-02-10 20:24:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:05,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:05,652 INFO L415 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] [2020-02-10 20:24:05,652 INFO L427 AbstractCegarLoop]: === Iteration 1849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1003379982, now seen corresponding path program 1843 times [2020-02-10 20:24:05,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:05,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711774762] [2020-02-10 20:24:05,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:05,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711774762] [2020-02-10 20:24:05,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:05,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:05,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355976387] [2020-02-10 20:24:05,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:05,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:05,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:05,912 INFO L87 Difference]: Start difference. First operand 373 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:06,041 INFO L93 Difference]: Finished difference Result 593 states and 1748 transitions. [2020-02-10 20:24:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:06,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:06,043 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:24:06,043 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:24:06,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:24:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 377. [2020-02-10 20:24:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1279 transitions. [2020-02-10 20:24:06,053 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:06,053 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1279 transitions. [2020-02-10 20:24:06,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1279 transitions. [2020-02-10 20:24:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:06,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:06,054 INFO L415 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] [2020-02-10 20:24:06,054 INFO L427 AbstractCegarLoop]: === Iteration 1850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:06,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1949654526, now seen corresponding path program 1844 times [2020-02-10 20:24:06,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:06,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717378014] [2020-02-10 20:24:06,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:06,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717378014] [2020-02-10 20:24:06,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:06,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:06,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864684787] [2020-02-10 20:24:06,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:06,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:06,311 INFO L87 Difference]: Start difference. First operand 377 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:06,441 INFO L93 Difference]: Finished difference Result 592 states and 1744 transitions. [2020-02-10 20:24:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:06,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:06,443 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:24:06,443 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:24:06,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:24:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 375. [2020-02-10 20:24:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:24:06,452 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:24:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:06,453 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:24:06,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:24:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:06,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:06,453 INFO L415 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] [2020-02-10 20:24:06,453 INFO L427 AbstractCegarLoop]: === Iteration 1851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1538609784, now seen corresponding path program 1845 times [2020-02-10 20:24:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:06,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130704591] [2020-02-10 20:24:06,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:06,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130704591] [2020-02-10 20:24:06,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:06,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:06,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086706772] [2020-02-10 20:24:06,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:06,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:06,704 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:24:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:06,831 INFO L93 Difference]: Finished difference Result 594 states and 1750 transitions. [2020-02-10 20:24:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:06,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:06,832 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:24:06,833 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:24:06,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:24:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 378. [2020-02-10 20:24:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 20:24:06,841 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:06,841 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 20:24:06,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 20:24:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:06,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:06,842 INFO L415 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] [2020-02-10 20:24:06,842 INFO L427 AbstractCegarLoop]: === Iteration 1852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1310220776, now seen corresponding path program 1846 times [2020-02-10 20:24:06,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:06,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596230685] [2020-02-10 20:24:06,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:07,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596230685] [2020-02-10 20:24:07,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:07,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62881130] [2020-02-10 20:24:07,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:07,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:07,103 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:07,227 INFO L93 Difference]: Finished difference Result 587 states and 1743 transitions. [2020-02-10 20:24:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:07,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:07,229 INFO L225 Difference]: With dead ends: 587 [2020-02-10 20:24:07,229 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:24:07,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:24:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 375. [2020-02-10 20:24:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-02-10 20:24:07,238 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-02-10 20:24:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:07,238 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-02-10 20:24:07,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-02-10 20:24:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:07,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:07,239 INFO L415 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] [2020-02-10 20:24:07,239 INFO L427 AbstractCegarLoop]: === Iteration 1853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1807457192, now seen corresponding path program 1847 times [2020-02-10 20:24:07,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:07,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434885721] [2020-02-10 20:24:07,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:07,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434885721] [2020-02-10 20:24:07,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:07,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749280151] [2020-02-10 20:24:07,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:07,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:07,485 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:24:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:07,610 INFO L93 Difference]: Finished difference Result 592 states and 1743 transitions. [2020-02-10 20:24:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:07,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:07,611 INFO L225 Difference]: With dead ends: 592 [2020-02-10 20:24:07,611 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:24:07,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:24:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 377. [2020-02-10 20:24:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1275 transitions. [2020-02-10 20:24:07,620 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1275 transitions. Word has length 22 [2020-02-10 20:24:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:07,620 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1275 transitions. [2020-02-10 20:24:07,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1275 transitions. [2020-02-10 20:24:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:07,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:07,621 INFO L415 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] [2020-02-10 20:24:07,621 INFO L427 AbstractCegarLoop]: === Iteration 1854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1916055298, now seen corresponding path program 1848 times [2020-02-10 20:24:07,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:07,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194663437] [2020-02-10 20:24:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:07,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194663437] [2020-02-10 20:24:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:07,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208906955] [2020-02-10 20:24:07,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:07,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:07,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:07,870 INFO L87 Difference]: Start difference. First operand 377 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:24:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,000 INFO L93 Difference]: Finished difference Result 586 states and 1739 transitions. [2020-02-10 20:24:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:08,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,002 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:24:08,002 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:24:08,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:24:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 370. [2020-02-10 20:24:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:24:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1262 transitions. [2020-02-10 20:24:08,009 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1262 transitions. Word has length 22 [2020-02-10 20:24:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,010 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1262 transitions. [2020-02-10 20:24:08,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1262 transitions. [2020-02-10 20:24:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:08,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,010 INFO L415 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] [2020-02-10 20:24:08,010 INFO L427 AbstractCegarLoop]: === Iteration 1855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1989957178, now seen corresponding path program 1849 times [2020-02-10 20:24:08,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541063657] [2020-02-10 20:24:08,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:08,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541063657] [2020-02-10 20:24:08,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:08,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:08,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789557732] [2020-02-10 20:24:08,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:08,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:08,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:08,287 INFO L87 Difference]: Start difference. First operand 370 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:24:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,377 INFO L93 Difference]: Finished difference Result 627 states and 1839 transitions. [2020-02-10 20:24:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:08,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,379 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:24:08,379 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:24:08,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:24:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 382. [2020-02-10 20:24:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:24:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1300 transitions. [2020-02-10 20:24:08,388 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1300 transitions. Word has length 22 [2020-02-10 20:24:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,388 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1300 transitions. [2020-02-10 20:24:08,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1300 transitions. [2020-02-10 20:24:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:08,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,389 INFO L415 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] [2020-02-10 20:24:08,389 INFO L427 AbstractCegarLoop]: === Iteration 1856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash -399691292, now seen corresponding path program 1850 times [2020-02-10 20:24:08,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223145795] [2020-02-10 20:24:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:08,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223145795] [2020-02-10 20:24:08,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:08,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:08,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51059266] [2020-02-10 20:24:08,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:08,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:08,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:08,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:08,664 INFO L87 Difference]: Start difference. First operand 382 states and 1300 transitions. Second operand 9 states. [2020-02-10 20:24:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,792 INFO L93 Difference]: Finished difference Result 622 states and 1826 transitions. [2020-02-10 20:24:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:08,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,794 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:24:08,794 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 20:24:08,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 20:24:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 378. [2020-02-10 20:24:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1290 transitions. [2020-02-10 20:24:08,803 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1290 transitions. Word has length 22 [2020-02-10 20:24:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,804 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1290 transitions. [2020-02-10 20:24:08,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1290 transitions. [2020-02-10 20:24:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:08,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,804 INFO L415 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] [2020-02-10 20:24:08,804 INFO L427 AbstractCegarLoop]: === Iteration 1857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 956333366, now seen corresponding path program 1851 times [2020-02-10 20:24:08,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445012637] [2020-02-10 20:24:08,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:09,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445012637] [2020-02-10 20:24:09,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:09,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:09,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276077478] [2020-02-10 20:24:09,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:09,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:09,083 INFO L87 Difference]: Start difference. First operand 378 states and 1290 transitions. Second operand 9 states. [2020-02-10 20:24:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:09,185 INFO L93 Difference]: Finished difference Result 629 states and 1840 transitions. [2020-02-10 20:24:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:09,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:09,187 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:24:09,187 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:24:09,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:24:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 383. [2020-02-10 20:24:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:24:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1298 transitions. [2020-02-10 20:24:09,196 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1298 transitions. Word has length 22 [2020-02-10 20:24:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:09,196 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1298 transitions. [2020-02-10 20:24:09,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1298 transitions. [2020-02-10 20:24:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:09,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:09,196 INFO L415 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] [2020-02-10 20:24:09,196 INFO L427 AbstractCegarLoop]: === Iteration 1858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash -744994536, now seen corresponding path program 1852 times [2020-02-10 20:24:09,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:09,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395919326] [2020-02-10 20:24:09,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:09,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395919326] [2020-02-10 20:24:09,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:09,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733561640] [2020-02-10 20:24:09,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:09,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:09,474 INFO L87 Difference]: Start difference. First operand 383 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:24:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:09,604 INFO L93 Difference]: Finished difference Result 625 states and 1828 transitions. [2020-02-10 20:24:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:09,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:09,605 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:24:09,605 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:24:09,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:24:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 378. [2020-02-10 20:24:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 20:24:09,614 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 20:24:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:09,614 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 20:24:09,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 20:24:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:09,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:09,615 INFO L415 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] [2020-02-10 20:24:09,615 INFO L427 AbstractCegarLoop]: === Iteration 1859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -258963048, now seen corresponding path program 1853 times [2020-02-10 20:24:09,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:09,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16026115] [2020-02-10 20:24:09,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:09,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16026115] [2020-02-10 20:24:09,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:09,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:09,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055515603] [2020-02-10 20:24:09,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:09,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:09,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:09,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:09,890 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:24:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:10,015 INFO L93 Difference]: Finished difference Result 617 states and 1813 transitions. [2020-02-10 20:24:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:10,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:10,017 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:24:10,017 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:24:10,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:24:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 381. [2020-02-10 20:24:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:24:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1291 transitions. [2020-02-10 20:24:10,027 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1291 transitions. Word has length 22 [2020-02-10 20:24:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:10,027 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1291 transitions. [2020-02-10 20:24:10,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1291 transitions. [2020-02-10 20:24:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:10,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:10,028 INFO L415 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] [2020-02-10 20:24:10,028 INFO L427 AbstractCegarLoop]: === Iteration 1860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 614777632, now seen corresponding path program 1854 times [2020-02-10 20:24:10,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:10,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783196076] [2020-02-10 20:24:10,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:10,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783196076] [2020-02-10 20:24:10,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:10,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:10,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317333552] [2020-02-10 20:24:10,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:10,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:10,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:10,301 INFO L87 Difference]: Start difference. First operand 381 states and 1291 transitions. Second operand 9 states. [2020-02-10 20:24:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:10,410 INFO L93 Difference]: Finished difference Result 618 states and 1812 transitions. [2020-02-10 20:24:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:10,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:10,412 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:24:10,412 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:24:10,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:24:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 374. [2020-02-10 20:24:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1276 transitions. [2020-02-10 20:24:10,422 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:10,422 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1276 transitions. [2020-02-10 20:24:10,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1276 transitions. [2020-02-10 20:24:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:10,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:10,422 INFO L415 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] [2020-02-10 20:24:10,423 INFO L427 AbstractCegarLoop]: === Iteration 1861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:10,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1882524392, now seen corresponding path program 1855 times [2020-02-10 20:24:10,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:10,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035762594] [2020-02-10 20:24:10,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:10,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035762594] [2020-02-10 20:24:10,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:10,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:10,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775176244] [2020-02-10 20:24:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:10,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:10,693 INFO L87 Difference]: Start difference. First operand 374 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:10,786 INFO L93 Difference]: Finished difference Result 621 states and 1816 transitions. [2020-02-10 20:24:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:10,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:10,788 INFO L225 Difference]: With dead ends: 621 [2020-02-10 20:24:10,788 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:24:10,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:24:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2020-02-10 20:24:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:24:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-02-10 20:24:10,797 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-02-10 20:24:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:10,797 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-02-10 20:24:10,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-02-10 20:24:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:10,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:10,798 INFO L415 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] [2020-02-10 20:24:10,798 INFO L427 AbstractCegarLoop]: === Iteration 1862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -822177018, now seen corresponding path program 1856 times [2020-02-10 20:24:10,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:10,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572583387] [2020-02-10 20:24:10,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:11,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572583387] [2020-02-10 20:24:11,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:11,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605838254] [2020-02-10 20:24:11,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:11,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:11,072 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:24:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:11,199 INFO L93 Difference]: Finished difference Result 616 states and 1803 transitions. [2020-02-10 20:24:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:11,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:11,201 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:24:11,201 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:24:11,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:24:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 378. [2020-02-10 20:24:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 20:24:11,210 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 20:24:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:11,210 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 20:24:11,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 20:24:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:11,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:11,211 INFO L415 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] [2020-02-10 20:24:11,211 INFO L427 AbstractCegarLoop]: === Iteration 1863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1079879976, now seen corresponding path program 1857 times [2020-02-10 20:24:11,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:11,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116437328] [2020-02-10 20:24:11,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:11,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116437328] [2020-02-10 20:24:11,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:11,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40280668] [2020-02-10 20:24:11,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:11,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:11,479 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:24:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:11,584 INFO L93 Difference]: Finished difference Result 617 states and 1808 transitions. [2020-02-10 20:24:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:11,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:11,586 INFO L225 Difference]: With dead ends: 617 [2020-02-10 20:24:11,586 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:24:11,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:24:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-02-10 20:24:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:24:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1296 transitions. [2020-02-10 20:24:11,595 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1296 transitions. Word has length 22 [2020-02-10 20:24:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:11,595 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1296 transitions. [2020-02-10 20:24:11,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1296 transitions. [2020-02-10 20:24:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:11,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:11,596 INFO L415 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] [2020-02-10 20:24:11,596 INFO L427 AbstractCegarLoop]: === Iteration 1864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1623987292, now seen corresponding path program 1858 times [2020-02-10 20:24:11,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:11,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518412790] [2020-02-10 20:24:11,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:11,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518412790] [2020-02-10 20:24:11,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:11,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220044955] [2020-02-10 20:24:11,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:11,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:11,861 INFO L87 Difference]: Start difference. First operand 384 states and 1296 transitions. Second operand 9 states. [2020-02-10 20:24:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:11,968 INFO L93 Difference]: Finished difference Result 605 states and 1789 transitions. [2020-02-10 20:24:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:11,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:11,970 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:24:11,970 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:24:11,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:24:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 378. [2020-02-10 20:24:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-02-10 20:24:11,980 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-02-10 20:24:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:11,980 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-02-10 20:24:11,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-02-10 20:24:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:11,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:11,981 INFO L415 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] [2020-02-10 20:24:11,981 INFO L427 AbstractCegarLoop]: === Iteration 1865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1999790906, now seen corresponding path program 1859 times [2020-02-10 20:24:11,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:11,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668859520] [2020-02-10 20:24:11,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:12,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668859520] [2020-02-10 20:24:12,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:12,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:12,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405930349] [2020-02-10 20:24:12,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:12,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:12,239 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-02-10 20:24:12,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:12,363 INFO L93 Difference]: Finished difference Result 609 states and 1787 transitions. [2020-02-10 20:24:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:12,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:12,365 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:24:12,365 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:24:12,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:24:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 381. [2020-02-10 20:24:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:24:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1287 transitions. [2020-02-10 20:24:12,377 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1287 transitions. Word has length 22 [2020-02-10 20:24:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:12,377 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1287 transitions. [2020-02-10 20:24:12,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1287 transitions. [2020-02-10 20:24:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:12,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:12,378 INFO L415 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] [2020-02-10 20:24:12,378 INFO L427 AbstractCegarLoop]: === Iteration 1866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -566129056, now seen corresponding path program 1860 times [2020-02-10 20:24:12,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:12,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981449491] [2020-02-10 20:24:12,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:12,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981449491] [2020-02-10 20:24:12,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:12,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:12,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430562552] [2020-02-10 20:24:12,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:12,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:12,658 INFO L87 Difference]: Start difference. First operand 381 states and 1287 transitions. Second operand 9 states. [2020-02-10 20:24:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:12,785 INFO L93 Difference]: Finished difference Result 602 states and 1780 transitions. [2020-02-10 20:24:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:12,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:12,787 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:24:12,787 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:24:12,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:24:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 374. [2020-02-10 20:24:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1272 transitions. [2020-02-10 20:24:12,795 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1272 transitions. Word has length 22 [2020-02-10 20:24:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:12,795 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1272 transitions. [2020-02-10 20:24:12,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1272 transitions. [2020-02-10 20:24:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:12,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:12,795 INFO L415 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] [2020-02-10 20:24:12,796 INFO L427 AbstractCegarLoop]: === Iteration 1867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash -683888826, now seen corresponding path program 1861 times [2020-02-10 20:24:12,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:12,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890151152] [2020-02-10 20:24:12,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:13,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890151152] [2020-02-10 20:24:13,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:13,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:13,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617624468] [2020-02-10 20:24:13,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:13,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:13,071 INFO L87 Difference]: Start difference. First operand 374 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:24:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:13,179 INFO L93 Difference]: Finished difference Result 618 states and 1812 transitions. [2020-02-10 20:24:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:13,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:13,181 INFO L225 Difference]: With dead ends: 618 [2020-02-10 20:24:13,181 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:24:13,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:24:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 384. [2020-02-10 20:24:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:24:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1298 transitions. [2020-02-10 20:24:13,191 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1298 transitions. Word has length 22 [2020-02-10 20:24:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:13,191 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1298 transitions. [2020-02-10 20:24:13,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1298 transitions. [2020-02-10 20:24:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:13,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:13,192 INFO L415 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] [2020-02-10 20:24:13,192 INFO L427 AbstractCegarLoop]: === Iteration 1868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1909750568, now seen corresponding path program 1862 times [2020-02-10 20:24:13,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:13,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849146935] [2020-02-10 20:24:13,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:13,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849146935] [2020-02-10 20:24:13,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:13,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:13,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940519787] [2020-02-10 20:24:13,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:13,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:13,464 INFO L87 Difference]: Start difference. First operand 384 states and 1298 transitions. Second operand 9 states. [2020-02-10 20:24:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:13,592 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-02-10 20:24:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:13,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:13,594 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:24:13,594 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:24:13,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:24:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 379. [2020-02-10 20:24:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1285 transitions. [2020-02-10 20:24:13,604 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1285 transitions. Word has length 22 [2020-02-10 20:24:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:13,604 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1285 transitions. [2020-02-10 20:24:13,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1285 transitions. [2020-02-10 20:24:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:13,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:13,604 INFO L415 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] [2020-02-10 20:24:13,604 INFO L427 AbstractCegarLoop]: === Iteration 1869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 60813672, now seen corresponding path program 1863 times [2020-02-10 20:24:13,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:13,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469980334] [2020-02-10 20:24:13,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:13,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469980334] [2020-02-10 20:24:13,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:13,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:13,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756816950] [2020-02-10 20:24:13,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:13,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:13,880 INFO L87 Difference]: Start difference. First operand 379 states and 1285 transitions. Second operand 9 states. [2020-02-10 20:24:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:13,963 INFO L93 Difference]: Finished difference Result 606 states and 1782 transitions. [2020-02-10 20:24:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:13,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:13,965 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:24:13,965 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:24:13,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:24:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 20:24:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 20:24:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1295 transitions. [2020-02-10 20:24:13,973 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1295 transitions. Word has length 22 [2020-02-10 20:24:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:13,973 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1295 transitions. [2020-02-10 20:24:13,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1295 transitions. [2020-02-10 20:24:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:13,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:13,974 INFO L415 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] [2020-02-10 20:24:13,974 INFO L427 AbstractCegarLoop]: === Iteration 1870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1530286356, now seen corresponding path program 1864 times [2020-02-10 20:24:13,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:13,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583605624] [2020-02-10 20:24:13,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:14,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583605624] [2020-02-10 20:24:14,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:14,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:14,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501568771] [2020-02-10 20:24:14,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:14,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:14,248 INFO L87 Difference]: Start difference. First operand 385 states and 1295 transitions. Second operand 9 states. [2020-02-10 20:24:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:14,376 INFO L93 Difference]: Finished difference Result 594 states and 1763 transitions. [2020-02-10 20:24:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:14,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:14,378 INFO L225 Difference]: With dead ends: 594 [2020-02-10 20:24:14,378 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:24:14,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:24:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-02-10 20:24:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-02-10 20:24:14,386 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-02-10 20:24:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:14,386 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-02-10 20:24:14,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-02-10 20:24:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:14,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:14,387 INFO L415 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] [2020-02-10 20:24:14,387 INFO L427 AbstractCegarLoop]: === Iteration 1871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash 759660260, now seen corresponding path program 1865 times [2020-02-10 20:24:14,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:14,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602904799] [2020-02-10 20:24:14,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:14,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602904799] [2020-02-10 20:24:14,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:14,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:14,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772673374] [2020-02-10 20:24:14,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:14,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:14,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:14,659 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:24:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:14,791 INFO L93 Difference]: Finished difference Result 591 states and 1757 transitions. [2020-02-10 20:24:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:14,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:14,792 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:24:14,792 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:24:14,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:24:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 383. [2020-02-10 20:24:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:24:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1287 transitions. [2020-02-10 20:24:14,803 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1287 transitions. Word has length 22 [2020-02-10 20:24:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:14,803 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1287 transitions. [2020-02-10 20:24:14,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1287 transitions. [2020-02-10 20:24:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:14,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:14,804 INFO L415 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] [2020-02-10 20:24:14,805 INFO L427 AbstractCegarLoop]: === Iteration 1872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1618534790, now seen corresponding path program 1866 times [2020-02-10 20:24:14,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:14,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965058448] [2020-02-10 20:24:14,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:15,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965058448] [2020-02-10 20:24:15,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:15,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:15,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839102139] [2020-02-10 20:24:15,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:15,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:15,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:15,084 INFO L87 Difference]: Start difference. First operand 383 states and 1287 transitions. Second operand 9 states. [2020-02-10 20:24:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:15,210 INFO L93 Difference]: Finished difference Result 578 states and 1738 transitions. [2020-02-10 20:24:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:15,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:15,212 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:24:15,212 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:24:15,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:24:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-02-10 20:24:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 20:24:15,221 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:15,222 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 20:24:15,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 20:24:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:15,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:15,222 INFO L415 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] [2020-02-10 20:24:15,222 INFO L427 AbstractCegarLoop]: === Iteration 1873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1322696676, now seen corresponding path program 1867 times [2020-02-10 20:24:15,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:15,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849383255] [2020-02-10 20:24:15,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:15,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849383255] [2020-02-10 20:24:15,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:15,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:15,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877527591] [2020-02-10 20:24:15,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:15,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:15,493 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:15,602 INFO L93 Difference]: Finished difference Result 601 states and 1770 transitions. [2020-02-10 20:24:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:15,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:15,604 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:24:15,604 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:24:15,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:24:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 380. [2020-02-10 20:24:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:24:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1284 transitions. [2020-02-10 20:24:15,613 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1284 transitions. Word has length 22 [2020-02-10 20:24:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:15,613 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1284 transitions. [2020-02-10 20:24:15,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1284 transitions. [2020-02-10 20:24:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:15,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:15,614 INFO L415 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] [2020-02-10 20:24:15,614 INFO L427 AbstractCegarLoop]: === Iteration 1874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2098529940, now seen corresponding path program 1868 times [2020-02-10 20:24:15,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:15,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295660439] [2020-02-10 20:24:15,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:15,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295660439] [2020-02-10 20:24:15,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:15,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:15,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597127855] [2020-02-10 20:24:15,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:15,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:15,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:15,886 INFO L87 Difference]: Start difference. First operand 380 states and 1284 transitions. Second operand 9 states. [2020-02-10 20:24:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:16,015 INFO L93 Difference]: Finished difference Result 602 states and 1769 transitions. [2020-02-10 20:24:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:16,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:16,017 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:24:16,017 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:24:16,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:24:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2020-02-10 20:24:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-02-10 20:24:16,026 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:16,026 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-02-10 20:24:16,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-02-10 20:24:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:16,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:16,027 INFO L415 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] [2020-02-10 20:24:16,027 INFO L427 AbstractCegarLoop]: === Iteration 1875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2067399174, now seen corresponding path program 1869 times [2020-02-10 20:24:16,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:16,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980856299] [2020-02-10 20:24:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:16,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980856299] [2020-02-10 20:24:16,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:16,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:16,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336892533] [2020-02-10 20:24:16,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:16,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:16,289 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:16,408 INFO L93 Difference]: Finished difference Result 596 states and 1756 transitions. [2020-02-10 20:24:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:16,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:16,410 INFO L225 Difference]: With dead ends: 596 [2020-02-10 20:24:16,410 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:24:16,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:24:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 380. [2020-02-10 20:24:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 20:24:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1281 transitions. [2020-02-10 20:24:16,420 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1281 transitions. Word has length 22 [2020-02-10 20:24:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:16,420 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1281 transitions. [2020-02-10 20:24:16,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1281 transitions. [2020-02-10 20:24:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:16,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:16,421 INFO L415 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] [2020-02-10 20:24:16,421 INFO L427 AbstractCegarLoop]: === Iteration 1876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -498520788, now seen corresponding path program 1870 times [2020-02-10 20:24:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:16,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022122084] [2020-02-10 20:24:16,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:16,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022122084] [2020-02-10 20:24:16,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:16,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:16,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11454237] [2020-02-10 20:24:16,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:16,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:16,686 INFO L87 Difference]: Start difference. First operand 380 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:24:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:16,814 INFO L93 Difference]: Finished difference Result 589 states and 1749 transitions. [2020-02-10 20:24:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:16,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:16,816 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:24:16,816 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:24:16,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:24:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-02-10 20:24:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1273 transitions. [2020-02-10 20:24:16,825 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:16,826 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1273 transitions. [2020-02-10 20:24:16,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1273 transitions. [2020-02-10 20:24:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:16,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:16,826 INFO L415 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] [2020-02-10 20:24:16,826 INFO L427 AbstractCegarLoop]: === Iteration 1877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash -37670138, now seen corresponding path program 1871 times [2020-02-10 20:24:16,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:16,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735428330] [2020-02-10 20:24:16,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:17,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735428330] [2020-02-10 20:24:17,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:17,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:17,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268716336] [2020-02-10 20:24:17,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:17,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:17,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:17,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:17,098 INFO L87 Difference]: Start difference. First operand 377 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:17,223 INFO L93 Difference]: Finished difference Result 589 states and 1750 transitions. [2020-02-10 20:24:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:17,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:17,224 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:24:17,225 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 20:24:17,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 20:24:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 381. [2020-02-10 20:24:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:24:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1280 transitions. [2020-02-10 20:24:17,233 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1280 transitions. Word has length 22 [2020-02-10 20:24:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:17,233 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1280 transitions. [2020-02-10 20:24:17,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1280 transitions. [2020-02-10 20:24:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:17,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:17,234 INFO L415 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] [2020-02-10 20:24:17,234 INFO L427 AbstractCegarLoop]: === Iteration 1878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 817636516, now seen corresponding path program 1872 times [2020-02-10 20:24:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:17,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881998482] [2020-02-10 20:24:17,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:17,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881998482] [2020-02-10 20:24:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:17,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:17,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544229493] [2020-02-10 20:24:17,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:17,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:17,510 INFO L87 Difference]: Start difference. First operand 381 states and 1280 transitions. Second operand 9 states. [2020-02-10 20:24:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:17,638 INFO L93 Difference]: Finished difference Result 576 states and 1731 transitions. [2020-02-10 20:24:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:17,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:17,640 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:24:17,640 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 20:24:17,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 20:24:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 370. [2020-02-10 20:24:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:24:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-02-10 20:24:17,649 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-02-10 20:24:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:17,649 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-02-10 20:24:17,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-02-10 20:24:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:17,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:17,649 INFO L415 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] [2020-02-10 20:24:17,649 INFO L427 AbstractCegarLoop]: === Iteration 1879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:17,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1869926862, now seen corresponding path program 1873 times [2020-02-10 20:24:17,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:17,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344840829] [2020-02-10 20:24:17,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:17,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344840829] [2020-02-10 20:24:17,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:17,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:17,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863513217] [2020-02-10 20:24:17,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:17,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:17,899 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-02-10 20:24:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:18,000 INFO L93 Difference]: Finished difference Result 615 states and 1798 transitions. [2020-02-10 20:24:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:18,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:18,002 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:24:18,002 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:24:18,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:24:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 379. [2020-02-10 20:24:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1286 transitions. [2020-02-10 20:24:18,012 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1286 transitions. Word has length 22 [2020-02-10 20:24:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:18,012 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1286 transitions. [2020-02-10 20:24:18,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1286 transitions. [2020-02-10 20:24:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:18,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:18,013 INFO L415 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] [2020-02-10 20:24:18,013 INFO L427 AbstractCegarLoop]: === Iteration 1880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:18,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1743290488, now seen corresponding path program 1874 times [2020-02-10 20:24:18,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:18,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543578631] [2020-02-10 20:24:18,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:18,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543578631] [2020-02-10 20:24:18,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:18,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:18,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864791068] [2020-02-10 20:24:18,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:18,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:18,269 INFO L87 Difference]: Start difference. First operand 379 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:24:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:18,398 INFO L93 Difference]: Finished difference Result 609 states and 1784 transitions. [2020-02-10 20:24:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:18,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:18,400 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:24:18,400 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:24:18,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:24:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 376. [2020-02-10 20:24:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 20:24:18,408 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:18,408 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 20:24:18,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 20:24:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:18,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:18,409 INFO L415 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] [2020-02-10 20:24:18,409 INFO L427 AbstractCegarLoop]: === Iteration 1881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1349329278, now seen corresponding path program 1875 times [2020-02-10 20:24:18,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:18,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926327336] [2020-02-10 20:24:18,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:18,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926327336] [2020-02-10 20:24:18,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:18,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:18,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12928443] [2020-02-10 20:24:18,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:18,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:18,670 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:18,774 INFO L93 Difference]: Finished difference Result 619 states and 1805 transitions. [2020-02-10 20:24:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:18,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:18,775 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:24:18,776 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:24:18,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:24:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 381. [2020-02-10 20:24:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 20:24:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1287 transitions. [2020-02-10 20:24:18,785 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1287 transitions. Word has length 22 [2020-02-10 20:24:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:18,785 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1287 transitions. [2020-02-10 20:24:18,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1287 transitions. [2020-02-10 20:24:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:18,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:18,785 INFO L415 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] [2020-02-10 20:24:18,786 INFO L427 AbstractCegarLoop]: === Iteration 1882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1240829832, now seen corresponding path program 1876 times [2020-02-10 20:24:18,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:18,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920216656] [2020-02-10 20:24:18,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:19,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920216656] [2020-02-10 20:24:19,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:19,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:19,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385311597] [2020-02-10 20:24:19,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:19,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:19,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:19,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:19,052 INFO L87 Difference]: Start difference. First operand 381 states and 1287 transitions. Second operand 9 states. [2020-02-10 20:24:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,180 INFO L93 Difference]: Finished difference Result 615 states and 1793 transitions. [2020-02-10 20:24:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:19,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,182 INFO L225 Difference]: With dead ends: 615 [2020-02-10 20:24:19,182 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:24:19,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:24:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 376. [2020-02-10 20:24:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 20:24:19,192 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:19,192 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 20:24:19,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 20:24:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:19,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:19,192 INFO L415 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] [2020-02-10 20:24:19,193 INFO L427 AbstractCegarLoop]: === Iteration 1883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash -670205108, now seen corresponding path program 1877 times [2020-02-10 20:24:19,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:19,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628833931] [2020-02-10 20:24:19,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:19,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628833931] [2020-02-10 20:24:19,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:19,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:19,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42063164] [2020-02-10 20:24:19,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:19,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:19,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:19,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:19,443 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,574 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2020-02-10 20:24:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:19,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,576 INFO L225 Difference]: With dead ends: 604 [2020-02-10 20:24:19,576 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:24:19,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:24:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 378. [2020-02-10 20:24:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 20:24:19,585 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:19,586 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 20:24:19,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 20:24:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:19,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:19,586 INFO L415 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] [2020-02-10 20:24:19,586 INFO L427 AbstractCegarLoop]: === Iteration 1884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash -843452800, now seen corresponding path program 1878 times [2020-02-10 20:24:19,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:19,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750869650] [2020-02-10 20:24:19,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:19,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750869650] [2020-02-10 20:24:19,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:19,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:19,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707189970] [2020-02-10 20:24:19,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:19,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:19,844 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,974 INFO L93 Difference]: Finished difference Result 606 states and 1774 transitions. [2020-02-10 20:24:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:19,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,976 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:24:19,976 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:24:19,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:24:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 373. [2020-02-10 20:24:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1269 transitions. [2020-02-10 20:24:19,985 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:19,985 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1269 transitions. [2020-02-10 20:24:19,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1269 transitions. [2020-02-10 20:24:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:19,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:19,985 INFO L415 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] [2020-02-10 20:24:19,986 INFO L427 AbstractCegarLoop]: === Iteration 1885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash 824602580, now seen corresponding path program 1879 times [2020-02-10 20:24:19,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:19,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317414712] [2020-02-10 20:24:19,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:20,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317414712] [2020-02-10 20:24:20,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:20,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:20,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119917419] [2020-02-10 20:24:20,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:20,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:20,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:20,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:20,226 INFO L87 Difference]: Start difference. First operand 373 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:20,330 INFO L93 Difference]: Finished difference Result 611 states and 1783 transitions. [2020-02-10 20:24:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:20,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:20,332 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:24:20,332 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 20:24:20,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 20:24:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 379. [2020-02-10 20:24:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1283 transitions. [2020-02-10 20:24:20,342 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1283 transitions. Word has length 22 [2020-02-10 20:24:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:20,342 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1283 transitions. [2020-02-10 20:24:20,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1283 transitions. [2020-02-10 20:24:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:20,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:20,342 INFO L415 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] [2020-02-10 20:24:20,342 INFO L427 AbstractCegarLoop]: === Iteration 1886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:20,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:20,343 INFO L82 PathProgramCache]: Analyzing trace with hash 951238954, now seen corresponding path program 1880 times [2020-02-10 20:24:20,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:20,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728838728] [2020-02-10 20:24:20,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:20,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728838728] [2020-02-10 20:24:20,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:20,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:20,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142877046] [2020-02-10 20:24:20,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:20,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:20,585 INFO L87 Difference]: Start difference. First operand 379 states and 1283 transitions. Second operand 9 states. [2020-02-10 20:24:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:20,712 INFO L93 Difference]: Finished difference Result 605 states and 1769 transitions. [2020-02-10 20:24:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:20,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:20,714 INFO L225 Difference]: With dead ends: 605 [2020-02-10 20:24:20,714 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:24:20,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:24:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 376. [2020-02-10 20:24:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 20:24:20,723 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:20,723 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 20:24:20,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 20:24:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:20,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:20,724 INFO L415 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] [2020-02-10 20:24:20,724 INFO L427 AbstractCegarLoop]: === Iteration 1887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1359832382, now seen corresponding path program 1881 times [2020-02-10 20:24:20,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:20,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123245827] [2020-02-10 20:24:20,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:20,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123245827] [2020-02-10 20:24:20,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:20,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:20,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666506245] [2020-02-10 20:24:20,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:20,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:20,977 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:21,085 INFO L93 Difference]: Finished difference Result 609 states and 1781 transitions. [2020-02-10 20:24:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:21,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:21,086 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:24:21,087 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:24:21,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:24:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 382. [2020-02-10 20:24:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:24:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1286 transitions. [2020-02-10 20:24:21,096 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1286 transitions. Word has length 22 [2020-02-10 20:24:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:21,096 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1286 transitions. [2020-02-10 20:24:21,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1286 transitions. [2020-02-10 20:24:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:21,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:21,097 INFO L415 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] [2020-02-10 20:24:21,097 INFO L427 AbstractCegarLoop]: === Iteration 1888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2106263308, now seen corresponding path program 1882 times [2020-02-10 20:24:21,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:21,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325909218] [2020-02-10 20:24:21,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:21,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325909218] [2020-02-10 20:24:21,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:21,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:21,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790655342] [2020-02-10 20:24:21,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:21,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:21,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:21,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:21,342 INFO L87 Difference]: Start difference. First operand 382 states and 1286 transitions. Second operand 9 states. [2020-02-10 20:24:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:21,470 INFO L93 Difference]: Finished difference Result 597 states and 1762 transitions. [2020-02-10 20:24:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:21,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:21,472 INFO L225 Difference]: With dead ends: 597 [2020-02-10 20:24:21,472 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:24:21,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:24:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 376. [2020-02-10 20:24:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1273 transitions. [2020-02-10 20:24:21,481 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:21,481 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1273 transitions. [2020-02-10 20:24:21,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1273 transitions. [2020-02-10 20:24:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:21,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:21,482 INFO L415 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] [2020-02-10 20:24:21,482 INFO L427 AbstractCegarLoop]: === Iteration 1889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash -659702004, now seen corresponding path program 1883 times [2020-02-10 20:24:21,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:21,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104089896] [2020-02-10 20:24:21,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:21,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104089896] [2020-02-10 20:24:21,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:21,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:21,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086949876] [2020-02-10 20:24:21,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:21,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:21,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:21,728 INFO L87 Difference]: Start difference. First operand 376 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:21,855 INFO L93 Difference]: Finished difference Result 599 states and 1756 transitions. [2020-02-10 20:24:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:21,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:21,856 INFO L225 Difference]: With dead ends: 599 [2020-02-10 20:24:21,857 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:24:21,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:24:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 378. [2020-02-10 20:24:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1276 transitions. [2020-02-10 20:24:21,865 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:21,865 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1276 transitions. [2020-02-10 20:24:21,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1276 transitions. [2020-02-10 20:24:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:21,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:21,865 INFO L415 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] [2020-02-10 20:24:21,865 INFO L427 AbstractCegarLoop]: === Iteration 1890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash -88247198, now seen corresponding path program 1884 times [2020-02-10 20:24:21,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:21,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942847122] [2020-02-10 20:24:21,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:22,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942847122] [2020-02-10 20:24:22,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:22,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:22,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813396358] [2020-02-10 20:24:22,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:22,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:22,110 INFO L87 Difference]: Start difference. First operand 378 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:22,227 INFO L93 Difference]: Finished difference Result 593 states and 1752 transitions. [2020-02-10 20:24:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:22,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:22,228 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:24:22,228 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:24:22,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:24:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-02-10 20:24:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:24:22,237 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:22,238 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:24:22,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:24:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:22,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:22,238 INFO L415 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] [2020-02-10 20:24:22,238 INFO L427 AbstractCegarLoop]: === Iteration 1891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 761583956, now seen corresponding path program 1885 times [2020-02-10 20:24:22,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110322623] [2020-02-10 20:24:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:22,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110322623] [2020-02-10 20:24:22,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:22,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:22,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656535842] [2020-02-10 20:24:22,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:22,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:22,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:22,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:22,506 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:22,614 INFO L93 Difference]: Finished difference Result 613 states and 1794 transitions. [2020-02-10 20:24:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:22,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:22,616 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:24:22,616 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:24:22,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:24:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 383. [2020-02-10 20:24:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 20:24:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1292 transitions. [2020-02-10 20:24:22,624 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1292 transitions. Word has length 22 [2020-02-10 20:24:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:22,624 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1292 transitions. [2020-02-10 20:24:22,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1292 transitions. [2020-02-10 20:24:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:22,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:22,625 INFO L415 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] [2020-02-10 20:24:22,625 INFO L427 AbstractCegarLoop]: === Iteration 1892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 653084510, now seen corresponding path program 1886 times [2020-02-10 20:24:22,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:22,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33529214] [2020-02-10 20:24:22,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:22,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33529214] [2020-02-10 20:24:22,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:22,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446905494] [2020-02-10 20:24:22,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:22,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:22,887 INFO L87 Difference]: Start difference. First operand 383 states and 1292 transitions. Second operand 9 states. [2020-02-10 20:24:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:22,991 INFO L93 Difference]: Finished difference Result 609 states and 1782 transitions. [2020-02-10 20:24:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:22,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:22,993 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:24:22,993 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:24:22,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:24:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 378. [2020-02-10 20:24:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 20:24:23,002 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:23,002 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 20:24:23,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 20:24:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:23,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:23,003 INFO L415 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] [2020-02-10 20:24:23,003 INFO L427 AbstractCegarLoop]: === Iteration 1893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1922442382, now seen corresponding path program 1887 times [2020-02-10 20:24:23,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:23,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054828187] [2020-02-10 20:24:23,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054828187] [2020-02-10 20:24:23,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:23,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829162589] [2020-02-10 20:24:23,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:23,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:23,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:23,267 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:23,338 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-02-10 20:24:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:23,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:23,340 INFO L225 Difference]: With dead ends: 601 [2020-02-10 20:24:23,340 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:24:23,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:24:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-02-10 20:24:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 20:24:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1289 transitions. [2020-02-10 20:24:23,349 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1289 transitions. Word has length 22 [2020-02-10 20:24:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:23,349 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1289 transitions. [2020-02-10 20:24:23,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1289 transitions. [2020-02-10 20:24:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:23,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:23,350 INFO L415 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] [2020-02-10 20:24:23,350 INFO L427 AbstractCegarLoop]: === Iteration 1894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1176011456, now seen corresponding path program 1888 times [2020-02-10 20:24:23,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:23,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281825488] [2020-02-10 20:24:23,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281825488] [2020-02-10 20:24:23,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:23,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101908593] [2020-02-10 20:24:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:23,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:23,606 INFO L87 Difference]: Start difference. First operand 384 states and 1289 transitions. Second operand 9 states. [2020-02-10 20:24:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:23,704 INFO L93 Difference]: Finished difference Result 589 states and 1745 transitions. [2020-02-10 20:24:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:23,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:23,706 INFO L225 Difference]: With dead ends: 589 [2020-02-10 20:24:23,706 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:24:23,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:24:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 378. [2020-02-10 20:24:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1274 transitions. [2020-02-10 20:24:23,716 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1274 transitions. Word has length 22 [2020-02-10 20:24:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:23,716 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1274 transitions. [2020-02-10 20:24:23,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1274 transitions. [2020-02-10 20:24:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:23,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:23,717 INFO L415 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] [2020-02-10 20:24:23,717 INFO L427 AbstractCegarLoop]: === Iteration 1895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1047990256, now seen corresponding path program 1889 times [2020-02-10 20:24:23,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:23,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340241742] [2020-02-10 20:24:23,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340241742] [2020-02-10 20:24:23,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:23,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576601186] [2020-02-10 20:24:23,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:23,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:23,976 INFO L87 Difference]: Start difference. First operand 378 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:24:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:24,072 INFO L93 Difference]: Finished difference Result 586 states and 1739 transitions. [2020-02-10 20:24:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:24,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:24,074 INFO L225 Difference]: With dead ends: 586 [2020-02-10 20:24:24,074 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:24:24,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:24:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 382. [2020-02-10 20:24:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 20:24:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1281 transitions. [2020-02-10 20:24:24,083 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1281 transitions. Word has length 22 [2020-02-10 20:24:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:24,083 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1281 transitions. [2020-02-10 20:24:24,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1281 transitions. [2020-02-10 20:24:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:24,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:24,084 INFO L415 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] [2020-02-10 20:24:24,084 INFO L427 AbstractCegarLoop]: === Iteration 1896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash -189115726, now seen corresponding path program 1890 times [2020-02-10 20:24:24,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:24,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674064638] [2020-02-10 20:24:24,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:24,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674064638] [2020-02-10 20:24:24,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:24,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:24,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101957415] [2020-02-10 20:24:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:24,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:24,337 INFO L87 Difference]: Start difference. First operand 382 states and 1281 transitions. Second operand 9 states. [2020-02-10 20:24:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:24,429 INFO L93 Difference]: Finished difference Result 573 states and 1720 transitions. [2020-02-10 20:24:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:24,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:24,431 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:24:24,431 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:24:24,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:24:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 373. [2020-02-10 20:24:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 20:24:24,438 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 20:24:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:24,439 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 20:24:24,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 20:24:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:24,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:24,439 INFO L415 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] [2020-02-10 20:24:24,439 INFO L427 AbstractCegarLoop]: === Iteration 1897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash 930232746, now seen corresponding path program 1891 times [2020-02-10 20:24:24,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:24,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493604140] [2020-02-10 20:24:24,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:24,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493604140] [2020-02-10 20:24:24,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:24,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:24,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561598997] [2020-02-10 20:24:24,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:24,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:24,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:24,690 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:24:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:24,790 INFO L93 Difference]: Finished difference Result 591 states and 1739 transitions. [2020-02-10 20:24:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:24,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:24,791 INFO L225 Difference]: With dead ends: 591 [2020-02-10 20:24:24,791 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:24:24,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:24:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 377. [2020-02-10 20:24:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1273 transitions. [2020-02-10 20:24:24,801 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:24,801 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1273 transitions. [2020-02-10 20:24:24,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1273 transitions. [2020-02-10 20:24:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:24,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:24,802 INFO L415 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] [2020-02-10 20:24:24,802 INFO L427 AbstractCegarLoop]: === Iteration 1898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash 756985054, now seen corresponding path program 1892 times [2020-02-10 20:24:24,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:24,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858260858] [2020-02-10 20:24:24,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:25,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858260858] [2020-02-10 20:24:25,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:25,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:25,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498917370] [2020-02-10 20:24:25,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:25,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:25,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:25,059 INFO L87 Difference]: Start difference. First operand 377 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,156 INFO L93 Difference]: Finished difference Result 593 states and 1741 transitions. [2020-02-10 20:24:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:25,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,158 INFO L225 Difference]: With dead ends: 593 [2020-02-10 20:24:25,158 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 20:24:25,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 20:24:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 375. [2020-02-10 20:24:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1268 transitions. [2020-02-10 20:24:25,166 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,166 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1268 transitions. [2020-02-10 20:24:25,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1268 transitions. [2020-02-10 20:24:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:25,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,167 INFO L415 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] [2020-02-10 20:24:25,167 INFO L427 AbstractCegarLoop]: === Iteration 1899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1753793592, now seen corresponding path program 1893 times [2020-02-10 20:24:25,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45074248] [2020-02-10 20:24:25,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:25,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45074248] [2020-02-10 20:24:25,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:25,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:25,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045098864] [2020-02-10 20:24:25,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:25,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:25,414 INFO L87 Difference]: Start difference. First operand 375 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,522 INFO L93 Difference]: Finished difference Result 588 states and 1731 transitions. [2020-02-10 20:24:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:25,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,524 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:24:25,524 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:24:25,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:24:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 377. [2020-02-10 20:24:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1271 transitions. [2020-02-10 20:24:25,532 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1271 transitions. Word has length 22 [2020-02-10 20:24:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,532 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1271 transitions. [2020-02-10 20:24:25,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1271 transitions. [2020-02-10 20:24:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:25,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,533 INFO L415 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] [2020-02-10 20:24:25,533 INFO L427 AbstractCegarLoop]: === Iteration 1900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1182338786, now seen corresponding path program 1894 times [2020-02-10 20:24:25,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349341530] [2020-02-10 20:24:25,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:25,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349341530] [2020-02-10 20:24:25,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:25,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:25,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749693724] [2020-02-10 20:24:25,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:25,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:25,776 INFO L87 Difference]: Start difference. First operand 377 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:24:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,876 INFO L93 Difference]: Finished difference Result 582 states and 1727 transitions. [2020-02-10 20:24:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:25,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,877 INFO L225 Difference]: With dead ends: 582 [2020-02-10 20:24:25,877 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:24:25,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:24:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 375. [2020-02-10 20:24:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1266 transitions. [2020-02-10 20:24:25,887 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,887 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1266 transitions. [2020-02-10 20:24:25,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1266 transitions. [2020-02-10 20:24:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:25,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,888 INFO L415 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] [2020-02-10 20:24:25,888 INFO L427 AbstractCegarLoop]: === Iteration 1901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1292214856, now seen corresponding path program 1895 times [2020-02-10 20:24:25,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744829826] [2020-02-10 20:24:25,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:26,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744829826] [2020-02-10 20:24:26,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:26,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:26,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552918586] [2020-02-10 20:24:26,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:26,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:26,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:26,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:26,140 INFO L87 Difference]: Start difference. First operand 375 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:26,235 INFO L93 Difference]: Finished difference Result 583 states and 1731 transitions. [2020-02-10 20:24:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:26,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:26,237 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:24:26,237 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:24:26,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:24:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 379. [2020-02-10 20:24:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1273 transitions. [2020-02-10 20:24:26,246 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:26,247 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1273 transitions. [2020-02-10 20:24:26,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1273 transitions. [2020-02-10 20:24:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:26,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:26,247 INFO L415 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] [2020-02-10 20:24:26,247 INFO L427 AbstractCegarLoop]: === Iteration 1902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2036917354, now seen corresponding path program 1896 times [2020-02-10 20:24:26,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:26,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505072470] [2020-02-10 20:24:26,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:26,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505072470] [2020-02-10 20:24:26,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:26,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:26,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096395286] [2020-02-10 20:24:26,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:26,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:26,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:26,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:26,503 INFO L87 Difference]: Start difference. First operand 379 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:26,608 INFO L93 Difference]: Finished difference Result 570 states and 1712 transitions. [2020-02-10 20:24:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:26,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:26,609 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:24:26,609 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:24:26,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:24:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 370. [2020-02-10 20:24:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 20:24:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1256 transitions. [2020-02-10 20:24:26,618 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1256 transitions. Word has length 22 [2020-02-10 20:24:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:26,619 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1256 transitions. [2020-02-10 20:24:26,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1256 transitions. [2020-02-10 20:24:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:26,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:26,619 INFO L415 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] [2020-02-10 20:24:26,619 INFO L427 AbstractCegarLoop]: === Iteration 1903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:26,619 INFO L82 PathProgramCache]: Analyzing trace with hash 787851088, now seen corresponding path program 1897 times [2020-02-10 20:24:26,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:26,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954060411] [2020-02-10 20:24:26,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:26,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954060411] [2020-02-10 20:24:26,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:26,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:26,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441403012] [2020-02-10 20:24:26,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:26,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:26,904 INFO L87 Difference]: Start difference. First operand 370 states and 1256 transitions. Second operand 9 states. [2020-02-10 20:24:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:27,002 INFO L93 Difference]: Finished difference Result 581 states and 1720 transitions. [2020-02-10 20:24:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:27,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:27,004 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:24:27,004 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:24:27,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:24:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 376. [2020-02-10 20:24:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1275 transitions. [2020-02-10 20:24:27,014 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1275 transitions. Word has length 22 [2020-02-10 20:24:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:27,014 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1275 transitions. [2020-02-10 20:24:27,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1275 transitions. [2020-02-10 20:24:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:27,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:27,014 INFO L415 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] [2020-02-10 20:24:27,014 INFO L427 AbstractCegarLoop]: === Iteration 1904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:27,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2129783876, now seen corresponding path program 1898 times [2020-02-10 20:24:27,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:27,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395210323] [2020-02-10 20:24:27,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:27,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395210323] [2020-02-10 20:24:27,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:27,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:27,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851338550] [2020-02-10 20:24:27,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:27,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:27,286 INFO L87 Difference]: Start difference. First operand 376 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:24:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:27,387 INFO L93 Difference]: Finished difference Result 580 states and 1716 transitions. [2020-02-10 20:24:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:27,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:27,389 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:24:27,389 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:24:27,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:24:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 374. [2020-02-10 20:24:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1270 transitions. [2020-02-10 20:24:27,399 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1270 transitions. Word has length 22 [2020-02-10 20:24:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:27,399 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1270 transitions. [2020-02-10 20:24:27,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1270 transitions. [2020-02-10 20:24:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:27,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:27,399 INFO L415 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] [2020-02-10 20:24:27,400 INFO L427 AbstractCegarLoop]: === Iteration 1905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash -287860068, now seen corresponding path program 1899 times [2020-02-10 20:24:27,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:27,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443915121] [2020-02-10 20:24:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:27,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443915121] [2020-02-10 20:24:27,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:27,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:27,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142743659] [2020-02-10 20:24:27,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:27,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:27,673 INFO L87 Difference]: Start difference. First operand 374 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:24:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:27,773 INFO L93 Difference]: Finished difference Result 584 states and 1725 transitions. [2020-02-10 20:24:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:27,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:27,774 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:24:27,775 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 20:24:27,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 20:24:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-02-10 20:24:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1275 transitions. [2020-02-10 20:24:27,783 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1275 transitions. Word has length 22 [2020-02-10 20:24:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:27,783 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1275 transitions. [2020-02-10 20:24:27,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1275 transitions. [2020-02-10 20:24:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:27,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:27,784 INFO L415 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] [2020-02-10 20:24:27,784 INFO L427 AbstractCegarLoop]: === Iteration 1906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2116258228, now seen corresponding path program 1900 times [2020-02-10 20:24:27,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:27,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922775121] [2020-02-10 20:24:27,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922775121] [2020-02-10 20:24:28,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:28,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515026362] [2020-02-10 20:24:28,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:28,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:28,056 INFO L87 Difference]: Start difference. First operand 377 states and 1275 transitions. Second operand 9 states. [2020-02-10 20:24:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:28,160 INFO L93 Difference]: Finished difference Result 585 states and 1724 transitions. [2020-02-10 20:24:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:28,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:28,161 INFO L225 Difference]: With dead ends: 585 [2020-02-10 20:24:28,162 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 20:24:28,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 20:24:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 374. [2020-02-10 20:24:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 20:24:28,170 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:28,171 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 20:24:28,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 20:24:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:28,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:28,171 INFO L415 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] [2020-02-10 20:24:28,171 INFO L427 AbstractCegarLoop]: === Iteration 1907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -19012660, now seen corresponding path program 1901 times [2020-02-10 20:24:28,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:28,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067796062] [2020-02-10 20:24:28,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067796062] [2020-02-10 20:24:28,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:28,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266758604] [2020-02-10 20:24:28,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:28,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:28,441 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:28,542 INFO L93 Difference]: Finished difference Result 581 states and 1716 transitions. [2020-02-10 20:24:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:28,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:28,543 INFO L225 Difference]: With dead ends: 581 [2020-02-10 20:24:28,544 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 20:24:28,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 20:24:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 376. [2020-02-10 20:24:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 20:24:28,552 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 20:24:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:28,552 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 20:24:28,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 20:24:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:28,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:28,553 INFO L415 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] [2020-02-10 20:24:28,553 INFO L427 AbstractCegarLoop]: === Iteration 1908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash -192260352, now seen corresponding path program 1902 times [2020-02-10 20:24:28,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:28,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339575427] [2020-02-10 20:24:28,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339575427] [2020-02-10 20:24:28,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:28,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077821372] [2020-02-10 20:24:28,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:28,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:28,824 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:24:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:28,925 INFO L93 Difference]: Finished difference Result 583 states and 1718 transitions. [2020-02-10 20:24:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:28,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:28,927 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:24:28,927 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:24:28,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:24:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 372. [2020-02-10 20:24:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:24:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:24:28,936 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:24:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:28,936 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:24:28,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:24:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:28,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:28,937 INFO L415 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] [2020-02-10 20:24:28,937 INFO L427 AbstractCegarLoop]: === Iteration 1909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -812586766, now seen corresponding path program 1903 times [2020-02-10 20:24:28,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:28,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301435088] [2020-02-10 20:24:28,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:29,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301435088] [2020-02-10 20:24:29,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:29,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:29,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105906590] [2020-02-10 20:24:29,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:29,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:29,200 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:24:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:29,300 INFO L93 Difference]: Finished difference Result 578 states and 1708 transitions. [2020-02-10 20:24:29,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:29,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:29,302 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:24:29,302 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:24:29,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:24:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-02-10 20:24:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1273 transitions. [2020-02-10 20:24:29,311 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:29,311 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1273 transitions. [2020-02-10 20:24:29,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1273 transitions. [2020-02-10 20:24:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:29,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:29,312 INFO L415 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] [2020-02-10 20:24:29,312 INFO L427 AbstractCegarLoop]: === Iteration 1910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash 529346022, now seen corresponding path program 1904 times [2020-02-10 20:24:29,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:29,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695621602] [2020-02-10 20:24:29,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:29,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695621602] [2020-02-10 20:24:29,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:29,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:29,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958472781] [2020-02-10 20:24:29,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:29,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:29,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:29,583 INFO L87 Difference]: Start difference. First operand 376 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:29,692 INFO L93 Difference]: Finished difference Result 577 states and 1704 transitions. [2020-02-10 20:24:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:29,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:29,694 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:24:29,694 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:24:29,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:24:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 374. [2020-02-10 20:24:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 20:24:29,703 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:29,703 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 20:24:29,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 20:24:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:29,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:29,704 INFO L415 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] [2020-02-10 20:24:29,704 INFO L427 AbstractCegarLoop]: === Iteration 1911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash -277356964, now seen corresponding path program 1905 times [2020-02-10 20:24:29,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:29,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427379155] [2020-02-10 20:24:29,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427379155] [2020-02-10 20:24:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719987171] [2020-02-10 20:24:29,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:29,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:29,969 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:30,068 INFO L93 Difference]: Finished difference Result 579 states and 1710 transitions. [2020-02-10 20:24:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:30,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:30,070 INFO L225 Difference]: With dead ends: 579 [2020-02-10 20:24:30,070 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:24:30,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:24:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 377. [2020-02-10 20:24:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1273 transitions. [2020-02-10 20:24:30,078 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,078 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1273 transitions. [2020-02-10 20:24:30,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1273 transitions. [2020-02-10 20:24:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:30,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,079 INFO L415 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] [2020-02-10 20:24:30,079 INFO L427 AbstractCegarLoop]: === Iteration 1912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash -505745972, now seen corresponding path program 1906 times [2020-02-10 20:24:30,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089629460] [2020-02-10 20:24:30,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:30,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089629460] [2020-02-10 20:24:30,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:30,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:30,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624986971] [2020-02-10 20:24:30,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:30,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:30,343 INFO L87 Difference]: Start difference. First operand 377 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:30,442 INFO L93 Difference]: Finished difference Result 572 states and 1703 transitions. [2020-02-10 20:24:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:30,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:30,444 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:24:30,444 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:24:30,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:24:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-02-10 20:24:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 20:24:30,453 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,453 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 20:24:30,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 20:24:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:30,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,454 INFO L415 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] [2020-02-10 20:24:30,454 INFO L427 AbstractCegarLoop]: === Iteration 1913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash -8509556, now seen corresponding path program 1907 times [2020-02-10 20:24:30,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124212634] [2020-02-10 20:24:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:30,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124212634] [2020-02-10 20:24:30,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:30,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:30,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923785006] [2020-02-10 20:24:30,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:30,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:30,719 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:30,816 INFO L93 Difference]: Finished difference Result 577 states and 1703 transitions. [2020-02-10 20:24:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:30,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:30,818 INFO L225 Difference]: With dead ends: 577 [2020-02-10 20:24:30,818 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:24:30,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:24:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-02-10 20:24:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1269 transitions. [2020-02-10 20:24:30,826 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,826 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1269 transitions. [2020-02-10 20:24:30,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1269 transitions. [2020-02-10 20:24:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:30,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,827 INFO L415 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] [2020-02-10 20:24:30,827 INFO L427 AbstractCegarLoop]: === Iteration 1914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 562945250, now seen corresponding path program 1908 times [2020-02-10 20:24:30,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512804423] [2020-02-10 20:24:30,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:31,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512804423] [2020-02-10 20:24:31,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:31,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:31,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692243745] [2020-02-10 20:24:31,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:31,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:31,092 INFO L87 Difference]: Start difference. First operand 376 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:31,191 INFO L93 Difference]: Finished difference Result 571 states and 1699 transitions. [2020-02-10 20:24:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:31,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:31,192 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:24:31,192 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:24:31,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:24:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2020-02-10 20:24:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:24:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 20:24:31,202 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 20:24:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:31,202 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 20:24:31,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 20:24:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:31,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:31,203 INFO L415 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] [2020-02-10 20:24:31,203 INFO L427 AbstractCegarLoop]: === Iteration 1915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash -875605390, now seen corresponding path program 1909 times [2020-02-10 20:24:31,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:31,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574306342] [2020-02-10 20:24:31,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:31,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574306342] [2020-02-10 20:24:31,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:31,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:31,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848488611] [2020-02-10 20:24:31,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:31,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:31,472 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 20:24:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:31,571 INFO L93 Difference]: Finished difference Result 583 states and 1722 transitions. [2020-02-10 20:24:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:31,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:31,572 INFO L225 Difference]: With dead ends: 583 [2020-02-10 20:24:31,573 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:24:31,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:24:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 378. [2020-02-10 20:24:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1277 transitions. [2020-02-10 20:24:31,582 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1277 transitions. Word has length 22 [2020-02-10 20:24:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:31,582 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1277 transitions. [2020-02-10 20:24:31,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1277 transitions. [2020-02-10 20:24:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:31,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:31,582 INFO L415 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] [2020-02-10 20:24:31,582 INFO L427 AbstractCegarLoop]: === Iteration 1916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1590963746, now seen corresponding path program 1910 times [2020-02-10 20:24:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709666490] [2020-02-10 20:24:31,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:31,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709666490] [2020-02-10 20:24:31,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:31,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:31,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377280092] [2020-02-10 20:24:31,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:31,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:31,859 INFO L87 Difference]: Start difference. First operand 378 states and 1277 transitions. Second operand 9 states. [2020-02-10 20:24:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:31,957 INFO L93 Difference]: Finished difference Result 584 states and 1721 transitions. [2020-02-10 20:24:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:31,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:31,958 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:24:31,959 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 20:24:31,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 20:24:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 375. [2020-02-10 20:24:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1269 transitions. [2020-02-10 20:24:31,968 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:31,968 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1269 transitions. [2020-02-10 20:24:31,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1269 transitions. [2020-02-10 20:24:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:31,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:31,968 INFO L415 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] [2020-02-10 20:24:31,969 INFO L427 AbstractCegarLoop]: === Iteration 1917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 735335568, now seen corresponding path program 1911 times [2020-02-10 20:24:31,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:31,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216726698] [2020-02-10 20:24:31,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:32,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216726698] [2020-02-10 20:24:32,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:32,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527227466] [2020-02-10 20:24:32,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:32,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:32,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:32,236 INFO L87 Difference]: Start difference. First operand 375 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:32,332 INFO L93 Difference]: Finished difference Result 578 states and 1708 transitions. [2020-02-10 20:24:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:32,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:32,333 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:24:32,333 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:24:32,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:24:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-02-10 20:24:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1274 transitions. [2020-02-10 20:24:32,342 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1274 transitions. Word has length 22 [2020-02-10 20:24:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:32,342 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1274 transitions. [2020-02-10 20:24:32,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1274 transitions. [2020-02-10 20:24:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:32,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:32,343 INFO L415 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] [2020-02-10 20:24:32,343 INFO L427 AbstractCegarLoop]: === Iteration 1918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 506946560, now seen corresponding path program 1912 times [2020-02-10 20:24:32,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:32,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492247558] [2020-02-10 20:24:32,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:32,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492247558] [2020-02-10 20:24:32,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:32,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320636639] [2020-02-10 20:24:32,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:32,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:32,607 INFO L87 Difference]: Start difference. First operand 378 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:24:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:32,705 INFO L93 Difference]: Finished difference Result 571 states and 1701 transitions. [2020-02-10 20:24:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:32,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:32,707 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:24:32,707 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:24:32,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:24:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-02-10 20:24:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1266 transitions. [2020-02-10 20:24:32,716 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:32,716 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1266 transitions. [2020-02-10 20:24:32,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1266 transitions. [2020-02-10 20:24:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:32,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:32,716 INFO L415 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] [2020-02-10 20:24:32,716 INFO L427 AbstractCegarLoop]: === Iteration 1919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:32,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1194128206, now seen corresponding path program 1913 times [2020-02-10 20:24:32,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:32,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368482121] [2020-02-10 20:24:32,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:32,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368482121] [2020-02-10 20:24:32,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:32,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897152222] [2020-02-10 20:24:32,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:32,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:32,983 INFO L87 Difference]: Start difference. First operand 375 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:33,086 INFO L93 Difference]: Finished difference Result 571 states and 1702 transitions. [2020-02-10 20:24:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:33,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:33,088 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:24:33,088 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 20:24:33,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 20:24:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 379. [2020-02-10 20:24:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1273 transitions. [2020-02-10 20:24:33,096 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1273 transitions. Word has length 22 [2020-02-10 20:24:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,096 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1273 transitions. [2020-02-10 20:24:33,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1273 transitions. [2020-02-10 20:24:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:33,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,097 INFO L415 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] [2020-02-10 20:24:33,097 INFO L427 AbstractCegarLoop]: === Iteration 1920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -338821552, now seen corresponding path program 1914 times [2020-02-10 20:24:33,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104094905] [2020-02-10 20:24:33,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:33,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104094905] [2020-02-10 20:24:33,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:33,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:33,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322458838] [2020-02-10 20:24:33,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:33,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:33,366 INFO L87 Difference]: Start difference. First operand 379 states and 1273 transitions. Second operand 9 states. [2020-02-10 20:24:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:33,462 INFO L93 Difference]: Finished difference Result 558 states and 1683 transitions. [2020-02-10 20:24:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:33,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:33,463 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:24:33,463 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 20:24:33,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 20:24:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 372. [2020-02-10 20:24:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:24:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1259 transitions. [2020-02-10 20:24:33,472 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1259 transitions. Word has length 22 [2020-02-10 20:24:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,472 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1259 transitions. [2020-02-10 20:24:33,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1259 transitions. [2020-02-10 20:24:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:33,473 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,473 INFO L415 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] [2020-02-10 20:24:33,473 INFO L427 AbstractCegarLoop]: === Iteration 1921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 487333606, now seen corresponding path program 1915 times [2020-02-10 20:24:33,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240134310] [2020-02-10 20:24:33,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:33,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240134310] [2020-02-10 20:24:33,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:33,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:33,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612226557] [2020-02-10 20:24:33,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:33,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:33,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:33,738 INFO L87 Difference]: Start difference. First operand 372 states and 1259 transitions. Second operand 9 states. [2020-02-10 20:24:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:33,833 INFO L93 Difference]: Finished difference Result 578 states and 1706 transitions. [2020-02-10 20:24:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:33,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:33,835 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:24:33,835 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:24:33,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:24:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 376. [2020-02-10 20:24:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1269 transitions. [2020-02-10 20:24:33,845 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,845 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1269 transitions. [2020-02-10 20:24:33,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1269 transitions. [2020-02-10 20:24:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:33,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,846 INFO L415 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] [2020-02-10 20:24:33,846 INFO L427 AbstractCegarLoop]: === Iteration 1922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 314085914, now seen corresponding path program 1916 times [2020-02-10 20:24:33,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40159852] [2020-02-10 20:24:33,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:34,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40159852] [2020-02-10 20:24:34,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:34,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:34,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296767051] [2020-02-10 20:24:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:34,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:34,111 INFO L87 Difference]: Start difference. First operand 376 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:34,209 INFO L93 Difference]: Finished difference Result 580 states and 1708 transitions. [2020-02-10 20:24:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:34,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:34,210 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:24:34,210 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 20:24:34,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 20:24:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 374. [2020-02-10 20:24:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1264 transitions. [2020-02-10 20:24:34,219 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1264 transitions. Word has length 22 [2020-02-10 20:24:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:34,219 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1264 transitions. [2020-02-10 20:24:34,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1264 transitions. [2020-02-10 20:24:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:34,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:34,220 INFO L415 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] [2020-02-10 20:24:34,220 INFO L427 AbstractCegarLoop]: === Iteration 1923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:34,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2098274564, now seen corresponding path program 1917 times [2020-02-10 20:24:34,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:34,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261814841] [2020-02-10 20:24:34,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:34,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261814841] [2020-02-10 20:24:34,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:34,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:34,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82422212] [2020-02-10 20:24:34,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:34,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:34,481 INFO L87 Difference]: Start difference. First operand 374 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:24:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:34,577 INFO L93 Difference]: Finished difference Result 575 states and 1698 transitions. [2020-02-10 20:24:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:34,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:34,578 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:24:34,579 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:24:34,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:24:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 376. [2020-02-10 20:24:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1267 transitions. [2020-02-10 20:24:34,588 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1267 transitions. Word has length 22 [2020-02-10 20:24:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:34,588 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1267 transitions. [2020-02-10 20:24:34,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1267 transitions. [2020-02-10 20:24:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:34,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:34,588 INFO L415 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] [2020-02-10 20:24:34,588 INFO L427 AbstractCegarLoop]: === Iteration 1924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1625237926, now seen corresponding path program 1918 times [2020-02-10 20:24:34,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:34,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797915861] [2020-02-10 20:24:34,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:34,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797915861] [2020-02-10 20:24:34,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:34,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:34,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876710263] [2020-02-10 20:24:34,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:34,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:34,848 INFO L87 Difference]: Start difference. First operand 376 states and 1267 transitions. Second operand 9 states. [2020-02-10 20:24:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:34,967 INFO L93 Difference]: Finished difference Result 569 states and 1694 transitions. [2020-02-10 20:24:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:34,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:34,969 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:24:34,969 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:24:34,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:24:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 374. [2020-02-10 20:24:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1262 transitions. [2020-02-10 20:24:34,978 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1262 transitions. Word has length 22 [2020-02-10 20:24:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:34,978 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1262 transitions. [2020-02-10 20:24:34,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1262 transitions. [2020-02-10 20:24:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:34,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:34,979 INFO L415 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] [2020-02-10 20:24:34,979 INFO L427 AbstractCegarLoop]: === Iteration 1925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:34,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash 849315716, now seen corresponding path program 1919 times [2020-02-10 20:24:34,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:34,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245461931] [2020-02-10 20:24:34,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:35,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245461931] [2020-02-10 20:24:35,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:35,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:35,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236090] [2020-02-10 20:24:35,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:35,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:35,250 INFO L87 Difference]: Start difference. First operand 374 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:24:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:35,354 INFO L93 Difference]: Finished difference Result 570 states and 1698 transitions. [2020-02-10 20:24:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:35,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:35,356 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:24:35,356 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:24:35,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:24:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 378. [2020-02-10 20:24:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1269 transitions. [2020-02-10 20:24:35,365 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:35,365 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1269 transitions. [2020-02-10 20:24:35,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1269 transitions. [2020-02-10 20:24:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:35,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:35,366 INFO L415 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] [2020-02-10 20:24:35,366 INFO L427 AbstractCegarLoop]: === Iteration 1926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:35,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:35,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1594018214, now seen corresponding path program 1920 times [2020-02-10 20:24:35,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:35,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886760467] [2020-02-10 20:24:35,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:35,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886760467] [2020-02-10 20:24:35,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:35,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:35,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956808422] [2020-02-10 20:24:35,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:35,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:35,637 INFO L87 Difference]: Start difference. First operand 378 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:35,730 INFO L93 Difference]: Finished difference Result 557 states and 1679 transitions. [2020-02-10 20:24:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:35,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:35,732 INFO L225 Difference]: With dead ends: 557 [2020-02-10 20:24:35,732 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 20:24:35,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 20:24:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 367. [2020-02-10 20:24:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-02-10 20:24:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1250 transitions. [2020-02-10 20:24:35,741 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1250 transitions. Word has length 22 [2020-02-10 20:24:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:35,741 INFO L479 AbstractCegarLoop]: Abstraction has 367 states and 1250 transitions. [2020-02-10 20:24:35,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1250 transitions. [2020-02-10 20:24:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:35,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:35,742 INFO L415 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] [2020-02-10 20:24:35,742 INFO L427 AbstractCegarLoop]: === Iteration 1927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1001171860, now seen corresponding path program 1921 times [2020-02-10 20:24:35,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:35,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751091211] [2020-02-10 20:24:35,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:36,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751091211] [2020-02-10 20:24:36,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:36,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:36,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340492739] [2020-02-10 20:24:36,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:36,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:36,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:36,013 INFO L87 Difference]: Start difference. First operand 367 states and 1250 transitions. Second operand 9 states. [2020-02-10 20:24:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,098 INFO L93 Difference]: Finished difference Result 574 states and 1668 transitions. [2020-02-10 20:24:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:36,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,100 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:24:36,100 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:24:36,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:24:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-02-10 20:24:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 20:24:36,109 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,109 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 20:24:36,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 20:24:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:36,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,110 INFO L415 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] [2020-02-10 20:24:36,110 INFO L427 AbstractCegarLoop]: === Iteration 1928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1562240352, now seen corresponding path program 1922 times [2020-02-10 20:24:36,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138394451] [2020-02-10 20:24:36,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:36,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138394451] [2020-02-10 20:24:36,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:36,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:36,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489547147] [2020-02-10 20:24:36,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:36,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:36,376 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,448 INFO L93 Difference]: Finished difference Result 567 states and 1653 transitions. [2020-02-10 20:24:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:36,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,450 INFO L225 Difference]: With dead ends: 567 [2020-02-10 20:24:36,450 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:24:36,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:24:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 373. [2020-02-10 20:24:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 20:24:36,458 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 20:24:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,458 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 20:24:36,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 20:24:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:36,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,459 INFO L415 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] [2020-02-10 20:24:36,459 INFO L427 AbstractCegarLoop]: === Iteration 1929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash -599265994, now seen corresponding path program 1923 times [2020-02-10 20:24:36,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888353829] [2020-02-10 20:24:36,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:36,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888353829] [2020-02-10 20:24:36,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:36,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:36,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071585202] [2020-02-10 20:24:36,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:36,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:36,727 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 20:24:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,802 INFO L93 Difference]: Finished difference Result 576 states and 1671 transitions. [2020-02-10 20:24:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:36,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,804 INFO L225 Difference]: With dead ends: 576 [2020-02-10 20:24:36,804 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:24:36,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:24:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 376. [2020-02-10 20:24:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 20:24:36,814 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 20:24:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,814 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 20:24:36,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 20:24:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:36,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,814 INFO L415 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] [2020-02-10 20:24:36,814 INFO L427 AbstractCegarLoop]: === Iteration 1930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1561469656, now seen corresponding path program 1924 times [2020-02-10 20:24:36,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177665316] [2020-02-10 20:24:36,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:37,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177665316] [2020-02-10 20:24:37,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:37,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:37,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878442893] [2020-02-10 20:24:37,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:37,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:37,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:37,082 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 20:24:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:37,180 INFO L93 Difference]: Finished difference Result 570 states and 1657 transitions. [2020-02-10 20:24:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:37,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:37,181 INFO L225 Difference]: With dead ends: 570 [2020-02-10 20:24:37,182 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:24:37,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:24:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 20:24:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:24:37,189 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:24:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:37,189 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:24:37,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:24:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:37,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:37,190 INFO L415 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] [2020-02-10 20:24:37,190 INFO L427 AbstractCegarLoop]: === Iteration 1931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash -544543768, now seen corresponding path program 1925 times [2020-02-10 20:24:37,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:37,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767558961] [2020-02-10 20:24:37,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:37,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767558961] [2020-02-10 20:24:37,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:37,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:37,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689425283] [2020-02-10 20:24:37,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:37,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:37,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:37,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:37,466 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:24:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:37,539 INFO L93 Difference]: Finished difference Result 560 states and 1638 transitions. [2020-02-10 20:24:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:37,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:37,541 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:24:37,541 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 20:24:37,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 20:24:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 374. [2020-02-10 20:24:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:24:37,550 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:24:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:37,551 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:24:37,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:24:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:37,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:37,551 INFO L415 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] [2020-02-10 20:24:37,551 INFO L427 AbstractCegarLoop]: === Iteration 1932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1066397190, now seen corresponding path program 1926 times [2020-02-10 20:24:37,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:37,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631215285] [2020-02-10 20:24:37,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:37,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631215285] [2020-02-10 20:24:37,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:37,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:37,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567362936] [2020-02-10 20:24:37,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:37,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:37,851 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:24:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:37,960 INFO L93 Difference]: Finished difference Result 561 states and 1639 transitions. [2020-02-10 20:24:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:37,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:37,962 INFO L225 Difference]: With dead ends: 561 [2020-02-10 20:24:37,962 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:24:37,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:24:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 371. [2020-02-10 20:24:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:24:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 20:24:37,971 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:37,971 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 20:24:37,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 20:24:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:37,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:37,972 INFO L415 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] [2020-02-10 20:24:37,972 INFO L427 AbstractCegarLoop]: === Iteration 1933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1965098016, now seen corresponding path program 1927 times [2020-02-10 20:24:37,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:37,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808963356] [2020-02-10 20:24:37,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808963356] [2020-02-10 20:24:38,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:38,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473845265] [2020-02-10 20:24:38,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:38,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:38,243 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:38,311 INFO L93 Difference]: Finished difference Result 578 states and 1676 transitions. [2020-02-10 20:24:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:38,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:38,313 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:24:38,313 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 20:24:38,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 20:24:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 375. [2020-02-10 20:24:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:24:38,321 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:24:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:38,321 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:24:38,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:24:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:38,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:38,322 INFO L415 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] [2020-02-10 20:24:38,322 INFO L427 AbstractCegarLoop]: === Iteration 1934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1404029524, now seen corresponding path program 1928 times [2020-02-10 20:24:38,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:38,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021331787] [2020-02-10 20:24:38,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021331787] [2020-02-10 20:24:38,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:38,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443774297] [2020-02-10 20:24:38,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:38,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:38,591 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:24:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:38,669 INFO L93 Difference]: Finished difference Result 571 states and 1661 transitions. [2020-02-10 20:24:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:38,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:38,671 INFO L225 Difference]: With dead ends: 571 [2020-02-10 20:24:38,671 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 20:24:38,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 20:24:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-02-10 20:24:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:24:38,680 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:24:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:38,680 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:24:38,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:24:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:38,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:38,681 INFO L415 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] [2020-02-10 20:24:38,681 INFO L427 AbstractCegarLoop]: === Iteration 1935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1742123958, now seen corresponding path program 1929 times [2020-02-10 20:24:38,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:38,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24113007] [2020-02-10 20:24:38,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24113007] [2020-02-10 20:24:38,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:38,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652411147] [2020-02-10 20:24:38,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:38,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:38,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:38,955 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:24:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,040 INFO L93 Difference]: Finished difference Result 584 states and 1689 transitions. [2020-02-10 20:24:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:39,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,042 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:24:39,042 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:24:39,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:24:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 378. [2020-02-10 20:24:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 20:24:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-02-10 20:24:39,051 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-02-10 20:24:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:39,051 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-02-10 20:24:39,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-02-10 20:24:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:39,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:39,052 INFO L415 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] [2020-02-10 20:24:39,052 INFO L427 AbstractCegarLoop]: === Iteration 1936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash -530926680, now seen corresponding path program 1930 times [2020-02-10 20:24:39,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:39,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274446835] [2020-02-10 20:24:39,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:39,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274446835] [2020-02-10 20:24:39,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:39,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:39,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730268561] [2020-02-10 20:24:39,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:39,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:39,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:39,321 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:24:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,416 INFO L93 Difference]: Finished difference Result 580 states and 1677 transitions. [2020-02-10 20:24:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:39,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,417 INFO L225 Difference]: With dead ends: 580 [2020-02-10 20:24:39,417 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:24:39,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:24:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 373. [2020-02-10 20:24:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:24:39,426 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:39,426 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:24:39,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:24:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:39,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:39,427 INFO L415 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] [2020-02-10 20:24:39,427 INFO L427 AbstractCegarLoop]: === Iteration 1937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1796846184, now seen corresponding path program 1931 times [2020-02-10 20:24:39,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:39,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043086155] [2020-02-10 20:24:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:39,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043086155] [2020-02-10 20:24:39,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:39,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:39,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496401673] [2020-02-10 20:24:39,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:39,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:39,695 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,777 INFO L93 Difference]: Finished difference Result 566 states and 1650 transitions. [2020-02-10 20:24:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:39,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,778 INFO L225 Difference]: With dead ends: 566 [2020-02-10 20:24:39,778 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 20:24:39,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 20:24:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 374. [2020-02-10 20:24:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 20:24:39,787 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:39,788 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 20:24:39,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 20:24:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:39,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:39,788 INFO L415 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] [2020-02-10 20:24:39,788 INFO L427 AbstractCegarLoop]: === Iteration 1938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1962891310, now seen corresponding path program 1932 times [2020-02-10 20:24:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:39,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727400499] [2020-02-10 20:24:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:40,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727400499] [2020-02-10 20:24:40,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:40,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:40,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851467972] [2020-02-10 20:24:40,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:40,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:40,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:40,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:40,055 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:40,150 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-02-10 20:24:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:40,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:40,152 INFO L225 Difference]: With dead ends: 569 [2020-02-10 20:24:40,152 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:24:40,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:24:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 371. [2020-02-10 20:24:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:24:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 20:24:40,161 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 20:24:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,161 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 20:24:40,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 20:24:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:40,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,161 INFO L415 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] [2020-02-10 20:24:40,162 INFO L427 AbstractCegarLoop]: === Iteration 1939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1639501792, now seen corresponding path program 1933 times [2020-02-10 20:24:40,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828940448] [2020-02-10 20:24:40,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:40,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828940448] [2020-02-10 20:24:40,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:40,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:40,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824704549] [2020-02-10 20:24:40,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:40,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:40,427 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:24:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:40,499 INFO L93 Difference]: Finished difference Result 584 states and 1691 transitions. [2020-02-10 20:24:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:40,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:40,501 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:24:40,501 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 20:24:40,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 20:24:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 377. [2020-02-10 20:24:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 20:24:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-02-10 20:24:40,510 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-02-10 20:24:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,510 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-02-10 20:24:40,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-02-10 20:24:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:40,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,511 INFO L415 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] [2020-02-10 20:24:40,511 INFO L427 AbstractCegarLoop]: === Iteration 1940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1693261842, now seen corresponding path program 1934 times [2020-02-10 20:24:40,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37761233] [2020-02-10 20:24:40,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:40,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37761233] [2020-02-10 20:24:40,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:40,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:40,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796437616] [2020-02-10 20:24:40,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:40,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:40,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:40,774 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-02-10 20:24:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:40,867 INFO L93 Difference]: Finished difference Result 578 states and 1677 transitions. [2020-02-10 20:24:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:40,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:40,869 INFO L225 Difference]: With dead ends: 578 [2020-02-10 20:24:40,869 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 20:24:40,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 20:24:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 374. [2020-02-10 20:24:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 20:24:40,878 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 20:24:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,878 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 20:24:40,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 20:24:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:40,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,879 INFO L415 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] [2020-02-10 20:24:40,879 INFO L427 AbstractCegarLoop]: === Iteration 1941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash -626809260, now seen corresponding path program 1935 times [2020-02-10 20:24:40,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624240887] [2020-02-10 20:24:40,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:41,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624240887] [2020-02-10 20:24:41,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:41,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:41,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750459691] [2020-02-10 20:24:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:41,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:41,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:41,150 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:24:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:41,224 INFO L93 Difference]: Finished difference Result 588 states and 1698 transitions. [2020-02-10 20:24:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:41,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:41,226 INFO L225 Difference]: With dead ends: 588 [2020-02-10 20:24:41,226 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 20:24:41,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 20:24:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 20:24:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 20:24:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1279 transitions. [2020-02-10 20:24:41,235 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1279 transitions. Word has length 22 [2020-02-10 20:24:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:41,235 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1279 transitions. [2020-02-10 20:24:41,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1279 transitions. [2020-02-10 20:24:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:41,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:41,236 INFO L415 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] [2020-02-10 20:24:41,236 INFO L427 AbstractCegarLoop]: === Iteration 1942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1395107398, now seen corresponding path program 1936 times [2020-02-10 20:24:41,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:41,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286112626] [2020-02-10 20:24:41,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:41,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286112626] [2020-02-10 20:24:41,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:41,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:41,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69383980] [2020-02-10 20:24:41,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:41,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:41,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:41,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:41,509 INFO L87 Difference]: Start difference. First operand 379 states and 1279 transitions. Second operand 9 states. [2020-02-10 20:24:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:41,613 INFO L93 Difference]: Finished difference Result 584 states and 1686 transitions. [2020-02-10 20:24:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:41,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:41,615 INFO L225 Difference]: With dead ends: 584 [2020-02-10 20:24:41,615 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 20:24:41,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 20:24:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-02-10 20:24:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 20:24:41,624 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:41,625 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 20:24:41,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 20:24:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:41,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:41,625 INFO L415 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] [2020-02-10 20:24:41,625 INFO L427 AbstractCegarLoop]: === Iteration 1943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash 89769710, now seen corresponding path program 1937 times [2020-02-10 20:24:41,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172954551] [2020-02-10 20:24:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:41,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172954551] [2020-02-10 20:24:41,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:41,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:41,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291116406] [2020-02-10 20:24:41,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:41,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:41,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:41,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:41,886 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:41,996 INFO L93 Difference]: Finished difference Result 573 states and 1665 transitions. [2020-02-10 20:24:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:41,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:41,997 INFO L225 Difference]: With dead ends: 573 [2020-02-10 20:24:41,998 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 20:24:41,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 20:24:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 376. [2020-02-10 20:24:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 20:24:42,006 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 20:24:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:42,006 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 20:24:42,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 20:24:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:42,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:42,007 INFO L415 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] [2020-02-10 20:24:42,007 INFO L427 AbstractCegarLoop]: === Iteration 1944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -83477982, now seen corresponding path program 1938 times [2020-02-10 20:24:42,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:42,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34357705] [2020-02-10 20:24:42,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:42,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34357705] [2020-02-10 20:24:42,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:42,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:42,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882453276] [2020-02-10 20:24:42,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:42,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:42,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:42,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:42,270 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 20:24:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:42,372 INFO L93 Difference]: Finished difference Result 575 states and 1667 transitions. [2020-02-10 20:24:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:42,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:42,374 INFO L225 Difference]: With dead ends: 575 [2020-02-10 20:24:42,374 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:24:42,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:24:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 371. [2020-02-10 20:24:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:24:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 20:24:42,383 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 20:24:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:42,383 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 20:24:42,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 20:24:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:42,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:42,384 INFO L415 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] [2020-02-10 20:24:42,384 INFO L427 AbstractCegarLoop]: === Iteration 1945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -101644628, now seen corresponding path program 1939 times [2020-02-10 20:24:42,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:42,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532962418] [2020-02-10 20:24:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:42,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532962418] [2020-02-10 20:24:42,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:42,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:42,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310856679] [2020-02-10 20:24:42,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:42,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:42,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:42,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:42,670 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 20:24:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:42,745 INFO L93 Difference]: Finished difference Result 553 states and 1622 transitions. [2020-02-10 20:24:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:42,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:42,747 INFO L225 Difference]: With dead ends: 553 [2020-02-10 20:24:42,747 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 20:24:42,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 20:24:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2020-02-10 20:24:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 20:24:42,756 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:42,756 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 20:24:42,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 20:24:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:42,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:42,757 INFO L415 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] [2020-02-10 20:24:42,757 INFO L427 AbstractCegarLoop]: === Iteration 1946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1509296330, now seen corresponding path program 1940 times [2020-02-10 20:24:42,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:42,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637829255] [2020-02-10 20:24:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:43,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637829255] [2020-02-10 20:24:43,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:43,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:43,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233896566] [2020-02-10 20:24:43,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:43,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:43,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:43,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:43,035 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:43,145 INFO L93 Difference]: Finished difference Result 554 states and 1623 transitions. [2020-02-10 20:24:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:43,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,147 INFO L225 Difference]: With dead ends: 554 [2020-02-10 20:24:43,147 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:24:43,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:24:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 372. [2020-02-10 20:24:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:24:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 20:24:43,156 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 20:24:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,156 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 20:24:43,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 20:24:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:43,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,157 INFO L415 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] [2020-02-10 20:24:43,157 INFO L427 AbstractCegarLoop]: === Iteration 1947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash 911047904, now seen corresponding path program 1941 times [2020-02-10 20:24:43,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234910646] [2020-02-10 20:24:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:43,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234910646] [2020-02-10 20:24:43,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:43,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490901140] [2020-02-10 20:24:43,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:43,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:43,434 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 20:24:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:43,508 INFO L93 Difference]: Finished difference Result 555 states and 1625 transitions. [2020-02-10 20:24:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:43,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,510 INFO L225 Difference]: With dead ends: 555 [2020-02-10 20:24:43,510 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:24:43,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:24:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 373. [2020-02-10 20:24:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1265 transitions. [2020-02-10 20:24:43,518 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1265 transitions. Word has length 22 [2020-02-10 20:24:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,518 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1265 transitions. [2020-02-10 20:24:43,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1265 transitions. [2020-02-10 20:24:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:43,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,519 INFO L415 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] [2020-02-10 20:24:43,519 INFO L427 AbstractCegarLoop]: === Iteration 1948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1446277706, now seen corresponding path program 1942 times [2020-02-10 20:24:43,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294767156] [2020-02-10 20:24:43,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:43,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294767156] [2020-02-10 20:24:43,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:43,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:43,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897856692] [2020-02-10 20:24:43,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:43,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:43,791 INFO L87 Difference]: Start difference. First operand 373 states and 1265 transitions. Second operand 9 states. [2020-02-10 20:24:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:43,890 INFO L93 Difference]: Finished difference Result 558 states and 1630 transitions. [2020-02-10 20:24:43,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:43,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,892 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:24:43,892 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 20:24:43,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 20:24:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 20:24:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 20:24:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 20:24:43,900 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 20:24:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,900 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 20:24:43,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 20:24:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:43,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,901 INFO L415 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] [2020-02-10 20:24:43,901 INFO L427 AbstractCegarLoop]: === Iteration 1949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash 921551008, now seen corresponding path program 1943 times [2020-02-10 20:24:43,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199685203] [2020-02-10 20:24:43,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:44,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199685203] [2020-02-10 20:24:44,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:44,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:44,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621543294] [2020-02-10 20:24:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:44,168 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 20:24:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:44,265 INFO L93 Difference]: Finished difference Result 558 states and 1631 transitions. [2020-02-10 20:24:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:44,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:44,266 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:24:44,266 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 20:24:44,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 20:24:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 374. [2020-02-10 20:24:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 20:24:44,275 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 20:24:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:44,275 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 20:24:44,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 20:24:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:44,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:44,276 INFO L415 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] [2020-02-10 20:24:44,276 INFO L427 AbstractCegarLoop]: === Iteration 1950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:44,276 INFO L82 PathProgramCache]: Analyzing trace with hash -154160148, now seen corresponding path program 1944 times [2020-02-10 20:24:44,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:44,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8329895] [2020-02-10 20:24:44,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:44,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8329895] [2020-02-10 20:24:44,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:44,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:44,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922388366] [2020-02-10 20:24:44,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:44,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:44,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:44,546 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 20:24:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:44,646 INFO L93 Difference]: Finished difference Result 560 states and 1633 transitions. [2020-02-10 20:24:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:44,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:44,648 INFO L225 Difference]: With dead ends: 560 [2020-02-10 20:24:44,648 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 20:24:44,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 20:24:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 369. [2020-02-10 20:24:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 20:24:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-02-10 20:24:44,657 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-02-10 20:24:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:44,657 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-02-10 20:24:44,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-02-10 20:24:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:44,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:44,658 INFO L415 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] [2020-02-10 20:24:44,658 INFO L427 AbstractCegarLoop]: === Iteration 1951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash 578686134, now seen corresponding path program 1945 times [2020-02-10 20:24:44,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:44,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701620238] [2020-02-10 20:24:44,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:44,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701620238] [2020-02-10 20:24:44,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:44,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:44,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906481771] [2020-02-10 20:24:44,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:44,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:44,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:44,916 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-02-10 20:24:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:44,991 INFO L93 Difference]: Finished difference Result 572 states and 1657 transitions. [2020-02-10 20:24:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:44,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:44,992 INFO L225 Difference]: With dead ends: 572 [2020-02-10 20:24:44,992 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 20:24:44,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 20:24:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-02-10 20:24:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 20:24:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 20:24:45,001 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 20:24:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:45,001 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 20:24:45,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 20:24:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:45,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:45,001 INFO L415 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] [2020-02-10 20:24:45,002 INFO L427 AbstractCegarLoop]: === Iteration 1952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1139754626, now seen corresponding path program 1946 times [2020-02-10 20:24:45,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:45,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71434498] [2020-02-10 20:24:45,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:45,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71434498] [2020-02-10 20:24:45,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:45,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:45,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321241335] [2020-02-10 20:24:45,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:45,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:45,266 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:24:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:45,342 INFO L93 Difference]: Finished difference Result 565 states and 1642 transitions. [2020-02-10 20:24:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:45,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:45,344 INFO L225 Difference]: With dead ends: 565 [2020-02-10 20:24:45,344 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 20:24:45,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 20:24:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-02-10 20:24:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 20:24:45,353 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 20:24:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:45,353 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 20:24:45,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 20:24:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:45,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:45,354 INFO L415 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] [2020-02-10 20:24:45,354 INFO L427 AbstractCegarLoop]: === Iteration 1953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:45,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1021751720, now seen corresponding path program 1947 times [2020-02-10 20:24:45,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:45,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641935914] [2020-02-10 20:24:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:45,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641935914] [2020-02-10 20:24:45,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:45,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:45,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508328814] [2020-02-10 20:24:45,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:45,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:45,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:45,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:45,616 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 20:24:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:45,689 INFO L93 Difference]: Finished difference Result 574 states and 1660 transitions. [2020-02-10 20:24:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:45,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:45,691 INFO L225 Difference]: With dead ends: 574 [2020-02-10 20:24:45,691 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 20:24:45,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 20:24:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 376. [2020-02-10 20:24:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 20:24:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-02-10 20:24:45,700 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-02-10 20:24:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:45,700 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-02-10 20:24:45,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-02-10 20:24:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:45,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:45,701 INFO L415 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] [2020-02-10 20:24:45,701 INFO L427 AbstractCegarLoop]: === Iteration 1954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1983955382, now seen corresponding path program 1948 times [2020-02-10 20:24:45,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:45,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558766348] [2020-02-10 20:24:45,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:45,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558766348] [2020-02-10 20:24:45,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:45,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:45,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252935149] [2020-02-10 20:24:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:45,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:45,957 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-02-10 20:24:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:46,071 INFO L93 Difference]: Finished difference Result 568 states and 1646 transitions. [2020-02-10 20:24:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:46,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:46,073 INFO L225 Difference]: With dead ends: 568 [2020-02-10 20:24:46,073 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 20:24:46,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 20:24:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 373. [2020-02-10 20:24:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 20:24:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 20:24:46,082 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 20:24:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:46,082 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 20:24:46,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 20:24:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:46,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:46,083 INFO L415 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] [2020-02-10 20:24:46,083 INFO L427 AbstractCegarLoop]: === Iteration 1955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash -967029494, now seen corresponding path program 1949 times [2020-02-10 20:24:46,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:46,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042162529] [2020-02-10 20:24:46,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:46,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042162529] [2020-02-10 20:24:46,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:46,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:46,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038955178] [2020-02-10 20:24:46,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:46,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:46,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:46,350 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 20:24:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:46,425 INFO L93 Difference]: Finished difference Result 558 states and 1627 transitions. [2020-02-10 20:24:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:46,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:46,426 INFO L225 Difference]: With dead ends: 558 [2020-02-10 20:24:46,427 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 20:24:46,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 20:24:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 374. [2020-02-10 20:24:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 20:24:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 20:24:46,435 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 20:24:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:46,435 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 20:24:46,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 20:24:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:46,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:46,436 INFO L415 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] [2020-02-10 20:24:46,436 INFO L427 AbstractCegarLoop]: === Iteration 1956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 643911464, now seen corresponding path program 1950 times [2020-02-10 20:24:46,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:46,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050722744] [2020-02-10 20:24:46,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:46,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050722744] [2020-02-10 20:24:46,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:46,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 20:24:46,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495023762] [2020-02-10 20:24:46,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 20:24:46,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 20:24:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:24:46,706 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 20:24:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:46,819 INFO L93 Difference]: Finished difference Result 559 states and 1628 transitions. [2020-02-10 20:24:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 20:24:46,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 20:24:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:46,820 INFO L225 Difference]: With dead ends: 559 [2020-02-10 20:24:46,820 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 20:24:46,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 20:24:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2020-02-10 20:24:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 20:24:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 20:24:46,829 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 20:24:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:46,830 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 20:24:46,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 20:24:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 20:24:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 20:24:46,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:46,830 INFO L415 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] [2020-02-10 20:24:46,830 INFO L427 AbstractCegarLoop]: === Iteration 1957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash -461549664, now seen corresponding path program 1951 times [2020-02-10 20:24:46,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:46,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573623685] [2020-02-10 20:24:46,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-02-10 20:24:47,051 WARN L209 SmtUtils]: Removed 9 from assertion stack [2020-02-10 20:24:47,051 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:24:47,055 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:24:47,055 INFO L202 PluginConnector]: Adding new model example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:24:47 BasicIcfg [2020-02-10 20:24:47,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:24:47,057 INFO L168 Benchmark]: Toolchain (without parser) took 765613.67 ms. Allocated memory was 144.2 MB in the beginning and 1.0 GB in the end (delta: 864.0 MB). Free memory was 118.1 MB in the beginning and 959.4 MB in the end (delta: -841.3 MB). Peak memory consumption was 872.9 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:47,057 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.43 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:24:47,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.56 ms. Allocated memory is still 144.2 MB. Free memory was 117.9 MB in the beginning and 116.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:47,058 INFO L168 Benchmark]: Boogie Preprocessor took 26.28 ms. Allocated memory is still 144.2 MB. Free memory was 116.1 MB in the beginning and 115.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:47,058 INFO L168 Benchmark]: RCFGBuilder took 371.59 ms. Allocated memory is still 144.2 MB. Free memory was 115.0 MB in the beginning and 102.2 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:47,059 INFO L168 Benchmark]: TraceAbstraction took 765166.97 ms. Allocated memory was 144.2 MB in the beginning and 1.0 GB in the end (delta: 864.0 MB). Free memory was 101.8 MB in the beginning and 959.4 MB in the end (delta: -857.6 MB). Peak memory consumption was 856.6 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:47,060 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.43 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.56 ms. Allocated memory is still 144.2 MB. Free memory was 117.9 MB in the beginning and 116.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.28 ms. Allocated memory is still 144.2 MB. Free memory was 116.1 MB in the beginning and 115.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.59 ms. Allocated memory is still 144.2 MB. Free memory was 115.0 MB in the beginning and 102.2 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 765166.97 ms. Allocated memory was 144.2 MB in the beginning and 1.0 GB in the end (delta: 864.0 MB). Free memory was 101.8 MB in the beginning and 959.4 MB in the end (delta: -857.6 MB). Peak memory consumption was 856.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.5s, 60 ProgramPointsBefore, 52 ProgramPointsAfterwards, 80 TransitionsBefore, 72 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 336 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 357 CheckedPairsTotal, 8 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 23 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 43 for 31ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 764.9s, OverallIterations: 1957, TraceHistogramMax: 1, AutomataDifference: 206.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 130423 SDtfs, 198903 SDslu, 315677 SDs, 0 SdLazy, 101934 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17568 GetRequests, 1962 SyntacticMatches, 0 SemanticMatches, 15606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9750 ImplicationChecksByTransitivity, 593.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2316occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.2s AutomataMinimizationTime, 1956 MinimizatonAttempts, 384646 StatesRemovedByMinimization, 1950 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 525.9s InterpolantComputationTime, 43032 NumberOfCodeBlocks, 43032 NumberOfCodeBlocksAsserted, 1956 NumberOfCheckSat, 41076 ConstructedInterpolants, 0 QuantifiedInterpolants, 19827087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1956 InterpolantComputations, 1956 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown